Quantum Query Complexity of State Conversion

DOI10.1109/FOCS.2011.75MaRDI QIDQ5494975zbMATH OpenFDO

Authors Troy Lee, Rajat Mittal, Ben Reichardt, Robert Špalek, Mario Szegedy

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.3020

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: 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.

Cited in

(29)

• Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
• Extended learning graphs for triangle finding
• Key establishment à la Merkle in a quantum world
• Quantum algorithms for learning symmetric juntas via the adversary bound
• Approximate span programs
• Quantum attacks against iterated block ciphers
• A strong direct product theorem for quantum query complexity
• scientific article; zbMATH DE number 6913819 (Why is no real title available?)
• Quantum-walk speedup of backtracking algorithms
• Quantum query algorithms are completely bounded forms
• Provably secure key establishment against quantum adversaries
• Low-sensitivity functions from unambiguous certificates
• On the power of non-adaptive learning graphs
• Quantum query algorithms are completely bounded forms
• Quantum Algorithms for Classical Probability Distributions
• Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems
• scientific article; zbMATH DE number 7716603 (Why is no real title available?)
• On query complexity measures and their relations for symmetric functions
• A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function
• A direct reduction from the polynomial to the adversary method
• Separations between combinatorial measures for transitive functions
• An exponential separation between quantum query complexity and the polynomial degree
• Multidimensional quantum walks, with application to k-distinctness
• Quantum counterfeit coin problems
• The quantum supremacy Tsirelson inequality
• Quantum sabotage complexity
• A query-efficient quantum algorithm for maximum matching on general graphs

This page was built for publication: Quantum Query Complexity of State Conversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494975)