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

Physical Review A

Cost of exactly simulating a Bell pair using classical communication

János Csirik

Published Jul 11, 2002• 20 citations
Publisher

Abstract

The paper G. Brassard, R. Cleve, and A. Tapp, Phys. Rev. Lett. 83, 1874 (1999) begins thus: ``Bell's celebrated theorem shows that certain scenarios involving bipartite quantum measurements result in correlations that are impossible to simulate with a classical system if the measurement events are spacelike separated. If the measurement events are timelike separated, then classical simulation is possible, at the expense of some communication. Our goal is to quantify the required amount of communication.'' In this note we tighten the bounds on the amount of communication required to simulate a von Neumann measurement on a Bell pair.

DOI
10.1103/physreva.66.014302

Related papers

Classical simulation of quantum entanglement without local hidden variables

Serge Massar, Dave Bacon, Nicolas J. Cerf +1 more

Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of possibilities and the goal is to find a classical scheme that reproduces exactly the correlations that arise when an actual quantum system is measured. Previous results have shown that, using local hidden variables, a finite amount of communication suffices to simulate the correlations for a Bell state. We extend this in a number of ways. First, we show that, when the communication is merely required to be finite on average, Bell states can be simulated without any local hidden variables. More generally, we show that arbitrary positive operator valued measurements on systems of n Bell states can be simulated with ${O(n2}^{n})$ bits of communication on average (again, without local hidden variables). On the other hand, when the communication is required to be absolutely bounded, we show that a finite number of bits of local hidden variables is insufficient to simulate a Bell state. This latter result is based on an analysis of the nondeterministic communication complexity of the NOT-EQUAL function, which is constant in the quantum model and logarithmic in the classical model.

arXiv:quant-ph/0009088•Physical Review A•Apr 16, 2001•83 citations

Cost of Exactly Simulating Quantum Entanglement with Classical Communication

Gilles Brassard, Richard Cleve, Alain Tapp

We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behavior of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set of possibilities and the goal is to obtain exactly the same correlations that arise when the actual quantum system is measured. We show that, in the case of a single pair of qubits in a Bell state, a constant number of bits of communication is always sufficient---regardless of the number of measurements under consideration. We also show that, in the case of a system of $n$ Bell states, a constant times ${2}^{n}$ bits of communication is necessary.

arXiv:quant-ph/9901035•Physical Review Letters•Aug 30, 1999•255 citations

Communication Cost of Simulating Bell Correlations

Ben Toner, Dave Bacon

What classical resources are required to simulate quantum correlations? For the simplest and most important case of local projective measurements on an entangled Bell pair state, we show that exact simulation is possible using local hidden variables augmented by just one bit of classical communication. Certain quantum teleportation experiments, which teleport a single qubit, therefore admit a local hidden variables model.

arXiv:quant-ph/0304076•Physical Review Letters•Oct 31, 2003•345 citations

Approximate simulation of entanglement with a linear cost of communication

A. Montina

Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for $n$ Bell states, but it grows exponentially in $n$. Three simple protocols are presented that provide approximate simulations for low-dimensional entangled systems and require a linearly growing amount of communication. We have tested them by performing some simulations for a family of measurements. The maximal error is less than $1%$ in three dimensions and grows sublinearly with the number of entangled bits in the range numerically tested. One protocol is the multidimensional generalization of the exact Toner-Bacon [Phys. Rev. Lett. 91, 187904 (2003)] model for a single Bell state. The other two protocols are generalizations of an alternative exact model, which we derive from the Kochen-Specker [J. Math. Mech. 17, 59 (1967)] scheme for simulating single-qubit measurements. These protocols can give some indication for finding optimal one-way communication protocols that classically simulate entanglement and quantum channels. Furthermore they can be useful for deciding if a quantum communication protocol provides an advantage on classical protocols.

arXiv:1107.4647•Physical Review A•Oct 5, 2011•12 citations

Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution

Gilles Brassard, Luc Devroye, Claude Gravel

John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated with the help of bounded communication? This problem has been studied for more than two decades, and it is now well understood in the case of bipartite entanglement. However, the issue was still widely open for multipartite entanglement, even for the simplest case, which is the tripartite Greenberger- Horne-Zeilinger (GHZ) state. We give an exact simulation of arbitrary independent von Neumann measurements on general n-partite GHZ states. Our protocol requires O(n2) bits of expected communication between the parties, and O(n log n) expected time is sufficient to carry it out in parallel. Furthermore, we need only an expectation of O(n) independent unbiased random bits, with no need for the generation of continuous real random variables nor prior shared random variables. In the case of equatorial measurements, we improve on the prior art with a protocol that needs only O(n log n) bits of communication and O(log2n) parallel time. At the cost of a slight increase in the number of bits communicated, these tasks can be accomplished with a constant expected number of rounds.

arXiv:1303.5942•IEEE Transactions on Information Theory•Dec 1, 2015•10 citations

Strict Hierarchy of Bell Theorems

Gilles Brassard, André Allan Méthot

