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:1611.05411 · Nature Communications

Capacity estimation and verification of quantum channels with arbitrarily correlated errors

Corsin Pfister, Michiel Adriaan Rol, Atul Mantri, Marco Tomamichel, Stephanie Wehner

Published Dec 27, 2017• 28 citations
arXivHTMLPDF

Abstract

The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel's quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel's one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment.

DOI
10.1038/s41467-017-00961-2

Related papers

Detecting quantum capacities of continuous-variable quantum channels

Yadong Wu, Giulio Chiribella

Quantum communication channels and quantum memories are the fundamental building blocks of large-scale quantum communication networks. Estimating their capacity to transmit and store quantum information is crucial in order to assess the performance of quantum communication systems and to detect useful communication paths among the nodes of future quantum networks. However, the estimation of quantum capacities is a challenging task for continuous-variable systems, such as the radiation field, for which a complete characterization via quantum tomography is practically unfeasible. Here we introduce a method for detecting the quantum capacity of continuous-variable communication channels and memories without performing a full process tomography. Our method works in the general scenario where the devices are used a finite number of times, can exhibit correlations across multiple uses, and can change dynamically under the control of a malicious adversary. The method is experimentally friendly and can be implemented using only finitely squeezed states and homodyne measurements.

arXiv:2108.13348•Physical Review Research•Nov 30, 2022•2 citations

One-shot quantum capacities of quantum channels

Francesco Buscemi, Nilanjana Datta

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.

•Feb 2, 2009•3 citations

Small perturbations of coherent information

Zhen Wu, Zhihao Ma, James Fullwood

Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error. Mathematically, the quantum capacity is given by an asymptotic formula involving the one-shot quantum capacity of the associated channel, which, due to purely quantum effects such as superadditivity of one-shot quantum capacity, is rarely computable. The one-shot quantum capacity is mathematically characterized in terms of optimizing an entropic quantity referred to as coherent information over all possible input states of a channel, the computation of which also tends to be intractable due to the difficulty of optimizing the coherent information. In this work, we develop perturbative methods for analyzing the behavior of coherent information of a quantum channel with respect to small perturbations of the input state. By doing so, we are able to derive three general criteria for determining whether an input state yields suboptimal coherent information. We then show how our criteria yield sufficient conditions for superadditivity of one-shot quantum capacity, and also for detecting a positive gap between one-shot private capacity and one-shot quantum capacity. The utility of our criteria is illustrated through examples, which yield new results regarding the one-shot quantum capacity of qubit depolarizing channels, Pauli channels and dephrasure channels.

arXiv:2507.16920•Physical Review A•Jan 7, 2026•3 citations

The Quantum Capacity of Channels With Arbitrarily Correlated Noise

Francesco Buscemi, Nilanjana Datta

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as theone-shotquantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.

arXiv:0902.0158•IEEE Transactions on Information Theory•Mar 1, 2010•192 citations

End-to-end capacities of a quantum communication network

Stefano Pirandola

Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.

arXiv:1905.12674•Communications Physics•May 17, 2019•370 citations

One-Shot Entanglement-Assisted Quantum and Classical Communication

Nilanjana Datta, Min-Hsiu Hsieh

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.

arXiv:1105.3321•IEEE Transactions on Information Theory•Nov 21, 2012•55 citations
The central figure of merit for quantum memories and quantum communication devices is their capacity to store and transmit quantum information. Here, we present a protocol that estimates a lower bound on a channel's quantum capacity, even when there are arbitrarily correlated errors. One application of these protocols is to test the performance of quantum repeaters for transmitting quantum information. Our protocol is easy to implement and comes in two versions. The first estimates the one-shot quantum capacity by preparing and measuring in two different bases, where all involved qubits are used as test qubits. The second verifies on-the-fly that a channel's one-shot quantum capacity exceeds a minimal tolerated value while storing or communicating data. We discuss the performance using simple examples, such as the dephasing channel for which our method is asymptotically optimal. Finally, we apply our method to a superconducting qubit in experiment.
Quantum communication channels and quantum memories are the fundamental building blocks of large-scale quantum communication networks. Estimating their capacity to transmit and store quantum information is crucial in order to assess the performance of quantum communication systems and to detect useful communication paths among the nodes of future quantum networks. However, the estimation of quantum capacities is a challenging task for continuous-variable systems, such as the radiation field, for which a complete characterization via quantum tomography is practically unfeasible. Here we introduce a method for detecting the quantum capacity of continuous-variable communication channels and memories without performing a full process tomography. Our method works in the general scenario where the devices are used a finite number of times, can exhibit correlations across multiple uses, and can change dynamically under the control of a malicious adversary. The method is experimentally friendly and can be implemented using only finitely squeezed states and homodyne measurements.
We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.
Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error. Mathematically, the quantum capacity is given by an asymptotic formula involving the one-shot quantum capacity of the associated channel, which, due to purely quantum effects such as superadditivity of one-shot quantum capacity, is rarely computable. The one-shot quantum capacity is mathematically characterized in terms of optimizing an entropic quantity referred to as coherent information over all possible input states of a channel, the computation of which also tends to be intractable due to the difficulty of optimizing the coherent information. In this work, we develop perturbative methods for analyzing the behavior of coherent information of a quantum channel with respect to small perturbations of the input state. By doing so, we are able to derive three general criteria for determining whether an input state yields suboptimal coherent information. We then show how our criteria yield sufficient conditions for superadditivity of one-shot quantum capacity, and also for detecting a positive gap between one-shot private capacity and one-shot quantum capacity. The utility of our criteria is illustrated through examples, which yield new results regarding the one-shot quantum capacity of qubit depolarizing channels, Pauli channels and dephrasure channels.
We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as theone-shotquantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.
Abstract In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications.
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.