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:2510.01424

Optimal Quantum Information Transmission Under a Continuous-Variable Erasure Channel

Taylor, Adam, Michael Hanks, Hyukjoon Kwon, M. S. Kim

Published Oct 1, 2025• 0 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2510.01424

Related papers

Information transmission with continuous variable quantum erasure channels

Changchun Zhong, Changhun Oh, Liang Jiang

Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then 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 a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.

arXiv:2205.09711•Quantum•Mar 6, 2023•5 citations

Efficient capacity-achieving entanglement generation with application to pure-loss Bosonic channels

Avijit Mandal, Christophe Piveteau, Henry D. Pfister +1 more

While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficiently achieve the classical capacity of any noisy channel. In this work we construct an efficient entanglement generation scheme which achieves the coherent information for a broad class of channels. For degradable channels in the class, which includes truncated versions of the pure loss Bosonic channel, the resulting scheme achieves the quantum capacity. The construction makes use of polar codes for two kinds of classical-input, quantum-output (CQ) channels: those with commuting outputs and those whose outputs are heralded mixtures of pure states. The former case is amenable to decoding by classical polar decoding algorithms, the latter by the belief propagation with quantum messages (BPQM) algorithm. To our knowledge, this construction is the first explicit and efficiently decodable protocol that achieves the energy-constrained quantum capacity of the pure-loss Bosonic channel.

quant-pharXiv:2610.03674•Oct 5, 2026•0 citations

Multiplexed CV quantum teleportation for high rates in quantum communication

Andreas Christ, Cosmo Lupo, Christine Silberhorn

A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols which encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode vs. multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, significantly increasing the achievable quantum communication rates in comparison to single- mode coding, but also yields an improved loss resilience. However as quantum information transfer is only achieved for entanglement values above a certain threshold a careful optimization of the number of coding modes is needed to obtain the optimal quantum channel capacity.

•Jan 20, 2012•0 citations

Exponentially enhanced quantum communication rate by multiplexing continuous-variable teleportation

Andreas Christ, Cosmo Lupo, Christine Silberhorn

A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols that encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode versus multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, leading to an exponential increase in the achievable quantum communication rates in comparison to single-mode coding, but also yields an improved loss resilience. However, as reliable quantum information transfer is only achieved for entanglement values above a certain threshold a careful optimization of the number of coding modes is needed to obtain the optimal quantum channel capacity.

arXiv:1201.4359•New Journal of Physics•Aug 7, 2012•21 citations

Convex combinations of bosonic pure-loss channels

Giuseppe Catalano, Marco Fanizza, Francesco Anna Mele +2 more

The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.

quant-pharXiv:2604.26874•Apr 30, 2026•2 citations

Transmitting Quantum Information Reliably across Various Quantum Channels

Yingkai Ouyang

Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send the encoded quantum information across the noisy quantum channel, then recover the message qudits by decoding. In this dissertation, we discuss the coding problem from several perspectives.} \n \nThe noisy quantum channel is one of the central aspects of the quantum coding problem, and hence quantifying the noisy quantum channel from the physical model is an important problem. \nWe work with an explicit physical model -- a pair of initially decoupled quantum harmonic oscillators interacting with a spring-like coupling, where the bath oscillator is initially in a thermal-like state. In particular, we treat the completely positive and trace preserving map on the system as a quantum channel, and study the truncation of the channel by truncating its Kraus set. We thereby derive the matrix elements of the Choi-Jamiolkowski operator of the corresponding truncated channel, which are truncated transition amplitudes. Finally, we give a computable approximation for these truncated transition amplitudes with explicit error bounds, and perform a case study of the oscillators in the off-resonant and weakly-coupled regime numerically. \n \nIn the context of truncated noisy channels, we revisit the notion of approximate error correction of finite dimension codes. We derive a computationally simple lower bound on the worst case entanglement fidelity of a quantum code, when the truncated recovery map of Leung et. al. is rescaled. As an application, we apply our bound to construct a family of multi-error correcting amplitude damping codes that are permutation-invariant. This demonstrates an explicit example where the specific structure of the noisy channel allows code design out of the stabilizer formalism via purely algebraic means. \n \nWe study lower bounds on the quantum capacity of adversarial channels, where we restrict the selection of quantum codes to the set of concatenated quantum codes. \nThe adversarial channel is a quantum channel where an adversary corrupts a fixed fraction of qudits sent across a quantum channel in the most malicious way possible. The best known rates of communicating over adversarial channels are given by the quantum Gilbert-Varshamov (GV) bound, that is known to be attainable with random quantum codes. We generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region. \n \nWe next study upper bounds on the quantum capacity of some low dimension quantum channels. \nThe quantum capacity of a quantum channel is the maximum rate at which quantum information can be transmitted reliably across it, given arbitrarily many uses of it. While it is known that random quantum codes can be used to attain the quantum capacity, the quantum capacity of many classes of channels is undetermined, even for channels of low input and output dimension. For example, depolarizing channels are \n important quantum channels, but do not have tight numerical bounds. \nWe obtain upper bounds on the quantum capacity of some unital and non-unital channels \n -- two-qubit Pauli channels, two-qubit depolarizing channels, two-qubit locally symmetric channels, \n shifted qubit depolarizing channels, and shifted two-qubit Pauli channels -- \n using the coherent information of some degradable channels. We use the notion \n of twirling quantum channels, and Smith and Smolin's method of constructing \n degradable extensions of quantum channels extensively. The degradable channels we \n introduce, study and use are two-qubit amplitude damping channels. Exploiting the \n notion of covariant quantum channels, we give sufficient conditions for the quantum \n capacity of a degradable channel to be the optimal value of a concave program with \n linear constraints, and show that our two-qubit degradable amplitude damping channels have this property.