As proved by John Bell, quantum mechanics exhibits correlations in spacelike separated bipartite systems that are impossible to reproduce by classical means. There are three levels of "Bell theorems", depending on which aspects of the quantum correlations can or cannot be reproduced classically. The original "Bell inequalities" (Bl) require a perfect classical simulation of all quantum probabilities. With "Bell theorems without inequalities" (BTWI), we ask the classical simulation to be able to produce precisely the outputs that could occur according to quantum mechanics, but we do not worry about their exact probabilities. With "pseudo-telepathy" (PT), we are satisfied if the classical simulation produces only outputs allowed by quantum mechanics, but not necessarily all of them. Bell's original proof of Bl involved a maximally entangled 2times2 bipartite state such as the singlet state. Hardy proved that BTWI are possible in dimension 2times2, but his construction used a non-maximally entangled state. Here, we prove that no 2times2 maximally entangled state can serve to produce BTWI. Combining this with the fact that 2times2 entangled states cannot be used at all for the purpose of PT, it follows a strict hierarchy on the quantum resources that are required to exhibit the various levels of Bell theorems.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Feb 1, 2008•1 citation
The paper G. Brassard, R. Cleve, and A. Tapp, Phys. Rev. Lett. 83, 1874 (1999) begins thus: ``Bell's celebrated theorem shows that certain scenarios involving bipartite quantum measurements result in correlations that are impossible to simulate with a classical system if the measurement events are spacelike separated. If the measurement events are timelike separated, then classical simulation is possible, at the expense of some communication. Our goal is to quantify the required amount of communication.'' In this note we tighten the bounds on the amount of communication required to simulate a von Neumann measurement on a Bell pair.
Recent work has extended Bell's theorem by quantifying the amount of communication required to simulate entangled quantum systems with classical information. The general scenario is that a bipartite measurement is given from a set of possibilities and the goal is to find a classical scheme that reproduces exactly the correlations that arise when an actual quantum system is measured. Previous results have shown that, using local hidden variables, a finite amount of communication suffices to simulate the correlations for a Bell state. We extend this in a number of ways. First, we show that, when the communication is merely required to be finite on average, Bell states can be simulated without any local hidden variables. More generally, we show that arbitrary positive operator valued measurements on systems of n Bell states can be simulated with O(n2n){O(n2}^{n})O(n2n) bits of communication on average (again, without local hidden variables). On the other hand, when the communication is required to be absolutely bounded, we show that a finite number of bits of local hidden variables is insufficient to simulate a Bell state. This latter result is based on an analysis of the nondeterministic communication complexity of the NOT-EQUAL function, which is constant in the quantum model and logarithmic in the classical model.
We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behavior of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set of possibilities and the goal is to obtain exactly the same correlations that arise when the actual quantum system is measured. We show that, in the case of a single pair of qubits in a Bell state, a constant number of bits of communication is always sufficient---regardless of the number of measurements under consideration. We also show that, in the case of a system of nnn Bell states, a constant times 2n{2}^{n}2n bits of communication is necessary.
Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for nnn Bell states, but it grows exponentially in nnn. Three simple protocols are presented that provide approximate simulations for low-dimensional entangled systems and require a linearly growing amount of communication. We have tested them by performing some simulations for a family of measurements. The maximal error is less than 11%1 in three dimensions and grows sublinearly with the number of entangled bits in the range numerically tested. One protocol is the multidimensional generalization of the exact Toner-Bacon [Phys. Rev. Lett. 91, 187904 (2003)] model for a single Bell state. The other two protocols are generalizations of an alternative exact model, which we derive from the Kochen-Specker [J. Math. Mech. 17, 59 (1967)] scheme for simulating single-qubit measurements. These protocols can give some indication for finding optimal one-way communication protocols that classically simulate entanglement and quantum channels. Furthermore they can be useful for deciding if a quantum communication protocol provides an advantage on classical protocols.
John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated with the help of bounded communication? This problem has been studied for more than two decades, and it is now well understood in the case of bipartite entanglement. However, the issue was still widely open for multipartite entanglement, even for the simplest case, which is the tripartite Greenberger- Horne-Zeilinger (GHZ) state. We give an exact simulation of arbitrary independent von Neumann measurements on general n-partite GHZ states. Our protocol requires O(n2) bits of expected communication between the parties, and O(n log n) expected time is sufficient to carry it out in parallel. Furthermore, we need only an expectation of O(n) independent unbiased random bits, with no need for the generation of continuous real random variables nor prior shared random variables. In the case of equatorial measurements, we improve on the prior art with a protocol that needs only O(n log n) bits of communication and O(log2n) parallel time. At the cost of a slight increase in the number of bits communicated, these tasks can be accomplished with a constant expected number of rounds.
As proved by John Bell, quantum mechanics exhibits correlations in spacelike separated bipartite systems that are impossible to reproduce by classical means. There are three levels of "Bell theorems", depending on which aspects of the quantum correlations can or cannot be reproduced classically. The original "Bell inequalities" (Bl) require a perfect classical simulation of all quantum probabilities. With "Bell theorems without inequalities" (BTWI), we ask the classical simulation to be able to produce precisely the outputs that could occur according to quantum mechanics, but we do not worry about their exact probabilities. With "pseudo-telepathy" (PT), we are satisfied if the classical simulation produces only outputs allowed by quantum mechanics, but not necessarily all of them. Bell's original proof of Bl involved a maximally entangled 2times2 bipartite state such as the singlet state. Hardy proved that BTWI are possible in dimension 2times2, but his construction used a non-maximally entangled state. Here, we prove that no 2times2 maximally entangled state can serve to produce BTWI. Combining this with the fact that 2times2 entangled states cannot be used at all for the purpose of PT, it follows a strict hierarchy on the quantum resources that are required to exhibit the various levels of Bell theorems.