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:1309.2643 · SIAM Journal on Computing

Noisy Interactive Quantum Communication

Gilles Brassard, Ashwin Nayak, Alain Tapp, Dave Touchette, Falk Unger

Published Jan 1, 2019• 8 citations
arXivHTMLPDF

Abstract

We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for eventual real-world applications of interactive quantum protocols, which can be proved to have exponentially lower communication costs than their classical counterparts for some problems. These are the first results concerning the quantum version of this problem, originally studied by Schulman in a classical setting [L. J. Schulman, Communication on noisy channels: A coding theorem for computation, in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 1992, pp. 724--733], [L. J. Schulman, Deterministic coding for interactive communication, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, 1993, pp. 747--756]. We simulate a length $N$ quantum communication protocol by a length $O(N)$ protocol with arbitrarily small error. Under adversarial noise, our strategy can withstand, for arbitrarily small $\varepsilon>0$, error rates as high as $1/2-\varepsilon$ when parties preshare perfect entanglement, but the classical channel is noisy. We show that this is optimal. We provide extension of these results in several other models of communication, including when also the entanglement is noisy, and when there is no preshared entanglement but communication is quantum and noisy. We also study the case of random noise, for which we provide simulation protocols with positive communication rates and no preshared entanglement over some quantum channels with quantum capacity $C_Q=0$, proving that $C_Q$ is in general not the right characterization of a channel's capacity for interactive quantum communication. Our results are stated for a general quantum communication protocol in which Alice and Bob collaborate, and these results hold in particular in the quantum communication complexity settings of the Yao and Cleve--Buhrman models.

DOI
10.1137/16m109867x

Related papers

Noisy Interactive Quantum Communication

Gilles Brassard, Ashwin Nayak, Alain Tapp +2 more

We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and will be of importance for eventual real-world applications of interactive quantum protocols, which can be proved to have exponentially lower communication costs than their classical counterparts for some problems. These are the first results concerning the quantum version of this problem, originally studied by Schulman in a classical setting (FOCS '92, STOC '93). We simulate a length N quantum communication protocol by a length O(N) protocol with arbitrarily small error. Our simulation strategy has a far higher communication rate than a naive one that encodes separately each particular round of communication to achieve comparable success. Such a strategy would have a communication rate going to 0 in the worst interaction case as the length of the protocols increases, in contrast to our strategy, which has a communication rate proportional to the capacity of the channel used. Under adversarial noise, our strategy can withstand, for arbitrarily small ε > 0, error rates as high as 1/2 -- ε when parties preshare perfect entanglement, but the classical channel is noisy. We show that this is optimal. Note that in this model, the naive strategy would not work for any constant fraction of errors. We provide extension of these results in several other models of communication, including when also the entanglement is noisy, and when there is no pre-shared entanglement but communication is quantum and noisy. We also study the case of random noise, for which we provide simulation protocols with positive communication rates and no pre-shared entanglement over some quantum channels with quantum capacity Q = 0, proving that Q is in general not the right characterization of a channel's capacity for interactive quantum communication. Our results are stated for a general quantum communication protocol in which Alice and Bob collaborate, and hold in particular in the quantum communication complexity settings of the Yao and Cleve-Buhrman models.

Annual Symposium on Foundations of Computer Science•Oct 1, 2014•15 citations

Entanglement cost of quantum channels

Mario Berta, Matthias Christandl, Fernando G. S. L. Brandão +1 more

A natural question in characterizing the information theoretic power of quantum channels is to ask at what rate entanglement is needed in order to asymptotically simulate a quantum channel in the presence of free classical communication. We call this the entanglement cost of a channel, and prove a formula describing it for all channels. We discuss two applications. Firstly, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only greatly improves the range of parameters where security could be shown previously, but allows us to prove security for storage devices for which no non-trivial statements were known before. Secondly, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•17 citations

Quantum communication via noisy channels

Z. Shadman

Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding. In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.

•Jan 1, 2011•0 citations

Non-local games and communication complexity with noisy entanglement

Srijita Kundu, Olivier Lalonde

