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:2305.19935 · Quantum

Neural Network Approach to the Simulation of Entangled States with One Bit of Communication

Peter Sidajaya, Aloysius Dewen Lim, Baichu Yu, Valerio Scarani

Published Oct 24, 2023• 10 citations
arXivHTMLPDF

Abstract

Bell's theorem states that Local Hidden Variables (LHVs) cannot fully explain the statistics of measurements on some entangled quantum states. It is natural to ask how much supplementary classical communication would be needed to simulate them. We study two long-standing open questions in this field with neural network simulations and other tools. First, we present evidence that all projective measurements on partially entangled pure two-qubit states require only one bit of communication. We quantify the statistical distance between the exact quantum behaviour and the product of the trained network, or of a semianalytical model inspired by it. Second, while it is known on general grounds (and obvious) that one bit of communication cannot eventually reproduce all bipartite quantum correlation, explicit examples have proved evasive. Our search failed to find one for several bipartite Bell scenarios with up to 5 inputs and 4 outputs, highlighting the power of one bit of communication in reproducing quantum correlations.

DOI
10.22331/q-2023-10-24-1150

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

Beating one bit of communication with quantum correlations in smaller dimensions

Peter Sidajaya, Valerio Scarani

As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of nonclassicality. While it is obvious that this amount can be very large in general, it has been surprisingly difficult to find simple examples of quantum correlations, whose simulation requires more than one bit of communication. In this paper, we report the simplest example to date, which lives in the (5,2,5,5) Bell scenario [the previously known smallest case living in the (7,3,16,16) scenario]. The proof is built on the observation that finding the largest 1-bit score is equivalent to finding the bipartition of the inputs, in which the sum of the local scores of the two subgames is maximal.

arXiv:2402.02723•Physical Review A•Jun 6, 2024•1 citation

Beating one bit of communication with and without quantum pseudo-telepathy

István Márton, Erika Bene, Péter Diviánszky +1 more

Abstract According to Bell’s theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). Suppose that we can augment LHV by some amount of classical communication. The question then arises as to how many bits are needed to simulate entangled states? There is very strong evidence that a single bit of communication is powerful enough to simulate projective measurements on any two-qubit entangled state. However, the problem of simulating measurements on higher-dimensional systems remains largely unexplored. In this study, we present Bell-like scenarios, even with three inputs per party, in which bipartite correlations resulting from measurements on higher-dimensional states cannot be simulated with a single bit of communication. We consider the case where the communication direction is fixed and the case where it is bidirectional. To this end, we introduce constructions based on parallel repetition of pseudo-telepathy games and an original algorithm based on branch-and-bound technique to compute the one-bit classical bound. Two copies of emblematic Bell expressions, such as the Magic square pseudo-telepathy game, prove to be particularly powerful, requiring a 16 × 16 state to beat the bidirectional one-bit classical bound, and look a promising candidate for implementation on an optical platform.

arXiv:2308.10771•npj Quantum Information•Aug 22, 2024•4 citations

Neural Network Learning of One-Bit Protocols for Qubit Measurement Simulation

Josep Escrig, Mani Zartab, Giulio Gasbarri +3 more

Communication complexity provides a natural framework for quantifying the classical resources required to reproduce quantum statistics. In the qubit prepare-and-measure scenario, two classical bits have been shown to be necessary and sufficient to simulate arbitrary qubit states and arbi- trary quantum measurements exactly. However, this result does not exclude the possibility that restricted families of measurements may admit accurate 1-bit classical approximations. We use a neural network procedure to demonstrate that a single bit can achieve high average accuracy for specific measurement families. A performance analysis of our neural network reveals that symmet- ric measurements with uniformly weighted elements, such as those forming regular polyhedra, are particularly amenable to this restricted communication. By analyzing the patterns learned by the neural network, we derive an analytical protocol that is extremely accurate for finite information- ally complete symmetric configurations and becomes exact in the limit of a continuous isotropic measurement.

quant-pharXiv:2607.23645•Jul 28, 2026•0 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

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
Bell's theorem states that Local Hidden Variables (LHVs) cannot fully explain the statistics of measurements on some entangled quantum states. It is natural to ask how much supplementary classical communication would be needed to simulate them. We study two long-standing open questions in this field with neural network simulations and other tools. First, we present evidence that all projective measurements on partially entangled pure two-qubit states require only one bit of communication. We quantify the statistical distance between the exact quantum behaviour and the product of the trained network, or of a semianalytical model inspired by it. Second, while it is known on general grounds (and obvious) that one bit of communication cannot eventually reproduce all bipartite quantum correlation, explicit examples have proved evasive. Our search failed to find one for several bipartite Bell scenarios with up to 5 inputs and 4 outputs, highlighting the power of one bit of communication in reproducing quantum correlations.
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.
As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of nonclassicality. While it is obvious that this amount can be very large in general, it has been surprisingly difficult to find simple examples of quantum correlations, whose simulation requires more than one bit of communication. In this paper, we report the simplest example to date, which lives in the (5,2,5,5) Bell scenario [the previously known smallest case living in the (7,3,16,16) scenario]. The proof is built on the observation that finding the largest 1-bit score is equivalent to finding the bipartition of the inputs, in which the sum of the local scores of the two subgames is maximal.
Abstract According to Bell’s theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). Suppose that we can augment LHV by some amount of classical communication. The question then arises as to how many bits are needed to simulate entangled states? There is very strong evidence that a single bit of communication is powerful enough to simulate projective measurements on any two-qubit entangled state. However, the problem of simulating measurements on higher-dimensional systems remains largely unexplored. In this study, we present Bell-like scenarios, even with three inputs per party, in which bipartite correlations resulting from measurements on higher-dimensional states cannot be simulated with a single bit of communication. We consider the case where the communication direction is fixed and the case where it is bidirectional. To this end, we introduce constructions based on parallel repetition of pseudo-telepathy games and an original algorithm based on branch-and-bound technique to compute the one-bit classical bound. Two copies of emblematic Bell expressions, such as the Magic square pseudo-telepathy game, prove to be particularly powerful, requiring a 16 × 16 state to beat the bidirectional one-bit classical bound, and look a promising candidate for implementation on an optical platform.
Communication complexity provides a natural framework for quantifying the classical resources required to reproduce quantum statistics. In the qubit prepare-and-measure scenario, two classical bits have been shown to be necessary and sufficient to simulate arbitrary qubit states and arbi- trary quantum measurements exactly. However, this result does not exclude the possibility that restricted families of measurements may admit accurate 1-bit classical approximations. We use a neural network procedure to demonstrate that a single bit can achieve high average accuracy for specific measurement families. A performance analysis of our neural network reveals that symmet- ric measurements with uniformly weighted elements, such as those forming regular polyhedra, are particularly amenable to this restricted communication. By analyzing the patterns learned by the neural network, we derive an analytical protocol that is extremely accurate for finite information- ally complete symmetric configurations and becomes exact in the limit of a continuous isotropic measurement.
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.