Multipartite entanglement in XOR games
暂无分享,去创建一个
Troy Lee | Harry Buhrman | Thomas Vidick | Jop Briët | Thomas Vidick | H. Buhrman | J. Briët | Troy Lee
[1] J. Wrachtrup,et al. Multipartite Entanglement Among Single Spins in Diamond , 2008, Science.
[2] Arkadev Chattopadhyay,et al. Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..
[3] A. Zeilinger,et al. Going Beyond Bell’s Theorem , 2007, 0712.0921.
[4] H. Triebel,et al. Interpolationstheorie für Banachideale von beschränkten linearen Operatoren , 1968 .
[5] László Babai. Bounded Round Interactive Proofs in Finite Groups , 1992, SIAM J. Discret. Math..
[6] Hartmut Klauck. Lower Bounds for Quantum Communication Complexity , 2007, SIAM J. Comput..
[7] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[8] Thomas Vidick,et al. More nonlocality with less entanglement , 2010, 1011.5206.
[9] Thomas Vidick,et al. Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games , 2011 .
[10] B. Tsirelson. Some results and problems on quan-tum Bell-type inequalities , 1993 .
[11] Mateus de Oliveira Oliveira. Embezzlement States are Universal for Non-Local Strategies , 2010, 1009.0771.
[12] Alexander A. Sherstov. The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.
[13] U. Haagerup. A new upper bound for the complex Grothendieck constant , 1987 .
[14] R. Blei. Multidimensional extensions of the Grothendieck inequality and applications , 1979 .
[15] Kiel T. Williams,et al. Extreme quantum entanglement in a superposition of macroscopically distinct states. , 1990, Physical review letters.
[16] H. Weinfurter,et al. Experimental test of quantum nonlocality in three-photon Greenberger–Horne–Zeilinger entanglement , 2000, Nature.
[17] Oded Regev,et al. Bell violations through independent bases games , 2011, Quantum Inf. Comput..
[18] Falk Unger,et al. A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[19] Valerio Scarani,et al. An anomaly of non-locality , 2006, Quantum Inf. Comput..
[20] Hans J. Briegel,et al. Two-setting Bell inequalities for graph states , 2005, quant-ph/0510007.
[21] Nicolas Gisin,et al. Optimal bell tests do not require maximally entangled states. , 2005, Physical review letters.
[22] Jian-Wei Pan,et al. Experimental entanglement of six photons in graph states , 2006, quant-ph/0609130.
[23] Troy Lee,et al. Disjointness is Hard in the Multiparty Number-on-the-Forehead Model , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.
[24] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[25] Ronald de Wolf,et al. Near-Optimal and Explicit Bell Inequality Violations , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[26] B. Tsirelson. Quantum analogues of the Bell inequalities. The case of two spatially separated domains , 1987 .
[27] J. Littlewood. ON BOUNDED BILINEAR FORMS IN AN INFINITE NUMBER OF VARIABLES , 1930 .
[28] L. Fortnow,et al. Quantum property testing , 2002, SODA '03.
[29] Luigi Frunzio,et al. Realization of three-qubit quantum error correction with superconducting circuits , 2011, Nature.
[30] Srinivasan Venkatesh,et al. On the advantage over a random assignment , 2002, STOC '02.
[31] B. Toner. Monogamy of non-local quantum correlations , 2006, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[32] T. K. Carne. Banach Lattices and Extensions of Grothendieck's Inequality , 1980 .
[33] Mark Braverman,et al. The Grothendieck Constant is Strictly Smaller than Krivine's Bound , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[34] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[35] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[36] P. Hayden,et al. Universal entanglement transformations without communication , 2003 .
[37] Peter Høyer,et al. Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[38] M. Junge,et al. Large Violation of Bell Inequalities with Low Entanglement , 2010, 1007.3043.
[39] Noga Alon,et al. Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.
[40] William Slofstra,et al. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[41] Jay M. Gambetta,et al. Preparation and measurement of three-qubit entanglement in a superconducting circuit , 2010, Nature.
[42] Harry Buhrman,et al. All Schatten spaces endowed with the Schur product are Q-algebras , 2012 .
[43] Nathan Linial,et al. Lower bounds in communication complexity based on factorization norms , 2007, STOC '07.
[44] Renato Renner,et al. Towards characterizing the non-locality of entangled quantum states , 2013, Theor. Comput. Sci..
[45] M. Wolf,et al. Unbounded Violation of Tripartite Bell Inequalities , 2007, quant-ph/0702189.
[46] A. M. Davie,et al. Quotient Algebras of Uniform Algebras , 1973 .
[47] G. Tóth,et al. Bell inequalities for graph states. , 2004, Physical review letters.
[48] Gideon Schechtman,et al. Lower Bounds on Quantum Multiparty Communication Complexity , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[49] William H. Ruckle,et al. Nuclear Locally Convex Spaces , 1972 .
[50] R. Latala,et al. On the best constant in the Khinchin-Kahane inequality , 1994 .
[51] J. Diestel,et al. Absolutely Summing Operators , 1995 .
[52] A. Tonge,et al. The Von Neumann Inequality for Polynomials in Several Hilbert‐Schmidt Operators , 1978 .
[53] S. Szarek. On the best constants in the Khinchin inequality , 1976 .
[54] Marek Zukowski,et al. Experimental violation of local realism by four-photon Greenberger-Horne-Zeilinger entanglement. , 2003, Physical review letters.
[55] M. Żukowski. Bell theorem involving all settings of measuring apparatus , 1993 .
[56] A. Razborov. Communication Complexity , 2011 .
[57] N. Varopoulos,et al. A theorem on operator algebras. , 1975 .
[58] A. Razborov. Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.
[59] Yannis Sarantopoulos,et al. Complexifications of real Banach spaces, polynomials and multilinear maps , 1999 .
[60] J. Wissel,et al. On the Best Constants in the Khintchine Inequality , 2007 .
[61] David Pérez-García,et al. THE TRACE CLASS IS A Q-ALGEBRA , 2006 .
[62] Carlos Palazuelos Cabezón. On the largest Bell violation attainable by a quantum state , 2014 .
[63] Alexander A. Sherstov. Communication Lower Bounds Using Dual Polynomials , 2008, Bull. EATCS.
[64] Subhash Khot,et al. Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies , 2008, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[65] D. Gottesman,et al. GHZ extraction yield for multipartite stabilizer states , 2005, quant-ph/0504208.
[66] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.