Fermi Ma

Oct 17, 2023 | eprint.iacr.org | Alex Lombardi |John Wright |Fermi Ma |John Wright

Paper 2023/1602 , Princeton University, Simons Institute, University of California, Berkeley, University of California, Berkeley 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, can the task of implementing any unitary be efficiently reduced to the task of implementing any Boolean function?