Towards Optimal Separations between Quantum and Randomized Query Complexities
暂无分享,去创建一个
[1] L. Fortnow,et al. Quantum property testing , 2002, SODA '03.
[2] Scott Aaronson,et al. BQP and the polynomial hierarchy , 2009, STOC '10.
[3] T. Sanders,et al. Analysis of Boolean Functions , 2012, ArXiv.
[4] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[5] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 2001, JACM.
[6] Yishay Mansour,et al. An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution , 1995, J. Comput. Syst. Sci..
[7] Scott Aaronson,et al. Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..
[8] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[9] George E. P. Box,et al. The Royal Society of London , 2013 .
[10] Gilles Brassard,et al. Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..
[11] Thomas Steinke,et al. Pseudorandomness for Regular Branching Programs via Fourier Analysis , 2013, APPROX-RANDOM.
[12] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[13] Shachar Lovett,et al. Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates , 2018, Electron. Colloquium Comput. Complex..
[14] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[15] Noam Nisan,et al. On the degree of boolean functions as real polynomials , 1992, STOC '92.
[16] Andris Ambainis,et al. Forrelation: A Problem that Optimally Separates Quantum from Classical Computing , 2014, STOC.
[17] Ryan O'Donnell,et al. Learning monotone decision trees in polynomial time , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[18] Avishay Tal,et al. Degree and Sensitivity: tails of two distributions , 2016, Electron. Colloquium Comput. Complex..
[19] Avishay Tal,et al. Tight bounds on The Fourier Spectrum of AC0 , 2017, Electron. Colloquium Comput. Complex..
[20] Li-Yang Tan,et al. An inequality for the Fourier spectrum of parity decision trees , 2015, ArXiv.
[21] Yishay Mansour,et al. An O(nlog log n) learning algorithm for DNF under the uniform distribution , 1992, COLT '92.
[22] Ran Raz,et al. Oracle separation of BQP and PH , 2019, Electron. Colloquium Comput. Complex..
[23] Avishay Tal,et al. Improved pseudorandomness for unordered branching programs through local monotonicity , 2017, Electron. Colloquium Comput. Complex..
[24] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[25] Daniel A. Spielman,et al. Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.
[26] Shachar Lovett,et al. Pseudorandom Generators from Polarizing Random Walks , 2018, Electron. Colloquium Comput. Complex..
[27] Daniel R. Simon,et al. On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[28] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.