Capacity of trace decreasing quantum operations and superadditivity of coherent information for a generalized erasure channel

• URL: http://arxiv.org/abs/2101.05686v3
• Date: Sat, 29 May 2021 16:50:03 GMT
• Title: Capacity of trace decreasing quantum operations and superadditivity of coherent information for a generalized erasure channel
• Authors: Sergey N. Filippov
• Abstract summary: We analyze biased trace decreasing quantum operations that assign different loss probabilities to states. We find lower and upper bounds for the classical and quantum capacities of the generalized erasure channel. We reveal superadditivity of coherent information in the case of the polarization dependent losses.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 system state in general, with the polarization dependent losses being a prominent example. Here we analyze biased trace decreasing quantum operations that assign different loss probabilities to states and introduce the concept of a generalized erasure channel. We find lower and upper bounds for the classical and quantum capacities of the generalized erasure channel as well as characterize its degradability and antidegradability. We reveal superadditivity of coherent information in the case of the polarization dependent losses, with the difference between the two-letter quantum capacity and the single-letter quantum capacity exceeding $7.197 \cdot 10^{-3}$ bit per qubit sent, the greatest value among qubit-input channels reported so far.

Related papers

• Additivity of quantum capacities in simple non-degradable quantum channels [3.9901365062418312]
  Examples of additivity, while rare, provide key insight into the origins of nonadditivity. Degradable channels, which have additive coherent information, are some of the only channels for which we can calculate the quantum capacity. We construct non-degradable quantum channels that nevertheless have additive coherent information and therefore easily calculated quantum capacity.
  arXiv  Detail & Related papers  (2024-09-05T22:17:29Z)
• Quantum information scrambling in adiabatically-driven critical systems [49.1574468325115]
  Quantum information scrambling refers to the spread of the initially stored information over many degrees of freedom of a quantum many-body system. We extend the notion of quantum information scrambling to critical quantum many-body systems undergoing an adiabatic evolution.
  arXiv  Detail & Related papers  (2024-08-05T18:00:05Z)
• Quantum channel correction outperforming direct transmission [0.0]
  Long-distance optical quantum channels are necessarily lossy. Quantum states carrying information in the channel can be probabilistically amplified to compensate for loss, but are destroyed when amplification fails. We perform distillation by heralded amplification to improve a noisy entanglement channel. We employ entanglement swapping to demonstrate that arbitrary quantum information transmission is unconditionally improved.
  arXiv  Detail & Related papers  (2024-06-07T06:09:26Z)
• Quantum communication on the bosonic loss-dephasing channel [7.824710236769593]
  A crucial problem lies in determining the values of loss and dephasing for which the resulting loss-dephasing channel is anti-degradable. We prove that for any value of the loss, if the dephasing is above a critical value, then the bosonic loss-dephasing channel is anti-degradable.
  arXiv  Detail & Related papers  (2024-01-28T11:50:33Z)
• The superadditivity effects of quantum capacity decrease with the dimension for qudit depolarizing channels [0.0]
  We study how the gain in quantum capacity of qudit depolarizing channels relates to the dimension of the systems considered. We conclude that when high dimensional qudits experiencing depolarizing noise are considered, the coherent information of the channel is not only an achievable rate but essentially the maximum possible rate for any quantum block code.
  arXiv  Detail & Related papers  (2023-01-24T16:54:09Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Multipartite entanglement to boost superadditivity of coherent information in quantum communication lines with polarization dependent losses [0.0]
  We show that in the limit of the infinite number of channel uses the superadditivity phenomenon takes place whenever the channel is neither degradable nor antidegradable. We also provide a method how to modify the proposed states and get a higher quantum communication rate by doubling the number of channel uses.
  arXiv  Detail & Related papers  (2021-09-08T12:24:44Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.