Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0911.2109 · Quantum Information and Computation

Computational distinguishability of degradable and antidegradable channels

Bill Rosgen

Published Sep 1, 2010• 3 citations
arXivHTMLPDF

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 -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.

DOI
10.26421/qic10.9-10-2

Related papers

Computational Distinguishability of Quantum Channels

Bill Rosgen

The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of problems solvable by a classical computation in polynomial space. Several restrictions of distinguishability are also shown to be hard. It is no easier when restricted to quantum computations of logarithmic depth, to mixed-unitary channels, to degradable channels, or to antidegradable channels. These hardness results are demonstrated by finding reductions between these classes of quantum channels. These techniques have applications outside the distinguishability problem, as the construction for mixed-unitary channels is used to prove that the additivity problem for the classical capacity of quantum channels can be equivalently restricted to the mixed unitary channels.

arXiv:0909.3930•Sep 22, 2009•9 citations

Degradable quantum channels using pure-state to product-of-pure-state isometries

Vikesh Siddhu, Robert B. Griffiths

We consider a family of quantum channels characterized by the fact that certain (in general nonorthogonal) pure states at the channel entrance are mapped to (tensor) products of pure states (PPP; hence ``pcubed'') at the complementary outputs (the main output and the ``environment'') of the channel. The pcubed construction, a reformulation of the twisted-diagonal procedure by M. M. Wolf and D. P\'erez-Garc\'{\i}a [Phys. Rev. A 75, 012303 (2007)], can be used to produce a large class of degradable quantum channels; degradable channels are of interest because their quantum capacities are easy to calculate. Several known types of degradable channels are either pcubed channels, or subchannels (employing a subspace of the channel entrance), or continuous limits of pcubed channels. The pcubed construction also yields channels which are neither degradable nor antidegradable (i.e., the complement of a degradable channel); a particular example of a qutrit channel of this type is studied in some detail. Determining whether a pcubed channel is degradable or antidegradable or neither is quite straightforward given the pure input and output states that characterize the channel. Conjugate degradable pcubed channels are always degradable.

arXiv:1511.05532•Physical Review A•Nov 23, 2016•6 citations

The Structure and Quantum Capacity of a Partially Degradable Quantum Channel

László Gyöngyösi

The quantum capacity of degradable quantum channels has been proven to be additive. On the other hand, there is no general rule for the behavior of quantum capacity for antidegradable quantum channels. We introduce the set of partially degradable (PD) quantum channels to answer the question of additivity of quantum capacity for a well-separable subset of antidegradable channels. A quantum channel is PD if the channel output can be used to simulate the degraded environment state. The PD channels could exist both in the degradable, antidegradable and conjugate degradable family. We define the term partial simulation, which is a clear benefit that arises from the structure of the complementary channel of a PD channel. We prove that the quantum capacity of an arbitrary dimensional PD channel is additive. We also demonstrate that better quantum data rates can be achieved over a PD channel in comparison with standard (non-PD) channels. Our results indicate that the partial degradability property can be exploited and yet still hold many benefits for quantum communications.

arXiv:1304.5666•IEEE Access•Jan 1, 2014•16 citations

A Characterization of Antidegradable Qubit Channels

Connor Paddock, Jianxin Chen

This paper provides a characterization for the set of antidegradable qubit channels. The characterization arises from the correspondence between the antidegradability of a channel and the symmetric extendibility of its Choi operator. Using an inequality derived to describe the set of bipartite qubit states which admit symmetric extension, we are able to characterize the set of all antidegradable qubit channels. Using the characterization we investigate the antidegradability of unital qubit channels and arbitrary qubit channels with respect to the dimension of the environment. We additionally provide a condition which describes qubit channels which are simultaneously degradable and antidegradable along with a classification of self-complementary qubit channels.

arXiv:1712.03399•Dec 9, 2017•3 citations

The structure of degradable quantum channels

Toby S. Cubitt, Mary Beth Ruskai, Graeme Smith

Degradable quantum channels are among the only channels whose quantum and private classical capacities are known. As such, determining the structure of these channels is a pressing open question in quantum information theory. We give a comprehensive review of what is currently known about the structure of degradable quantum channels, including a number of new results as well as alternate proofs of some known results. In the case of qubits, we provide a complete characterization of all degradable channels with two dimensional output, give a new proof that a qubit channel with two Kraus operators is either degradable or anti-degradable, and present a complete description of anti-degradable unital qubit channels with a new proof. For higher output dimensions we explore the relationship between the output and environment dimensions (dB and dE, respectively) of degradable channels. For several broad classes of channels we show that they can be modeled with an environment that is “small” in the sense of ΦC. Such channels include all those with qubit or qutrit output, those that map some pure state to an output with full rank, and all those which can be represented using simultaneously diagonal Kraus operators, even in a non-orthogonal basis. Perhaps surprisingly, we also present examples of degradable channels with “large” environments, in the sense that the minimal dimension dE>dB. Indeed, one can have dE>14dB2. These examples can also be used to give a negative answer to the question of whether additivity of the coherent information is helpful for establishing additivity for the Holevo capacity of a pair of channels. In the case of channels with diagonal Kraus operators, we describe the subclasses that are complements of entanglement breaking channels. We also obtain a number of results for channels in the convex hull of conjugations with generalized Pauli matrices. However, a number of open questions remain about these channels and the more general case of random unitary channels.

arXiv:0802.1360•Journal of Mathematical Physics•Oct 1, 2008•111 citations

Degradable and Antidegradable Qubit Channels

Connor Paddock