We study the impact of noise on the theories of quantum nonlocality and entanglement-assisted communication complexity. We consider non-local games and entanglement-assisted communication complexity in a model where Alice and Bob may share arbitrarily many noisy EPR pairs. We study four noise models: depolarizing noise, unital noise, biased reset noise, and erasure noise. Our results are as follows: 1. We upper bound the value of the CHSH game under all these noise models in terms of the noise parameter, without any assumptions on the measurements used in the strategy. 2. We prove a parallel repetition theorem for general non-local games under all noise models except biased reset noise; we prove an improved parallel repetition theorem for unique games. Our parallel repetition rate is smaller than the quantum parallel repetition rate for CHSH in a nontrivial noise regime. 3. Using our unique-game parallel repetition theorem and a relation defined by the CHSH game, we prove a separation between communication complexity with noisy vs noiseless entanglement. This implies an $Ω(n)$ two-way communication lower bound for distilling $n$ EPR pairs from noisy EPR pairs, in the same nontrivial noise regime. 4. We show that any interactive entanglement-assisted communication protocol can be simulated by an SMP communication protocol with noisy shared randomness, with an exponential blowup in communication. This generalizes a known result on the simulation of noiseless shared randomness with noisy shared randomness. 5. We show a polynomial lower bound on the number of copies of noisy EPR pairs required to compute the Equality function with constant communication, under all four noise models. The previous result gives a matching upper bound, and moreover, this answers an open question in the literature on whether logarithmically many noisy shared bits suffice for communication.

quant-pharXiv:2609.05122•Sep 7, 2026•2 citations

Capacity approaching coding for low noise interactive quantum communication

Debbie Leung, Ashwin Nayak, Ala Shayeghi +3 more

We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for noiseless qudit channels (where d is arbitrary), our main result is a simulation method that fails with probability less than 2−Θ (nє) and uses a qudit channel n (1 + Θ (√є)) times, of which an є fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the √є term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Perhaps surprisingly, this outperforms the best known overhead of 1 + O(√є loglog1/є) in the corresponding classical model, which is also conjectured to be optimal [Haeupler, FOCS’14]. Our work also improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., FOCS’14] for low є.

ACM Symposium on Theory of Computing (STOC)•Jun 20, 2018•4 citations

Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets

Debbie Leung, Ashwin Nayak, Ala Shayeghi +3 more

We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for a noiseless qudit channel over a poly (n ) size alphabet, our main result is a simulation method that fails with probability less than 2-Θ(nϵ)and uses a qudit channel over the same alphabet n(1 + Θ(√{ϵ} )) times, of which an ϵ fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the √{ϵ} term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Our work improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., SICOMP'19] for low ϵ.

