Simulating quantum correlations with finite communication

DOI10.1137/080723909MaRDI QIDQ3586191zbMATH OpenOpenAlexFDO

Authors Ben Toner, Oded Regev

Publication date 6 September 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0708.0827, https://resolver.caltech.edu/CaltechAUTHORS:20100618-081821751

zbMATH Keywords

quantum entanglementcommunication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Abstract: Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally, i.e., with shared randomness alone. We show that by using only two bits of communication, Alice and Bob can classically simulate any such correlations. All previous protocols for exact simulation required the communication to grow to infinity with the dimension $d$. Our protocol and analysis are based on a power series method, resembling Krivine's bound on Grothendieck's constant, and on the computation of volumes of spherical tetrahedra.

Recommendations

• Bell inequalities with auxiliary communication
• Classical protocol for simulation of spin measurement correlations of binary spin-\(S\) singlet state
• Exact classical simulation of the GHZ distribution
• Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost
• Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

Cited in

(19)

• The Communication Complexity of Non-signaling Distributions
• A universal representation for quantum commuting correlations
• Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost
• Grothendieck’s Theorem, past and present
• Exact classical simulation of the GHZ distribution
• Grothendieck-type inequalities in combinatorial optimization
• Classical, quantum and nonsignalling resources in bipartite games
• Classical protocol for simulation of spin measurement correlations of binary spin-\(S\) singlet state
• Multipartite quantum correlation and communication complexities
• Entangled states cannot be classically simulated in generalized Bell experiments with quantum inputs
• Bell scenarios with communication
• Grothendieck constant is norm of Strassen matrix multiplication tensor
• Efficient protocols for generating bipartite classical distributions and quantum states
• A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
• Memory cost for simulating all quantum correlations from the Peres-Mermin scenario
• Bell inequalities with auxiliary communication
• Synthesis and compression of correlation signals generated by pairs of qubits in CHSH scenarios
• Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement
• Channel Simulation With Quantum Side Information

This page was built for publication: Simulating quantum correlations with finite communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586191)