John Wright

A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography

2024

The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any n-qubit unitary U can be implemented by an efficient quantum algorithm A augmented with an oracle that computes an arbitrary Boolean function f. In other words, …