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:1502.01058 · Proceedings of the National Academy of Sciences

Quantum communication complexity advantage implies violation of a Bell inequality

Harry Buhrman, Łukasz Czekaj, Andrzej Grudka, Michał Horodecki, Paweł Horodecki, Marcin Markiewicz, Florian Speelman, Sergii Strelchuk

Published Mar 8, 2016• 67 citations
arXivHTMLPDF

Abstract

Significance For many communication complexity problems the quantum strategies, distinguished by using Bell nonlocal correlations, provide exponential advantage over the best possible classical strategies. Conversely, for any Bell nonlocal correlations there exists a communication complexity problem that is solved more efficiently using the former. Despite many efforts, there were only two problems for which one could certify that any strategy that outperforms the classical one must harbor Bell nonlocal correlations. We prove that any large advantage over the best known classical strategy makes use of Bell nonlocal correlations. Thus, we provide the missing link to the fundamental equivalence between Bell nonlocality and quantum advantage.

DOI
10.1073/pnas.1507647113

Related papers

Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?

Armin Tavakoli, Marek Żukowski, Časlav Brukner

Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell inequalities allow advantages in CCPs, when communication protocols are tailored to emulate the Bell no-signaling constraint (by not communicating measurement settings). Abandonment of this restriction on classical models allows us to disprove the main result of, inter alia, \cite{BZ02}; we show that quantum correlations obtained from these communication strategies assisted by a small quantum violation of the CGLMP Bell inequalities do not imply advantages in any CCP in the input/output scenario considered in the reference. More generally, we show that there exists quantum correlations, with nontrivial local marginal probabilities, which violate the I3322 Bell inequality, but do not enable a quantum advantange in any CCP, regardless of the communication strategy employed in the quantum protocol, for a scenario with a fixed number of inputs and outputs

arXiv:1907.01322•Quantum•Sep 7, 2020•20 citations

High-Dimensional Quantum Communication Complexity beyond Strategies Based on Bell’s Theorem

Daniel Martínez, Armin Tavakoli, Maurício Casanova +3 more

Quantum resources can improve communication complexity problems (CCPs) beyond their classical constraints. One quantum approach is to share entanglement and create correlations violating a Bell inequality, which can then assist classical communication. A second approach is to resort solely to the preparation, transmission, and measurement of a single quantum system, in other words, quantum communication. Here, we show the advantages of the latter over the former in high-dimensional Hilbert space. We focus on a family of CCPs, based on facet Bell inequalities, study the advantage of high-dimensional quantum communication, and realize such quantum communication strategies using up to ten-dimensional systems. The experiment demonstrates, for growing dimension, an increasing advantage over quantum strategies based on Bell inequality violation. For sufficiently high dimensions, quantum communication also surpasses the limitations of the postquantum Bell correlations obeying only locality in the macroscopic limit. We find that the advantages are tied to the use of measurements that are not rank-one projective, and provide an experimental semi-device-independent falsification of such measurements in Hilbert space dimension six.

arXiv:1807.04622•Physical Review Letters•Oct 12, 2018•41 citations

Bell Nonlocality Universally Confirmed In Any Large Communication Complexity Advantage, Bell Nonlocal Correlations, Communication Complexity And The Violation Of A Bell Inequality, Communication Complexity And The Violation Of A Bell Inequality-2, Exchang

K.N.P. Kumar

We study the following system with concomitant properties: Bell Nonlocality Universally Confirmed In Any Large Communication Complexity Advantage, Bell Nonlocal Correlations, Communication Complexity And The Violation Of A Bell Inequality, Communication Complexity And The Violation Of A Bell Inequality-2, Exchange Of The Information After Simultaneous Teleportation To Reveal The Path Of The Teleported System In A Three-Round Protocol, Efficient Teleportation Protocol, Protocols That Use Initial Entanglement Should Be Even More Explicitly Bell Nonlocal, Classical And Quantum Communication Complexity, Asymptotic Teleportation Scheme : Universal Programmable Quantum Processor, Quantum Teleportation Scheme By Selecting One Of Multiple Output Ports, String Theory Basics The full paper: http://www.iiste.org/PDFshare/APTA-PAGENO-586138-592334.pdf

Advances in physics theories and applications•Jan 1, 2013•0 citations

Bell’s Inequalities and Quantum Communication Complexity

Časlav Brukner, Marek Żukowski, Jian-Wei Pan +1 more

We prove that for every Bell's inequality, including those which are not yet known, there always exists a communication complexity problem, for which a protocol assisted by states which violate the inequality is more efficient than any classical protocol. Violation of Bell's inequalities is the necessary and sufficient condition for quantum protocol to beat the classical ones.

