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

Quantum communication: a discrimination approach

Hao-Chung Cheng

quant-phcs.ITmath-phSubmitted Oct 29, 2026• Announced Oct 30, 2026• 0 citations
arXivHTMLPDF

Abstract

We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel. Starting from the operational duality between entanglement recovery and state discrimination, we construct entanglement-generation codes with explicit decoders constructed from Petz recovery maps. The resulting error bounds hold for every number of channel uses and are expressed in terms of Petz-Rényi coherent information. For product sources, they yield exponential error decay at rates below coherent information.

AI Summary

The paper studies whether unassisted quantum communication can be analyzed directly through state discrimination, with explicit decoders rather than a decoder whose existence follows from decoupling. It starts from a known operational duality: the optimal squared purified-distance error for recovering a rank-$d$ maximally entangled state equals both the discrimination error of $d^2$ equiprobable Weyl-rotated output states and an optimized environmental decoupling error. Using random-subspace preparations and discrimination measurements, it constructs decoders corresponding to ordinary Petz and averaged rotated Petz recovery. For a source output $\rho_{RB}$, every integer $d\geq2$, and $\alpha\in[1/2,1)$, the construction gives an average entanglement-generation error bounded by $\bar\varepsilon(d)\leq c_\alpha 2^{-\frac{1-\alpha}{\alpha}[I_\alpha(R\rangle B)_\rho-\log_2d]}$, where $I_\alpha$ is Petz–Rényi coherent information and $c_\alpha\in[1/2,1]$. Stronger finite-dimensional bounds include subtractive corrections; a noiseless-channel example establishes sharpness of the prefactor. Product sources give exponential error decay below coherent information. A separate binary-hypothesis-testing bound is $\varepsilon(d)\leq\operatorname{Tr}[\rho_{RB}\wedge dI_R\otimes\rho_B]$, also obtained in concurrent independent work. The analysis combines the decoder–measurement correspondence, a sharp operator tilting inequality, operator concavity, and Haar second moments; exact unitary $2$-designs suffice. Standard conversions preserve the achievable exponent for entanglement and strong subspace transmission. The setting is finite dimensional, and random coding proves existence of a fixed code rather than an efficient implementation. The resulting exponent agrees with an earlier decoupling exponent when both use squared purified distance; the second-order consequence likewise reproduces an existing achievable rate.

No sign of AI-generated textIncremental

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Quantum State Discrimination with Bosonic Channels and Gaussian States

Si-Hui Tan

Discriminating between quantum states is an indispensable part of quantum information theory. This thesis investigates state discrimination of continuous quantum variables, focusing on bosonic communication channels and Gaussian states. The specific state discrimination problems studied are (a) quantum illumination and (b) optimal measurements for decoding bosonic channels. Quantum illumination is a technique for detection and imaging which uses entanglement between a probe and an ancilla to enhance sensitivity. I shall show how entanglement can help with the discrimination between two noisy and lossy bosonic channels, one in which a target reflects back a small part of the probe light, and the other in which all probe light is lost. This enhancement is obtained even though the channels are entanglement-breaking. The main result of this study is that, under optimum detection in the asymptotic limit of many detection trials, 6 dB of improvement in the error exponent can be achieved by using an entangled state as compared to a classical state. In the study of optimal measurements for decoding bosonic channels, I shall present an alternative measurement to the pretty-good measurement for attaining the classical capacity of the lossy bosonic channel given product coherent-state inputs. This new measurement has the feature that, at each step of the measurement, only projective measurements are needed. The measurement is a sequential one: the number of steps required is exponential in the code length, and the error rate of this measurement goes to zero in the limit of large code length. Although not physically practical in itself, this new measurement has a simple physical interpretation in terms of collective energy measurements, and may give rise to an implementation of an optimal measurement for lossy bosonic channels. The two problems studied in my thesis are examples of how state discrimination can be useful in solving problems by using quantum mechanical properties such as entanglement and entangling measurements.

•Jan 1, 2013•3 citations

Decoding quantum information via the Petz recovery map