•May 1, 2013•1 citation
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.
Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then 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 a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.
While the ultimate limits on the rate of quantum communication over noisy channels are well-established, very few efficient coding schemes achieving these limits are known. This contrasts sharply with transmitting classical data over classical channels, where polar codes and low-density parity-check codes both efficiently achieve the classical capacity of any noisy channel. In this work we construct an efficient entanglement generation scheme which achieves the coherent information for a broad class of channels. For degradable channels in the class, which includes truncated versions of the pure loss Bosonic channel, the resulting scheme achieves the quantum capacity. The construction makes use of polar codes for two kinds of classical-input, quantum-output (CQ) channels: those with commuting outputs and those whose outputs are heralded mixtures of pure states. The former case is amenable to decoding by classical polar decoding algorithms, the latter by the belief propagation with quantum messages (BPQM) algorithm. To our knowledge, this construction is the first explicit and efficiently decodable protocol that achieves the energy-constrained quantum capacity of the pure-loss Bosonic channel.
A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols which encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode vs. multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, significantly increasing the achievable quantum communication rates in comparison to single- mode coding, but also yields an improved loss resilience. However as quantum information transfer is only achieved for entanglement values above a certain threshold a careful optimization of the number of coding modes is needed to obtain the optimal quantum channel capacity.
A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols that encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode versus multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, leading to an exponential increase in the achievable quantum communication rates in comparison to single-mode coding, but also yields an improved loss resilience. However, as reliable quantum information transfer is only achieved for entanglement values above a certain threshold a careful optimization of the number of coding modes is needed to obtain the optimal quantum channel capacity.
The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.
Transmitting quantum information across quantum channels is an important task. However quantum information is delicate, and is easily corrupted. We address the task of protecting quantum information from an information theoretic perspective -- we encode some message qudits into a quantum code, send the encoded quantum information across the noisy quantum channel, then recover the message qudits by decoding. In this dissertation, we discuss the coding problem from several perspectives.} \n \nThe noisy quantum channel is one of the central aspects of the quantum coding problem, and hence quantifying the noisy quantum channel from the physical model is an important problem. \nWe work with an explicit physical model -- a pair of initially decoupled quantum harmonic oscillators interacting with a spring-like coupling, where the bath oscillator is initially in a thermal-like state. In particular, we treat the completely positive and trace preserving map on the system as a quantum channel, and study the truncation of the channel by truncating its Kraus set. We thereby derive the matrix elements of the Choi-Jamiolkowski operator of the corresponding truncated channel, which are truncated transition amplitudes. Finally, we give a computable approximation for these truncated transition amplitudes with explicit error bounds, and perform a case study of the oscillators in the off-resonant and weakly-coupled regime numerically. \n \nIn the context of truncated noisy channels, we revisit the notion of approximate error correction of finite dimension codes. We derive a computationally simple lower bound on the worst case entanglement fidelity of a quantum code, when the truncated recovery map of Leung et. al. is rescaled. As an application, we apply our bound to construct a family of multi-error correcting amplitude damping codes that are permutation-invariant. This demonstrates an explicit example where the specific structure of the noisy channel allows code design out of the stabilizer formalism via purely algebraic means. \n \nWe study lower bounds on the quantum capacity of adversarial channels, where we restrict the selection of quantum codes to the set of concatenated quantum codes. \nThe adversarial channel is a quantum channel where an adversary corrupts a fixed fraction of qudits sent across a quantum channel in the most malicious way possible. The best known rates of communicating over adversarial channels are given by the quantum Gilbert-Varshamov (GV) bound, that is known to be attainable with random quantum codes. We generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region. \n \nWe next study upper bounds on the quantum capacity of some low dimension quantum channels. \nThe quantum capacity of a quantum channel is the maximum rate at which quantum information can be transmitted reliably across it, given arbitrarily many uses of it. While it is known that random quantum codes can be used to attain the quantum capacity, the quantum capacity of many classes of channels is undetermined, even for channels of low input and output dimension. For example, depolarizing channels are \n important quantum channels, but do not have tight numerical bounds. \nWe obtain upper bounds on the quantum capacity of some unital and non-unital channels \n -- two-qubit Pauli channels, two-qubit depolarizing channels, two-qubit locally symmetric channels, \n shifted qubit depolarizing channels, and shifted two-qubit Pauli channels -- \n using the coherent information of some degradable channels. We use the notion \n of twirling quantum channels, and Smith and Smolin's method of constructing \n degradable extensions of quantum channels extensively. The degradable channels we \n introduce, study and use are two-qubit amplitude damping channels. Exploiting the \n notion of covariant quantum channels, we give sufficient conditions for the quantum \n capacity of a degradable channel to be the optimal value of a concave program with \n linear constraints, and show that our two-qubit degradable amplitude damping channels have this property.