A longstanding conjecture in quantum complexity theory asserts that, under the uniform input distribution, quantum query algorithms can be polynomially simulated by classical query algorithms. More precisely, the acceptance probability of any quantum query algorithm can be approximated, on average over uniformly random...
Uma Girish, Kunal Mittal, Barak Nehoran et al.· arXiv.org· 1 citation
The notion of meta-complexity of quantum relativization of oracles is introduced, and it is shown that this meta-complexity can be nontrivial by giving a complete classification, within the family of oracle pantheons defined in this paper, of which models can separate the complexity classes.
S. Aaronson, Adam Bouland, Jordan Docter et al.· arXiv.org· 0 citations
It is well-known that every $n$-qubit unitary can be implemented by a $2^{O(n)}$-depth quantum circuit using single- and two-qubit gates. It has been open whether exponential depth is *necessary* for general unitaries, even when allowing an unlimited number of ancilla qubits. Here we show, perhaps surprisingly, that al...
Barak Nehoran, Joseph Slote, Henry S. Yuen· 5 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.