This thesis investigates a characterization for the set of antidegradable qubit channels. The characterization comes from a correspondence between the antidegradability of a channel, and the symmetric extendibility of the Choi operator. Using an inequality intended to describe the set of bipartite qubit states which admit symmetric extension, we demonstrate that it additionally provides a condition to characterize the set of antidegradable qubit channels. Using the characterization we investigate the antidegradability of qubit channels with respect to the rank of the Choi matrix. We also apply the antidegradability criterion to the qubit amplitude damping and qubit depolarizing channel. We end by discussing degradable and antidegradable channels in terms of their channel capacities and the applications of these results to investigating phenomena such as super-additive coherent information and superactivation.

•Sep 7, 2016•1 citation
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 -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.
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be surprisingly hard: it is complete for the class QIP of problems that have quantum interactive proof systems, which implies that it is hard for the class PSPACE of problems solvable by a classical computation in polynomial space. Several restrictions of distinguishability are also shown to be hard. It is no easier when restricted to quantum computations of logarithmic depth, to mixed-unitary channels, to degradable channels, or to antidegradable channels. These hardness results are demonstrated by finding reductions between these classes of quantum channels. These techniques have applications outside the distinguishability problem, as the construction for mixed-unitary channels is used to prove that the additivity problem for the classical capacity of quantum channels can be equivalently restricted to the mixed unitary channels.
We consider a family of quantum channels characterized by the fact that certain (in general nonorthogonal) pure states at the channel entrance are mapped to (tensor) products of pure states (PPP; hence ``pcubed'') at the complementary outputs (the main output and the ``environment'') of the channel. The pcubed construction, a reformulation of the twisted-diagonal procedure by M. M. Wolf and D. P\'erez-Garc\'{\i}a [Phys. Rev. A 75, 012303 (2007)], can be used to produce a large class of degradable quantum channels; degradable channels are of interest because their quantum capacities are easy to calculate. Several known types of degradable channels are either pcubed channels, or subchannels (employing a subspace of the channel entrance), or continuous limits of pcubed channels. The pcubed construction also yields channels which are neither degradable nor antidegradable (i.e., the complement of a degradable channel); a particular example of a qutrit channel of this type is studied in some detail. Determining whether a pcubed channel is degradable or antidegradable or neither is quite straightforward given the pure input and output states that characterize the channel. Conjugate degradable pcubed channels are always degradable.
The quantum capacity of degradable quantum channels has been proven to be additive. On the other hand, there is no general rule for the behavior of quantum capacity for antidegradable quantum channels. We introduce the set of partially degradable (PD) quantum channels to answer the question of additivity of quantum capacity for a well-separable subset of antidegradable channels. A quantum channel is PD if the channel output can be used to simulate the degraded environment state. The PD channels could exist both in the degradable, antidegradable and conjugate degradable family. We define the term partial simulation, which is a clear benefit that arises from the structure of the complementary channel of a PD channel. We prove that the quantum capacity of an arbitrary dimensional PD channel is additive. We also demonstrate that better quantum data rates can be achieved over a PD channel in comparison with standard (non-PD) channels. Our results indicate that the partial degradability property can be exploited and yet still hold many benefits for quantum communications.
This paper provides a characterization for the set of antidegradable qubit channels. The characterization arises from the correspondence between the antidegradability of a channel and the symmetric extendibility of its Choi operator. Using an inequality derived to describe the set of bipartite qubit states which admit symmetric extension, we are able to characterize the set of all antidegradable qubit channels. Using the characterization we investigate the antidegradability of unital qubit channels and arbitrary qubit channels with respect to the dimension of the environment. We additionally provide a condition which describes qubit channels which are simultaneously degradable and antidegradable along with a classification of self-complementary qubit channels.
Degradable quantum channels are among the only channels whose quantum and private classical capacities are known. As such, determining the structure of these channels is a pressing open question in quantum information theory. We give a comprehensive review of what is currently known about the structure of degradable quantum channels, including a number of new results as well as alternate proofs of some known results. In the case of qubits, we provide a complete characterization of all degradable channels with two dimensional output, give a new proof that a qubit channel with two Kraus operators is either degradable or anti-degradable, and present a complete description of anti-degradable unital qubit channels with a new proof. For higher output dimensions we explore the relationship between the output and environment dimensions (dB and dE, respectively) of degradable channels. For several broad classes of channels we show that they can be modeled with an environment that is “small” in the sense of ΦC. Such channels include all those with qubit or qutrit output, those that map some pure state to an output with full rank, and all those which can be represented using simultaneously diagonal Kraus operators, even in a non-orthogonal basis. Perhaps surprisingly, we also present examples of degradable channels with “large” environments, in the sense that the minimal dimension dE>dB. Indeed, one can have dE>14dB2. These examples can also be used to give a negative answer to the question of whether additivity of the coherent information is helpful for establishing additivity for the Holevo capacity of a pair of channels. In the case of channels with diagonal Kraus operators, we describe the subclasses that are complements of entanglement breaking channels. We also obtain a number of results for channels in the convex hull of conjugations with generalized Pauli matrices. However, a number of open questions remain about these channels and the more general case of random unitary channels.
This thesis investigates a characterization for the set of antidegradable qubit channels. The characterization comes from a correspondence between the antidegradability of a channel, and the symmetric extendibility of the Choi operator. Using an inequality intended to describe the set of bipartite qubit states which admit symmetric extension, we demonstrate that it additionally provides a condition to characterize the set of antidegradable qubit channels. Using the characterization we investigate the antidegradability of qubit channels with respect to the rank of the Choi matrix. We also apply the antidegradability criterion to the qubit amplitude damping and qubit depolarizing channel. We end by discussing degradable and antidegradable channels in terms of their channel capacities and the applications of these results to investigating phenomena such as super-additive coherent information and superactivation.