Simulating quantum correlations with finite communication

From MaRDI portal
Publication:3586191

DOI10.1137/080723909zbMATH Open1205.68181arXiv0708.0827OpenAlexW1989658026MaRDI QIDQ3586191FDOQ3586191


Authors: Ben Toner, Oded Regev Edit this on Wikidata


Publication date: 6 September 2010

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

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.


Full work available at URL: https://arxiv.org/abs/0708.0827




Recommendations





Cited In (19)





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)