arXiv:2001.02818•IEEE Transactions on Information Theory•Jun 8, 2021•2 citations
We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for eventual real-world applications of interactive quantum protocols, which can be proved to have exponentially lower communication costs than their classical counterparts for some problems. These are the first results concerning the quantum version of this problem, originally studied by Schulman in a classical setting [L. J. Schulman, Communication on noisy channels: A coding theorem for computation, in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE, 1992, pp. 724--733], [L. J. Schulman, Deterministic coding for interactive communication, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM, 1993, pp. 747--756]. We simulate a length NNN quantum communication protocol by a length O(N)O(N)O(N) protocol with arbitrarily small error. Under adversarial noise, our strategy can withstand, for arbitrarily small ε>0\varepsilon>0ε>0, error rates as high as 1/2−ε1/2-\varepsilon1/2−ε when parties preshare perfect entanglement, but the classical channel is noisy. We show that this is optimal. We provide extension of these results in several other models of communication, including when also the entanglement is noisy, and when there is no preshared entanglement but communication is quantum and noisy. We also study the case of random noise, for which we provide simulation protocols with positive communication rates and no preshared entanglement over some quantum channels with quantum capacity CQ=0C_Q=0CQ​=0, proving that CQC_QCQ​ is in general not the right characterization of a channel's capacity for interactive quantum communication. Our results are stated for a general quantum communication protocol in which Alice and Bob collaborate, and these results hold in particular in the quantum communication complexity settings of the Yao and Cleve--Buhrman models.
We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and will be of importance for eventual real-world applications of interactive quantum protocols, which can be proved to have exponentially lower communication costs than their classical counterparts for some problems. These are the first results concerning the quantum version of this problem, originally studied by Schulman in a classical setting (FOCS '92, STOC '93). We simulate a length N quantum communication protocol by a length O(N) protocol with arbitrarily small error. Our simulation strategy has a far higher communication rate than a naive one that encodes separately each particular round of communication to achieve comparable success. Such a strategy would have a communication rate going to 0 in the worst interaction case as the length of the protocols increases, in contrast to our strategy, which has a communication rate proportional to the capacity of the channel used. Under adversarial noise, our strategy can withstand, for arbitrarily small ε > 0, error rates as high as 1/2 -- ε when parties preshare perfect entanglement, but the classical channel is noisy. We show that this is optimal. Note that in this model, the naive strategy would not work for any constant fraction of errors. We provide extension of these results in several other models of communication, including when also the entanglement is noisy, and when there is no pre-shared entanglement but communication is quantum and noisy. We also study the case of random noise, for which we provide simulation protocols with positive communication rates and no pre-shared entanglement over some quantum channels with quantum capacity Q = 0, proving that Q is in general not the right characterization of a channel's capacity for interactive quantum communication. Our results are stated for a general quantum communication protocol in which Alice and Bob collaborate, and hold in particular in the quantum communication complexity settings of the Yao and Cleve-Buhrman models.
A natural question in characterizing the information theoretic power of quantum channels is to ask at what rate entanglement is needed in order to asymptotically simulate a quantum channel in the presence of free classical communication. We call this the entanglement cost of a channel, and prove a formula describing it for all channels. We discuss two applications. Firstly, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only greatly improves the range of parameters where security could be shown previously, but allows us to prove security for storage devices for which no non-trivial statements were known before. Secondly, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.
Quantum communication is at the heart of the quantum information theory. We study two types of quantum communication protocols over noisy transmission channels, i.e. super dense coding and cryptography protocols. In the first part of this thesis, for various scenarios, it is discussed how the super dense coding capacity is influenced by noisy quantum channels. The case of memoryless channels as well as those channels with memory which are modelled by uncorrelated and correlated noise, respectively, are considered. Explicitly Pauli channels over arbitrary dimensions are treated and the super dense coding capacity for some resource states is derived. For the qubit depolarizing channel, when noise is uncorrelated, the super dense coding capacity with respect to the input state is also optimized. This illustrates a threshold value of the noise parameter below which the super dense coding capacity is optimized by a maximally entangled initial state, while above the threshold value the super dense coding capacity is optimized by a product state. For Pauli channels, with correlated noise, the case of non unitary encoding is studied and the super dense coding capacity is derived. The first part of this thesis is concluded with an example for multipartite super dense coding. In the second part of the thesis, the problem of optimal eavesdropping on noisy states in quantum key distribution is investigated. The case of the six state protocol, when the signal states are mixed with white noise, is considered. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or, in a realistic scenario when the eavesdropper (referred to as Eve) is not assumed to replace the noisy quantum channel by a noiseless one. For individual attacks, we find Eve's optimal mutual information with Alice as a function of the quantum bit error rate. Finally, the results illustrate that adding noise on the quantum level can make quantum key distribution more robust against eavesdropping.
We study the impact of noise on the theories of quantum nonlocality and entanglement-assisted communication complexity. We consider non-local games and entanglement-assisted communication complexity in a model where Alice and Bob may share arbitrarily many noisy EPR pairs. We study four noise models: depolarizing noise, unital noise, biased reset noise, and erasure noise. Our results are as follows: 1. We upper bound the value of the CHSH game under all these noise models in terms of the noise parameter, without any assumptions on the measurements used in the strategy. 2. We prove a parallel repetition theorem for general non-local games under all noise models except biased reset noise; we prove an improved parallel repetition theorem for unique games. Our parallel repetition rate is smaller than the quantum parallel repetition rate for CHSH in a nontrivial noise regime. 3. Using our unique-game parallel repetition theorem and a relation defined by the CHSH game, we prove a separation between communication complexity with noisy vs noiseless entanglement. This implies an Ω(n)Ω(n)Ω(n) two-way communication lower bound for distilling nnn EPR pairs from noisy EPR pairs, in the same nontrivial noise regime. 4. We show that any interactive entanglement-assisted communication protocol can be simulated by an SMP communication protocol with noisy shared randomness, with an exponential blowup in communication. This generalizes a known result on the simulation of noiseless shared randomness with noisy shared randomness. 5. We show a polynomial lower bound on the number of copies of noisy EPR pairs required to compute the Equality function with constant communication, under all four noise models. The previous result gives a matching upper bound, and moreover, this answers an open question in the literature on whether logarithmically many noisy shared bits suffice for communication.
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for noiseless qudit channels (where d is arbitrary), our main result is a simulation method that fails with probability less than 2−Θ (nє) and uses a qudit channel n (1 + Θ (√є)) times, of which an є fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the √є term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Perhaps surprisingly, this outperforms the best known overhead of 1 + O(√є loglog1/є) in the corresponding classical model, which is also conjectured to be optimal [Haeupler, FOCS’14]. Our work also improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., FOCS’14] for low є.
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n messages, designed for a noiseless qudit channel over a poly (n ) size alphabet, our main result is a simulation method that fails with probability less than 2-Θ(nϵ)and uses a qudit channel over the same alphabet n(1 + Θ(√{ϵ} )) times, of which an ϵ fraction can be corrupted adversarially. The simulation is thus capacity achieving to leading order, and we conjecture that it is optimal up to a constant factor in the √{ϵ} term. Furthermore, the simulation is in a model that does not require pre-shared resources such as randomness or entanglement between the communicating parties. Our work improves over the best previously known quantum result where the overhead is a non-explicit large constant [Brassard et al., SICOMP'19] for low ϵ.