SIAM Journal on Computing
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum cryptanalysis of hash and claw-free functions
ACM SIGACT News
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
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Information Processing Letters
The Quantum Communication Complexity of Sampling
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Better Lower Bound for Quantum Algorithms Searching an Ordered List
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum Algorithms for Element Distinctness
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ACM SIGACT News
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum and classical query complexities of local search are polynomially related
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New upper and lower bounds for randomized and quantum local search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the Role of Hadamard Gates in Quantum Circuits
Quantum Information Processing
Polynomial degree vs. quantum query complexity
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the power of Ambainis lower bounds
Theoretical Computer Science
Negative weights make adversaries stronger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum certificate complexity
Journal of Computer and System Sciences
The quantum query complexity of the determinant
Information Processing Letters
Quantum Queries on Permutations with a Promise
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The quantum complexity of group testing
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Can quantum search accelerate evolutionary algorithms?
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Lower bounds on quantum query complexity for read-once decision trees with parity nodes
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
New developments in quantum algorithms
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
The quantum query complexity of certification
Quantum Information & Computation
Quantum and randomized lower bounds for local search on vertex-transitive graphs
Quantum Information & Computation
Limitations on the simulation of non-sparse hamiltonians
Quantum Information & Computation
Quantum interpolation of polynomilas
Quantum Information & Computation
A geometric approach to quantum circuit lower bounds
Quantum Information & Computation
Exact quantum lower bound for grover's problem
Quantum Information & Computation
Quantum search of partially ordered sets
Quantum Information & Computation
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
How many query superpositions are needed to learn?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Lower bounds using kolmogorov complexity
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
All quantum adversary methods are equivalent
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Optimality proofs of quantum weight decision algorithms
Quantum Information Processing
Robust quantum algorithms with ε-biased oracles
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Reflections for quantum query algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
Quantum money from hidden subspaces
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The quantum query complexity of AC0
Quantum Information & Computation
Quantum counterfeit coin problems
Theoretical Computer Science
Reconstructing strings from substrings with quantum queries
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The quantum query complexity of algebraic properties
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Adversary lower bound for the k-sum problem
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with on input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of inputs. If the algorithm works correctly, its state becomes entangled with the superposition over inputs. We bound the number of queries needed to achieve a sufficient entanglement and this implies a lower bound on the number of queries for the computation. Using this method, we prove two new Ω(√N) lower bounds on computing AND of ORs and inverting a permutation and also provide more uniform proofs for several known lower bounds which have been previously proven via a variety of different techniques.