Unitary Synthesis Problem: The Boolean Oracle Behind OpenAI’s Surprising Answer
OpenAI claims a positive answer to the unitary synthesis problem: a quantum computer can approximate any quantum unitary efficiently when supplied with a suitably chosen classical Boolean oracle. The qualification belongs in the opening sentence. The paper does not show how to construct that oracle efficiently. That still makes this a striking claim. The problem … Read more