Exact solution for the quantum and private capacities of bosonic dephasing channels

• URL: http://arxiv.org/abs/2205.05736v2
• Date: Mon, 30 Oct 2023 13:20:37 GMT
• Title: Exact solution for the quantum and private capacities of bosonic dephasing channels
• Authors: Ludovico Lami, Mark M. Wilde
• Abstract summary: We provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key capacities of bosonic dephasing channels.
• Score: 10.787390511207686
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The capacities of noisy quantum channels capture the ultimate rates of information transmission across quantum communication lines, and the quantum capacity plays a key role in determining the overhead of fault-tolerant quantum computation platforms. In the case of bosonic systems, central to many applications, no closed formulas for these capacities were known for bosonic dephasing channels, a key class of non-Gaussian channels modelling, e.g., noise affecting superconducting circuits or fiber-optic communication channels. Here we provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key agreement capacities of all bosonic dephasing channels. We prove that that they are equal to the relative entropy of the distribution underlying the channel to the uniform distribution. Our result solves a problem that has been open for over a decade, having been posed originally by [Jiang & Chen, Quantum and Nonlinear Optics 244, 2010].

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• Information capacity analysis of fully correlated multi-level amplitude damping channels [0.9790236766474201]
  We investigate some of the information capacities of the simplest member of multi-level Amplitude Damping Channel, a qutrit channel. We find the upper bounds of the single-shot classical capacities and calculate the quantum capacities associated with a specific class of maps.
  arXiv  Detail & Related papers  (2023-05-08T06:10:56Z)
• Noise is resource-contextual in quantum communication [1.8749305679160366]
  Estimating the information transmission capability of a quantum channel remains one of the fundamental problems in quantum information processing. One of the most significant manifestations of this is the superadditivity of the channel capacity. Our constructions demonstrate that noise is context dependent in quantum communication.
  arXiv  Detail & Related papers  (2023-05-01T06:24:03Z)
• Maximum tolerable excess noise in CV-QKD and improved lower bound on two-way capacities [8.808993671472349]
  We find a new lower bound on the energy-constrained and unconstrained two-way quantum and secret-key capacities of all phase-insensitive bosonic Gaussian channels. Ours is the first nonzero lower bound on the two-way quantum capacity in the parameter range where the (reverse) coherent information becomes negative.
  arXiv  Detail & Related papers  (2023-03-22T19:00:05Z)
• Entanglement Distribution and Quantum Teleportation in Higher Dimension over the Superposition of Causal Orders of Quantum Channels [13.359442837017202]
  We develop and formulate the theoretical framework for transmission of classical information through entanglement distribution of qudits over two quantum channels. Results show that entanglement distribution of a qudit provides a considerable gain in fidelity even with increase in noise.
  arXiv  Detail & Related papers  (2023-03-19T15:06:24Z)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)

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.