For every n, one quantum oracle circuit generated in polynomial time from n using H, T, T† and CNOT approximates the channel of every n-qubit unitary to full diamond-norm error at most 1/2 after a suitable Boolean oracle is chosen; circuit size, qubits, queries and query length are polynomial in n.
For every n, one quantum oracle circuit generated in polynomial time from n using H, T, T† and CNOT approximates the channel of every n-qubit unitary to full diamond-norm error at most 1/2 after a suitable Boolean oracle is chosen; circuit size, qubits, queries and query length are polynomial in n.
For every n, one quantum oracle circuit generated in polynomial time from n using H, T, T† and CNOT approximates the channel of every n-qubit unitary to full diamond-norm error at most 1/2 after a suitable Boolean oracle is chosen; circuit size, qubits, queries and query length are polynomial in n.
If correct, resolves the constant-error unitary-synthesis existence question in this Boolean-oracle model.
Can one polynomial quantum oracle circuit approximate any n-qubit unitary after choosing a Boolean oracle?
Publication dates and editorial changes.
OpenAI reports polynomial unitary synthesis with a Boolean oracle
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
