Quantum search-to-decision reductions and the state synthesis problem

Abstract

It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\text{de facto}$ computational task to study in complexity theory. In this work, we explore search-to-decision reductions for quantum search problems, wherein a quantum algorithm makes queries to a classical decision oracle to output a desired quantum state. In particular, we focus on search-to-decision reductions for $\mathsf{QMA}$, and show that there exists a quantum polynomial-time algorithm that can generate a witness for a $\mathsf{QMA}$ problem up to inverse polynomial precision by making one query to a $\mathsf{PP}$ decision oracle. We complement this result by showing that $\mathsf{QMA}$-search does $\text{not}$ reduce to $\mathsf{QMA}$-decision in polynomial-time, relative to a quantum oracle. We also explore the more general $\text{state synthesis problem}$, in which the goal is to efficiently synthesize a target state by making queries to a classical oracle encoding the state. We prove that there exists a classical oracle with which any quantum state can be synthesized to inverse polynomial precision using only one oracle query and to inverse exponential precision using two oracle queries. This answers an open question of Aaronson from 2016, who presented a state synthesis algorithm that makes $O(n)$ queries to a classical oracle to prepare an $n$-qubit state, and asked if the query complexity could be made sublinear.

arXiv commentv2 included new figures and improved explanations. No technical content was changed between versions. Comments are welcome and encouraged!

References in corpus (6)

• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
• Quantum Pseudorandomness and Classical Complexity
• The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
• Quantum Merlin Arthur with Exponentially Small Gap
• Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation

Cited by in corpus (5)

• Quantum Cryptography in Algorithmica
• On the Computational Hardness of Quantum One-Wayness
• A distribution testing oracle separation between QMA and QCMA
• Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
• Quantum Merlin-Arthur proof systems for synthesizing quantum states