Polynomials, Quantum Query Complexity, and Grothendieck's Inequality
暂无分享,去创建一个
Andris Ambainis | Scott Aaronson | Martins Kokainis | Juris Smotrovs | Jānis Iraids | S. Aaronson | A. Ambainis | Juris Smotrovs | Janis Iraids | M. Kokainis
[1] Scott Aaronson,et al. Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.
[2] Adi Shraibman,et al. Lower bounds in communication complexity based on factorization norms , 2009 .
[3] Ronald de Wolf,et al. Nondeterministic Quantum Query and Quantum Communication Complexities , 2000, cs/0001014.
[4] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[5] N. Gisin,et al. Grothendieck's constant and local models for noisy entangled quantum states , 2006, quant-ph/0606138.
[6] A. Shimony,et al. Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .
[7] Stanisław Kwapień,et al. Decoupling Inequalities for Polynomial Chaos , 1987 .
[8] Ryan O'Donnell,et al. Polynomial bounds for decoupling, with applications , 2015, CCC.
[9] Andris Ambainis,et al. Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[10] Scott Aaronson,et al. Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..
[11] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[12] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[13] Andris Ambainis,et al. Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer , 2010, SIAM J. Comput..
[14] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[15] Andris Ambainis,et al. Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[16] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[17] G. Pisier. Grothendieck's Theorem, past and present , 2011, 1101.4195.
[18] G. Pisier. Grothendieck’s Theorem , 1986 .
[19] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[20] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[21] Noam Nisan,et al. On the degree of boolean functions as real polynomials , 1992, STOC '92.
[22] Andris Ambainis,et al. Forrelation: A Problem that Optimally Separates Quantum from Classical Computing , 2014, STOC.
[23] Ronald de Wolf,et al. Nondeterministic Quantum Query and Communication Complexities , 2003, SIAM J. Comput..
[24] Edward Farhi,et al. A Quantum Algorithm for the Hamiltonian NAND Tree , 2008, Theory Comput..
[25] R. Cleve,et al. Quantum fingerprinting. , 2001, Physical review letters.
[26] E. Thomas,et al. A polarization identity for multilinear maps , 2013, 1309.1275.
[27] Ben Reichardt. Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas , 2011, TQC.
[28] Raymond H. Putra,et al. Unbounded-Error Quantum Query Complexity , 2008, ISAAC.
[29] 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.
[30] Marie Frei,et al. Decoupling From Dependence To Independence , 2016 .