Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
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 adversary (upper) bound
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quantum counterfeit coin problems
Theoretical Computer Science
Span programs and quantum algorithms for st-connectivity and claw detection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Adversary lower bound for the k-sum problem
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Time-Efficient quantum walks for 3-distinctness
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Gate-efficient discrete simulations of continuous-time quantum query algorithms
Quantum Information & Computation
Hi-index | 0.00 |
State conversion generalizes query complexity to the problem of converting between two input-dependent quantum states by making queries to the input. We characterize the complexity of this problem by introducing a natural information-theoretic norm that extends the Schur product operator norm. The complexity of converting between two systems of states is given by the distance between them, as measured by this norm. In the special case of function evaluation, the norm is closely related to the general adversary bound, a semi-definite program that lower-bounds the number of input queries needed by a quantum algorithm to evaluate a function. We thus obtain that the general adversary bound characterizes the quantum query complexity of any function whatsoever. This generalizes and simplifies the proof of the same result in the case of boolean input and output. Also in the case of function evaluation, we show that our norm satisfies a remarkable composition property, implying that the quantum query complexity of the composition of two functions is at most the product of the query complexities of the functions, up to a constant. Finally, our result implies that discrete and continuous-time query models are equivalent in the bounded-error setting, even for the general state-conversion problem.