Optimal Quantum Information Transmission Under a Continuous-Variable Erasure Channel

• URL: http://arxiv.org/abs/2510.01424v1
• Date: Wed, 01 Oct 2025 20:02:14 GMT
• Title: Optimal Quantum Information Transmission Under a Continuous-Variable Erasure Channel
• Authors: Adam Taylor, Michael Hanks, Hyukjoon Kwon, M. S. Kim,
• Abstract summary: We derive the quantum capacity and entanglement-assisted quantum capacity of the bosonic continuous-variable erasure channel.<n>We then construct random codes based on scrambling information within the typical subspace of the encoding state.<n>We find that information recovery depends on the ratio between the input and output modes.
• Score: 3.2648790955977915
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the optimal information transmission rate, is in general challenging. In this work, we derive the quantum capacity and entanglement-assisted quantum capacity of the bosonic continuous-variable erasure channel when subject to energy constraints. We then construct random codes based on scrambling information within the typical subspace of the encoding state and prove that these codes are asymptotically optimal up to a constant gap. Finally, using our random coding scheme we design a bosonic variation of the Hayden-Preskill protocol and find that information recovery depends on the ratio between the input and output modes. This is in contrast with the conventional discrete-variable scenario which requires only a fixed number of additional output qudits.

Related papers

• Passive Environment-Assisted Quantum Communication [0.6280405723042665]
  We examine how passive environment-assisted quantum communication enhances direct quantum information transfer efficiency.<n>A bosonic pure-loss channel, modeled as transmission through a beam splitter with a vacuum input state at the dark port, has zero quantum capacity when transmissivity is below 50%.<n>We explore more experimentally accessible non-Gaussian ancilla states, such as Fock, cat, and squeezed cat states, and numerically determine the optimal encoding and decoding strategies.
  arXiv  Detail & Related papers  (2026-02-25T04:14:47Z)
• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Improving quantum communication rates with permutation-invariant codes [6.107978190324034]
  We improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes.<n>For each channel family we obtain improved lower bounds on their quantum capacities.
  arXiv  Detail & Related papers  (2025-08-13T17:47:51Z)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Quantum-optimal information encoding using noisy passive linear optics [0.2010294990327175]
  We consider a practically-motivated family of optical quantum channels that can be implemented without an external energy source. We optimize the Holevo information over procedures that encode information in attenuations and phase-shifts applied by these channels on a resource state of finite energy. Our results are directly applicable to the quantum reading of an optical memory in the presence of environmental thermal noise.
  arXiv  Detail & Related papers  (2023-04-24T18:01:46Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Information transmission with continuous variable quantum erasure channels [2.8655318786364408]
  We identify a continuous variable quantum erasure channel in continuous variable settings. We derive the quantum capacity of the continuous variable erasure channel in the framework of decoupling theory. The discussion in this paper fills the gap of quantum erasure channel in continuous variable settings and sheds light on the understanding of other type of continuous variable quantum channels.
  arXiv  Detail & Related papers  (2022-05-19T17:24:48Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Detecting positive quantum capacities of quantum channels [9.054540533394926]
  A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate. This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel. We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
  arXiv  Detail & Related papers  (2021-05-13T14:26:45Z)
• 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 Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)

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.