Quantum Strategies Are Better Than Classical in Almost Any XOR Game
暂无分享,去创建一个
Andris Ambainis | Kaspars Balodis | Arturs Backurs | Juris Smotrovs | Raitis Ozols | Madars Virza | Dmitry Kravcenko | M. Virza | A. Backurs | A. Ambainis | Juris Smotrovs | K. Balodis | Dmitry Kravcenko | Raitis Ozols
[1] N Aharon,et al. Fully distrustful quantum bit commitment and coin flipping. , 2011, Physical review letters.
[2] S. Massar,et al. Fully Distrustful Quantum Cryptography , 2011 .
[3] T. Tao. Topics in Random Matrix Theory , 2012 .
[4] Charalambos A. Charalambides,et al. Enumerative combinatorics , 2018, SIGA.
[5] V. Marčenko,et al. DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES , 1967 .
[6] U. Vazirani. On the power of quantum computation , 1998, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[7] B. S. Cirel'son. Quantum generalizations of Bell's inequality , 1980 .
[8] N. Gisin,et al. Guess your neighbor's input: a multipartite nonlocal game with no quantum advantage. , 2010, Physical review letters.
[9] M. Junge,et al. Large Violation of Bell Inequalities with Low Entanglement , 2010, 1007.3043.
[10] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[11] Nathan Linial,et al. Complexity measures of sign matrices , 2007, Comb..
[12] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .
[13] R. Stanley,et al. Enumerative Combinatorics: Index , 1999 .
[14] S. Kirkpatrick,et al. Infinite-ranged models of spin-glasses , 1978 .
[15] S. Szarek,et al. Chapter 8 - Local Operator Theory, Random Matrices and Banach Spaces , 2001 .
[16] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[17] V. Scarani,et al. Device-independent security of quantum cryptography against collective attacks. , 2007, Physical review letters.
[18] Thomas Vidick,et al. Explicit Lower and Upper Bounds on the Entangled Value of Multiplayer XOR Games , 2011 .
[19] Hajime Takami,et al. γ-rays as a diagnostic of the origin of core radiation in low-luminosity active galactic nuclei , 2010, 1012.5403.
[20] October I. Physical Review Letters , 2022 .
[21] 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.
[22] G. Parisi. The order parameter for spin glasses: a function on the interval 0-1 , 1980 .
[23] Gilles Brassard,et al. Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..
[24] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[25] J. W. Silverstein,et al. Spectral Analysis of Large Dimensional Random Matrices , 2009 .
[26] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[27] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science (2. ed.) , 1994 .
[28] R. Cleve,et al. Consequences and limits of nonlocal strategies , 2004 .
[29] Ronald de Wolf,et al. Near-Optimal and Explicit Bell Inequality Violations , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[30] Alex Gittens,et al. Error Bounds for Random Matrix Approximation Schemes , 2009, 0911.4108.
[31] A. Shimony,et al. Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .
[32] A. Tonge,et al. The Schur multiplication in tensor algebras , 1980 .
[33] S. Wehner. Tsirelson bounds for generalized Clauser-Horne-Shimony-Holt inequalities , 2005, quant-ph/0510076.
[34] A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques , 1996 .
[35] M. Mitzenmacher,et al. Probability and Computing: Chernoff Bounds , 2005 .
[36] Michel Talagrand,et al. The generalized Parisi formula , 2003 .