Salman Beigi, Nilanjana Datta, Felix Leditzky

We obtain a lower bound on the maximum number of qubits, Qn, ε(N), which can be transmitted over n uses of a quantum channel N, for a given non-zero error threshold ε. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the Petz recovery map (also known as the transpose channel). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which Qn, ε(N) scales as n.

arXiv:1504.04449•Journal of Mathematical Physics•Aug 1, 2016•41 citations

A New Error Correction Intuitive Approach in Quantum Communications Protocols

Skander Aris, Merabtine Nadjim, Malek Benslama

Abstract: Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery operator independent definition of error-correcting codes. We relate this definition to four others: The existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.

American Journal of Applied Sciences•Aug 1, 2007•3 citations

One-shot entanglement generation and distillation via Petz recovery and binary hypothesis testing

Matthew Can, Mark M. Wilde

How much entanglement can two distant laboratories share when their connection is noisy? We relate this question to deciding which of two quantum hypotheses is present. Our one-shot bounds apply to entanglement generation over a quantum channel and to one-way entanglement distillation from a shared state. We use Cheng's trace inequality to bound the infidelity of a Petz decoder in terms of a binary hypothesis testing cost. Applying the inequality before averaging over codes reduces the error analysis to computing a second moment of random subspaces. The proof covers every integer target dimension and treats rank-deficient states explicitly. A corollary expresses the achievable entanglement through hypothesis-testing coherent information, with a single logarithmic error slack and exact integer rounding. We also prove an error-preserving conversion from entanglement generation codes to entanglement transmission codes: the target dimension decreases by only a constant factor at fixed error, and the decoder is the original decoder followed by local processing. Consequently, for both entanglement generation and entanglement transmission, arbitrary pure reference-input states yield the same coherent-information rate, second-order Gaussian correction at the original error tolerance, and explicit achievable logarithmic remainder. For commuting testing hypotheses, the logarithmic remainder improves to a constant. These results give a direct route from binary distinguishability to explicit recovery guarantees and finite-resource quantum communication rates.

quant-pharXiv:2610.31501•Oct 23, 2026•1 citation

Theory of quantum error-correcting codes

Emanuel H. Knill, Raymond Laflamme

Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.

Physical Review A•Feb 1, 1997•1,642 citations

Tight any-shot quantum decoupling

Mario Berta, Hao-Chung Cheng, Yongsheng Yao

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.

