Near-optimal and explicit Bell inequality violations

2012

Theory of Computing , Volume 8 - Issue 27 p. 623- 645

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Journal	Theory of Computing
Project	Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Note	Earlier version in Complexity'11
Grant	This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/639.072.803 - Quantum computing: fault-tolerance, communication, and classical spin-offs
Organisation	Algorithms and Complexity
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Buhrman, H., Regev, O., Scarpa, G., & de Wolf, R. (2012). Near-optimal and explicit Bell inequality violations. Theory of Computing, 8(27), 623–645.

Publication