Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Journal of the ACM (JACM)
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
SIAM Journal on Computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A polynomial quantum algorithm for approximating the Jones polynomial
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Polylogarithmic Independence Can Fool DNF Formulas
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
SIAM Journal on Computing
Separating the polynomial-time hierarchy by oracles
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On the power of quantum computation
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Exponential Separation of Quantum and Classical One-Way Communication Complexity
SIAM Journal on Computing
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
A Simple Proof of Bazzi’s Theorem
ACM Transactions on Computation Theory (TOCT)
Poly-logarithmic Independence Fools AC^0 Circuits
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
SIAM Journal on Computing
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Advice coins for classical and quantum computation
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Quantum property testing for bounded-degree graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside the entire polynomial hierarchy, by relating this question to topics in circuit complexity, pseudorandomness, and Fourier analysis. First, we show that there exists an oracle relation problem (i.e., a problem with many valid outputs) that is solvable in BQP, but not in PH. This also yields a non-oracle relation problem that is solvable in quantum logarithmic time, but not in AC0. Second, we show that an oracle decision problem separating BQP from PH would follow from the Generalized Linial-Nisan Conjecture, which we formulate here and which is likely of independent interest. The original Linial-Nisan Conjecture (about pseudorandomness against constant-depth circuits) was recently proved by Braverman, after being open for twenty years.