Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/116959
DC FieldValue
dc.titleComputational distinguishability of degradable and antidegradable channels
dc.contributor.authorRosgen, B.
dc.date.accessioned2014-12-12T07:59:42Z
dc.date.available2014-12-12T07:59:42Z
dc.date.issued2010-09-01
dc.identifier.citationRosgen, B. (2010-09-01). Computational distinguishability of degradable and antidegradable channels. Quantum Information and Computation 10 (9-10) : 735-746. ScholarBank@NUS Repository.
dc.identifier.issn15337146
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/116959
dc.description.abstractA 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 [1] that embeds any channel into a degradable channel, and a related construction for the case of antidegradable channels. © Rinton Press.
dc.sourceScopus
dc.subjectChannel distinguishability
dc.subjectDegradable channels
dc.subjectQuantum information
dc.typeArticle
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.sourcetitleQuantum Information and Computation
dc.description.volume10
dc.description.issue9-10
dc.description.page735-746
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

53
checked on Dec 2, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.