arXiv:quant-ph/0210114•Physical Review Letters•Mar 22, 2004•274 citations

Universal scheme for violation of local realism from quantum advantage in one-way communication complexity

Łukasz Czekaj, Andrzej Grudka, Michał Horodecki +2 more

We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that type of problems and non-signaling correlations. We construct non linear bipartite Bell type inequalities and strong nonlocality test with binary observables by providing general method of Bell inequalities construction and showing that existence of gap between quantum and classical complexity leads to violation of these inequalities. We obtain, first to our knowledge, explicit Bell inequality with binary observables and exponential violation.

arXiv:1308.5404•Aug 25, 2013•1 citation

The relation between the quantum games, communication complexity problems and Bell inequalities

Marcin Pawłowski

We study the relation between the quantum games, communication complexity problems and Bell inequalities. In particular we are interested in answering the question whether for every element of one of these groups there is a corresponding element in the other two. We show that there are cases where there is no such relation. Moreover, in the communication complexity problems for which there is no Bell inequality the advantage of the quantum strategies over the classical ones is much higher.

arXiv:0710.3881•Oct 22, 2007•2 citations
Significance For many communication complexity problems the quantum strategies, distinguished by using Bell nonlocal correlations, provide exponential advantage over the best possible classical strategies. Conversely, for any Bell nonlocal correlations there exists a communication complexity problem that is solved more efficiently using the former. Despite many efforts, there were only two problems for which one could certify that any strategy that outperforms the classical one must harbor Bell nonlocal correlations. We prove that any large advantage over the best known classical strategy makes use of Bell nonlocal correlations. Thus, we provide the missing link to the fundamental equivalence between Bell nonlocality and quantum advantage.
Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell inequalities allow advantages in CCPs, when communication protocols are tailored to emulate the Bell no-signaling constraint (by not communicating measurement settings). Abandonment of this restriction on classical models allows us to disprove the main result of, inter alia, \cite{BZ02}; we show that quantum correlations obtained from these communication strategies assisted by a small quantum violation of the CGLMP Bell inequalities do not imply advantages in any CCP in the input/output scenario considered in the reference. More generally, we show that there exists quantum correlations, with nontrivial local marginal probabilities, which violate the I3322 Bell inequality, but do not enable a quantum advantange in any CCP, regardless of the communication strategy employed in the quantum protocol, for a scenario with a fixed number of inputs and outputs
Quantum resources can improve communication complexity problems (CCPs) beyond their classical constraints. One quantum approach is to share entanglement and create correlations violating a Bell inequality, which can then assist classical communication. A second approach is to resort solely to the preparation, transmission, and measurement of a single quantum system, in other words, quantum communication. Here, we show the advantages of the latter over the former in high-dimensional Hilbert space. We focus on a family of CCPs, based on facet Bell inequalities, study the advantage of high-dimensional quantum communication, and realize such quantum communication strategies using up to ten-dimensional systems. The experiment demonstrates, for growing dimension, an increasing advantage over quantum strategies based on Bell inequality violation. For sufficiently high dimensions, quantum communication also surpasses the limitations of the postquantum Bell correlations obeying only locality in the macroscopic limit. We find that the advantages are tied to the use of measurements that are not rank-one projective, and provide an experimental semi-device-independent falsification of such measurements in Hilbert space dimension six.
We study the following system with concomitant properties: Bell Nonlocality Universally Confirmed In Any Large Communication Complexity Advantage, Bell Nonlocal Correlations, Communication Complexity And The Violation Of A Bell Inequality, Communication Complexity And The Violation Of A Bell Inequality-2, Exchange Of The Information After Simultaneous Teleportation To Reveal The Path Of The Teleported System In A Three-Round Protocol, Efficient Teleportation Protocol, Protocols That Use Initial Entanglement Should Be Even More Explicitly Bell Nonlocal, Classical And Quantum Communication Complexity, Asymptotic Teleportation Scheme : Universal Programmable Quantum Processor, Quantum Teleportation Scheme By Selecting One Of Multiple Output Ports, String Theory Basics The full paper: http://www.iiste.org/PDFshare/APTA-PAGENO-586138-592334.pdf
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that type of problems and non-signaling correlations. We construct non linear bipartite Bell type inequalities and strong nonlocality test with binary observables by providing general method of Bell inequalities construction and showing that existence of gap between quantum and classical complexity leads to violation of these inequalities. We obtain, first to our knowledge, explicit Bell inequality with binary observables and exponential violation.