Please use this identifier to cite or link to this item:
|Title:||Computational distinguishability of degradable and antidegradable channels||Authors:||Rosgen, B.||Keywords:||Channel distinguishability
|Issue Date:||1-Sep-2010||Citation:||Rosgen, B. (2010-09-01). Computational distinguishability of degradable and antidegradable channels. Quantum Information and Computation 10 (9-10) : 735-746. ScholarBank@NUS Repository.||Abstract:||A channel is degradable if there exists a second channel that maps the output state of the channel to the environment state. These channels satisfy the property that the output state contains more information about the input than the environment does. A complementary class of channels is the antidegradable channels, which admit channels that map the environment state to the output state of the channel. In this paper we show that the computational problem of distinguishing two channels remains PSPACE- complete when restricted to these classes of channels. This is shown using a construction of Cubitt, Ruskai, and Smith  that embeds any channel into a degradable channel, and a related construction for the case of antidegradable channels. © Rinton Press.||Source Title:||Quantum Information and Computation||URI:||http://scholarbank.nus.edu.sg/handle/10635/116959||ISSN:||15337146|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.