Finding quantum partial assignments by search-to-decision reductions
Jordi Weggemans

TL;DR
This paper shows that, unlike the case for exact quantum witnesses, it is possible to efficiently approximate partial quantum states of witnesses using a classical algorithm with a QMA oracle, leveraging a new problem and circuit-to-Hamiltonian mapping.
Contribution
It introduces a classical polynomial-time algorithm with a QMA oracle for approximating partial quantum witnesses, based on a novel QMA-complete problem and a circuit-to-Hamiltonian mapping.
Findings
Classical algorithm can approximate partial quantum states with QMA oracle.
New QMA-complete problem, Low-energy Density Matrix Verification, introduced.
Approximate density matrices are constructed for near-optimal witnesses.
Abstract
In computer science, many search problems are reducible to decision problems, which implies that finding a solution is as hard as deciding whether a solution exists. A quantum analogue of search-to-decision reductions would be to ask whether a quantum algorithm with access to a oracle can construct witnesses as quantum states. By a result from Irani, Natarajan, Nirkhe, Rao, and Yuen (CCC '22), it is known that this does not hold relative to a quantum oracle, unlike the cases of , , and where search-to-decision relativizes. We prove that if one is not interested in the quantum witness as a quantum state but only in terms of its partial assignments, i.e. the reduced density matrices, then there exists a classical polynomial-time algorithm with access to a oracle that outputs approximations of the…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