quant-pharXiv:2602.17430•Feb 20, 2026•13 citations
We develop a state discrimination approach to unassisted quantum communication through a noisy quantum channel. Starting from the operational duality between entanglement recovery and state discrimination, we construct entanglement-generation codes with explicit decoders constructed from Petz recovery maps. The resulting error bounds hold for every number of channel uses and are expressed in terms of Petz-Rényi coherent information. For product sources, they yield exponential error decay at rates below coherent information.
The paper studies whether unassisted quantum communication can be analyzed directly through state discrimination, with explicit decoders rather than a decoder whose existence follows from decoupling. It starts from a known operational duality: the optimal squared purified-distance error for recovering a rank-ddd maximally entangled state equals both the discrimination error of d2d^2d2 equiprobable Weyl-rotated output states and an optimized environmental decoupling error.
Using random-subspace preparations and discrimination measurements, it constructs decoders corresponding to ordinary Petz and averaged rotated Petz recovery. For a source output ρRB\rho_{RB}ρRB​, every integer d≥2d\geq2d≥2, and α∈[1/2,1)\alpha\in[1/2,1)α∈[1/2,1), the construction gives an average entanglement-generation error bounded by εˉ(d)≤cα2−1−αα[Iα(R⟩B)ρ−log⁡2d]\bar\varepsilon(d)\leq c_\alpha 2^{-\frac{1-\alpha}{\alpha}[I_\alpha(R\rangle B)_\rho-\log_2d]}εˉ(d)≤cα​2−α1−α​[Iα​(R⟩B)ρ​−log2​d], where IαI_\alphaIα​ is Petz–Rényi coherent information and cα∈[1/2,1]c_\alpha\in[1/2,1]cα​∈[1/2,1]. Stronger finite-dimensional bounds include subtractive corrections; a noiseless-channel example establishes sharpness of the prefactor. Product sources give exponential error decay below coherent information. A separate binary-hypothesis-testing bound is ε(d)≤Tr⁡[ρRB∧dIR⊗ρB]\varepsilon(d)\leq\operatorname{Tr}[\rho_{RB}\wedge dI_R\otimes\rho_B]ε(d)≤Tr[ρRB​∧dIR​⊗ρB​], also obtained in concurrent independent work.
The analysis combines the decoder–measurement correspondence, a sharp operator tilting inequality, operator concavity, and Haar second moments; exact unitary 222-designs suffice. Standard conversions preserve the achievable exponent for entanglement and strong subspace transmission. The setting is finite dimensional, and random coding proves existence of a fixed code rather than an efficient implementation. The resulting exponent agrees with an earlier decoupling exponent when both use squared purified distance; the second-order consequence likewise reproduces an existing achievable rate.
Discriminating between quantum states is an indispensable part of quantum information theory. This thesis investigates state discrimination of continuous quantum variables, focusing on bosonic communication channels and Gaussian states. The specific state discrimination problems studied are (a) quantum illumination and (b) optimal measurements for decoding bosonic channels. Quantum illumination is a technique for detection and imaging which uses entanglement between a probe and an ancilla to enhance sensitivity. I shall show how entanglement can help with the discrimination between two noisy and lossy bosonic channels, one in which a target reflects back a small part of the probe light, and the other in which all probe light is lost. This enhancement is obtained even though the channels are entanglement-breaking. The main result of this study is that, under optimum detection in the asymptotic limit of many detection trials, 6 dB of improvement in the error exponent can be achieved by using an entangled state as compared to a classical state. In the study of optimal measurements for decoding bosonic channels, I shall present an alternative measurement to the pretty-good measurement for attaining the classical capacity of the lossy bosonic channel given product coherent-state inputs. This new measurement has the feature that, at each step of the measurement, only projective measurements are needed. The measurement is a sequential one: the number of steps required is exponential in the code length, and the error rate of this measurement goes to zero in the limit of large code length. Although not physically practical in itself, this new measurement has a simple physical interpretation in terms of collective energy measurements, and may give rise to an implementation of an optimal measurement for lossy bosonic channels. The two problems studied in my thesis are examples of how state discrimination can be useful in solving problems by using quantum mechanical properties such as entanglement and entangling measurements.
We obtain a lower bound on the maximum number of qubits, Qn, ε(N), which can be transmitted over n uses of a quantum channel N, for a given non-zero error threshold ε. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the Petz recovery map (also known as the transpose channel). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which Qn, ε(N) scales as n.
Abstract: Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery operator independent definition of error-correcting codes. We relate this definition to four others: The existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.
How much entanglement can two distant laboratories share when their connection is noisy? We relate this question to deciding which of two quantum hypotheses is present. Our one-shot bounds apply to entanglement generation over a quantum channel and to one-way entanglement distillation from a shared state. We use Cheng's trace inequality to bound the infidelity of a Petz decoder in terms of a binary hypothesis testing cost. Applying the inequality before averaging over codes reduces the error analysis to computing a second moment of random subspaces. The proof covers every integer target dimension and treats rank-deficient states explicitly. A corollary expresses the achievable entanglement through hypothesis-testing coherent information, with a single logarithmic error slack and exact integer rounding. We also prove an error-preserving conversion from entanglement generation codes to entanglement transmission codes: the target dimension decreases by only a constant factor at fixed error, and the decoder is the original decoder followed by local processing. Consequently, for both entanglement generation and entanglement transmission, arbitrary pure reference-input states yield the same coherent-information rate, second-order Gaussian correction at the original error tolerance, and explicit achievable logarithmic remainder. For commuting testing hypotheses, the logarithmic remainder improves to a constant. These results give a direct route from binary distinguishability to explicit recovery guarantees and finite-resource quantum communication rates.
Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.