Positivity and Nonadditivity of Quantum Capacities Using Generalized Erasure Channels

@article{Siddhu2021PositivityAN,
  title={Positivity and Nonadditivity of Quantum Capacities Using Generalized Erasure Channels},
  author={Vikesh Siddhu and Robert B. Griffiths},
  journal={IEEE Transactions on Information Theory},
  year={2021},
  volume={67},
  pages={4533-4545}
}
We consider various forms of a process, which we call <italic>gluing</italic>, for combining two or more complementary quantum channel pairs <inline-formula> <tex-math notation="LaTeX">$({\mathcal B}, {\mathcal C})$ </tex-math></inline-formula> to form a composite. One type of gluing combines a perfect channel with a second channel to produce a <italic>generalized erasure channel</italic> pair <inline-formula> <tex-math notation="LaTeX">$({\mathcal B}_{g}, {\mathcal C}_{g})$ </tex-math></inline… 

Figures from this paper

Log-singularities for studying capacities of quantum channels.
TLDR
A small linear increase from zero in some eigenvalue of a density operator makes the derivative of its von-Neumann entropy logarithmic, a $\log$-singularity, and methods for checking non-additivity and positivity of the coherent information of a noisy quantum channel are developed.
Capacity of trace decreasing quantum operations and superadditivity of coherent information for a generalized erasure channel
  • S. Filippov
  • Physics
    Journal of Physics A: Mathematical and Theoretical
  • 2021
Losses in quantum communication lines severely affect the rates of reliable information transmission and are usually considered to be state-independent. However, the loss probability does depend on
The platypus of the quantum channel zoo
TLDR
It is shown that the qutrit channel demonstrates superadditivity when transmitting quantum information jointly with a variety of assisting channels, in a manner unknown before.
Entropic singularities give rise to quantum transmission
TLDR
This work shows non-additivity in a simple low-noise channel and proves a general theorem concerning positivity of a channel’s coherent information, and shows a wide class of zero quantum capacity qubit channels can assist an incomplete erasure channel in sending quantum information.
Bounding quantum capacities via partial orders and complementarity
TLDR
This work gives operationally motivated bounds on several capacities, including the quantum capacity and private capacity of a quantum channel and the one-way distillable entanglement and private key of a Quantum state, in terms of capacity quantities involving the complementary channel or state.
Multiletter codes to boost superadditivity of coherent information in quantum communication lines with polarization dependent losses
TLDR
This work shows that in the asymptotic limit of the infinite code length the superadditivity phenomenon takes place whenever the communication channel is neither degradable nor antidegradable, and provides a method how to modify the proposed codes and get a higher quantum communication rate by doubling the code length.
Quantum capacity and codes for the bosonic loss-dephasing channel
Bosonic qubits encoded in continuous-variable systems provide a promising alternative to two-level qubits for quantum computation and communication. So far, photon loss has been the dominant source
Leaking information to gain entanglement.
Entanglement lies at the root of quantum theory. It is a remarkable resource that is generally believed to diminish when entangled systems interact with their environment. On the contrary, we find
Bounding the quantum capacity with flagged extensions
In this article we consider flagged extensions of convex combination of quantum channels, and find general sufficient conditions for the degradability of the flagged extension. An immediate

References

SHOWING 1-10 OF 40 REFERENCES
Information-theoretic aspects of the generalized amplitude-damping channel
TLDR
The generalized amplitude damping channel is viewed as the qubit analogue of the bosonic thermal channel, and it thus can be used to model lossy processes in the presence of background noise for low-temperature systems.
Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
TLDR
This paper gives multiletter characterizations of two different two-dimensional capacity regions for an arbitrary quantum channels with two senders and one receiver, and states that the coherent information over any degradable channel is concave in the input density operator.
The structure of degradable quantum channels
TLDR
A comprehensive review of what is currently known about the structure of degradable quantum channels is given, including a number of new results as well as alternate proofs of some known results.
Dephrasure Channel and Superadditivity of Coherent Information.
TLDR
The dephrasure channel is considered, which is the concatenation of a dephasing channel and an erasure channel, which finds nonadditivity of coherent information at the two-letter level, a substantial gap between the threshold for zero quantum capacity and zero single-letter coherent information, and positive quantum capacity for all complementary channels.
Additive extensions of a quantum channel
TLDR
This work studies extensions of a quantum channel whose one-way capacities are described by a single-letter formula and demonstrates that the key rate of BB84 with one- way post-processing and quantum bit error rate q cannot exceed H(1/2-2q(1-q).
Entanglement Breaking Channels
This paper studies the class of stochastic maps, or channels, for which (I⊗Φ)(Γ) is always separable (even for entangled Γ). Such maps are called entanglement breaking, and can always be written in
QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS
TLDR
A family of additive quantum error-correcting codes whose capacities exceed those of quantum random coding (hashing) for very noisy channels are presented and a general relation between the capacity attainable by these concatenation schemes and the coherent information of the inner code states is derived.
Error Thresholds for Arbitrary Pauli Noise
TLDR
This work divides the simplex of Pauli channels into one-parameter families and compute numerical lower bounds on their error thresholds, and identifies a novel family of quantum codes based on tree graphs that outperform repetition and cat codes in large regions of the Pauli simplex.
Capacities of Quantum Erasure Channels
The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the
The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the
...
1
2
3
4
...