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:1203.0445 · Physical Review Letters

Classical Simulation of Entanglement Swapping with Bounded Communication

Cyril Branciard, Nicolas Brunner, Harry Buhrman, Richard Cleve, Nicolas Gisin, Samuel Portmann, Denis Rosset, Márió Szegedy

Published Sep 4, 2012• 60 citations
arXivHTMLPDF

Abstract

Entanglement appears under two different forms in quantum theory, namely, as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is possible to generate nonlocality between particles that never interacted, using the protocol of entanglement swapping. We show that even in the more constraining bilocal scenario where distant sources of particles are assumed to be independent, i.e., to share no prior randomness, entanglement swapping can be simulated classically with bounded communication, using only 9 bits in total. Our result thus provides an upper bound on the nonlocality of the entanglement swapping process.

DOI
10.1103/physrevlett.109.100401

Related papers

Tensor norms and the classical communication complexity of nonlocal quantum measurement

Yaoyun Shi

Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.

ACM Symposium on Theory of Computing (STOC)•May 22, 2005•4 citations

Limits of network nonlocality probed by timelike-separated observers

Pritam Halder, Ratul Banerjee, Shiladitya Mal +1 more

In an entanglement swapping scenario, if two sources distributing entangled states between three parties are independent, local correlations lead to a different kind of inequality than the standard Bell inequalities, known as network local models. A highly demanding task is to find out a way to involve many players nontrivially in a quantum network since measurements, in general, disturb the system. To this end, we consider here an alternative way of sharing network nonlocality when two observers initially share a maximally entangled, a nonmaximally entangled and a noisy entangled state. We report that by employing unsharp measurements performed by one of the observers, at most six pairs can sequentially demonstrate the violation of bilocal inequality while a maximum of two pairs of observers can exhibit bi-nonlocality when both the observers perform unsharp measurements. We also find the critical noise involved in unsharp measurements in each round to illustrate the bi-nonlocality for a fixed shared entangled state as a resource. We also connect the entanglement content of the shared state, quantified via von-Neumann entropy for pure states and entanglement of formation for Werner states with the maximum number of rounds showing violation of bilocal inequality. By considering elegant joint measurement at the node such that the entanglement content in the elements of the joint measurement by the third party gets reduced, we observe that the maximum number reduces to two sequential sharing of bi-nonlocality even for the maximally entangled state when the settings at each side are taken to be three and fixed.

arXiv:2203.05353•Physical Review A•Nov 14, 2022•9 citations

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

Yaoyun Shi, Yufan Zhu

We initiate the study of quantifying nonlocality of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds in terms of some tensor norms of the measurement operator. As applications, we show that (a) if the amount of communication is a constant, then quantum and classical communication protocols with an unlimited amount of shared entanglement or shared randomness compute the same class of functions; and (b) it requires only a constant amount of communication to classically generate an approximation of the output distribution resulting from local measurements on an entangled quantum state, as long as the number of measurement outcomes is a constant.

arXiv:quant-ph/0511071•SIAM Journal on Computing•Jan 1, 2008•20 citations

Bilocal versus nonbilocal correlations in entanglement-swapping experiments

Cyril Branciard, Denis Rosset, Nicolas Gisin +1 more

Entanglement swapping is a process by which two initially independent quantum systems can become entangled and generate nonlocal correlations. To characterize such correlations, we compare them to those predicted by bilocal models, where systems that are initially independent are described by uncorrelated states. We extend in this paper the analysis of bilocal correlations initiated in [Phys. Rev. Lett. 104, 170401 (2010)]. In particular, we derive new Bell-type inequalities based on the bilocality assumption in different scenarios, we study their possible quantum violations, and we analyze their resistance to experimental imperfections. The bilocality assumption, being stronger than Bell's standard local causality assumption, lowers the requirements for the demonstration of quantumness in entanglement-swapping experiments.

arXiv:1112.4502•Physical Review A•Mar 19, 2012•259 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

Exact Classical Simulation of the 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 twenty years 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(n^2) 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 earlier results with a protocol that needs only O(n*log(n)) bits of communication and O(log^2(n)) 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.

Leibniz international proceedings in informatics•Jan 1, 2014•0 citations
Entanglement appears under two different forms in quantum theory, namely, as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is possible to generate nonlocality between particles that never interacted, using the protocol of entanglement swapping. We show that even in the more constraining bilocal scenario where distant sources of particles are assumed to be independent, i.e., to share no prior randomness, entanglement swapping can be simulated classically with bounded communication, using only 9 bits in total. Our result thus provides an upper bound on the nonlocality of the entanglement swapping process.
Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.
In an entanglement swapping scenario, if two sources distributing entangled states between three parties are independent, local correlations lead to a different kind of inequality than the standard Bell inequalities, known as network local models. A highly demanding task is to find out a way to involve many players nontrivially in a quantum network since measurements, in general, disturb the system. To this end, we consider here an alternative way of sharing network nonlocality when two observers initially share a maximally entangled, a nonmaximally entangled and a noisy entangled state. We report that by employing unsharp measurements performed by one of the observers, at most six pairs can sequentially demonstrate the violation of bilocal inequality while a maximum of two pairs of observers can exhibit bi-nonlocality when both the observers perform unsharp measurements. We also find the critical noise involved in unsharp measurements in each round to illustrate the bi-nonlocality for a fixed shared entangled state as a resource. We also connect the entanglement content of the shared state, quantified via von-Neumann entropy for pure states and entanglement of formation for Werner states with the maximum number of rounds showing violation of bilocal inequality. By considering elegant joint measurement at the node such that the entanglement content in the elements of the joint measurement by the third party gets reduced, we observe that the maximum number reduces to two sequential sharing of bi-nonlocality even for the maximally entangled state when the settings at each side are taken to be three and fixed.
We initiate the study of quantifying nonlocality of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds in terms of some tensor norms of the measurement operator. As applications, we show that (a) if the amount of communication is a constant, then quantum and classical communication protocols with an unlimited amount of shared entanglement or shared randomness compute the same class of functions; and (b) it requires only a constant amount of communication to classically generate an approximation of the output distribution resulting from local measurements on an entangled quantum state, as long as the number of measurement outcomes is a constant.
Entanglement swapping is a process by which two initially independent quantum systems can become entangled and generate nonlocal correlations. To characterize such correlations, we compare them to those predicted by bilocal models, where systems that are initially independent are described by uncorrelated states. We extend in this paper the analysis of bilocal correlations initiated in [Phys. Rev. Lett. 104, 170401 (2010)]. In particular, we derive new Bell-type inequalities based on the bilocality assumption in different scenarios, we study their possible quantum violations, and we analyze their resistance to experimental imperfections. The bilocality assumption, being stronger than Bell's standard local causality assumption, lowers the requirements for the demonstration of quantumness in entanglement-swapping experiments.
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.
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 twenty years 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(n^2) 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 earlier results with a protocol that needs only O(n*log(n)) bits of communication and O(log^2(n)) 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.