Computational distinguishability of degradable and antidegradable channels

Details Computational distinguishability of degradable and antidegradable channels Computational distinguishability of degradable and antidegradable channels

2009-11-11

arxiv.org/abs/0911.2109v1

Quant. Inf. Comp. 10 (2010) 735-746

Physics

Quantum Physics

11 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computational distinguishability of degradable and antidegradable channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computational distinguishability of degradable and antidegradable channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational distinguishability of degradable and antidegradable channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-533593