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?
John Wright
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with John
Contact John, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack