Quantum query complexity of state conversion
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy

TL;DR
This paper introduces a new information-theoretic norm to characterize quantum state conversion complexity, showing it generalizes the adversary bound and establishes equivalence between discrete and continuous quantum query models.
Contribution
It defines a novel norm extending the Schur product operator norm, linking it to quantum query complexity and general adversary bounds, and proves model equivalence in the bounded-error setting.
Findings
The norm characterizes the complexity of quantum state conversion.
The general adversary bound fully characterizes quantum query complexity for any function.
Discrete and continuous-time quantum query models are equivalent in the bounded-error setting.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
