Quantum Depth in the Random Oracle Model
Uloženo v:
| Název: | Quantum Depth in the Random Oracle Model |
|---|---|
| Autoři: | Arora, Atul Singh, Coladangelo, Andrea, Coudron, Matthew, Gheorghiu, Alexandru, 1990, Singh, Uttam, Waldner, Hendrik |
| Zdroj: | 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, USA Proceedings of the Annual ACM Symposium on Theory of Computing. :1111-1124 |
| Témata: | proof of quantum depth, random oracle model, Hybrid classical-quantum models of computation |
| Popis: | We give a comprehensive characterisation of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle: (a) BPPQNCBPP BQP. This refutes Jozsa's conjecture in the random oracle model. As a result, this gives the first instantiatable separation between the classes by replacing the oracle with a cryptographic hash function, yielding a resolution to one of Aaronson's ten semi-grand challenges in quantum computing. (b) BPPQNC QNCBPP and QNCBPP BPPQNC. This shows that there is a subtle interplay between classical computation and shallow quantum computation. In fact, for the second separation, we establish that, for some problems, the ability to perform adaptive measurements in a single shallow quantum circuit, is more useful than the ability to perform polynomially many shallow quantum circuits without adaptive measurements. We also show that BPPQNC and BPPQNC are both strictly contained in BPPQNCBPP. (c) There exists a 2-message proof of quantum depth protocol. Such a protocol allows a classical verifier to efficiently certify that a prover must be performing a computation of some minimum quantum depth. Our proof of quantum depth can be instantiated using the recent proof of quantumness construction by Yamakawa and Zhandry. |
| Popis souboru: | electronic |
| Přístupová URL adresa: | https://research.chalmers.se/publication/536510 https://research.chalmers.se/publication/536510/file/536510_Fulltext.pdf |
| Databáze: | SwePub |
Nájsť tento článok vo Web of Science | Abstrakt: | We give a comprehensive characterisation of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle: (a) BPPQNCBPP BQP. This refutes Jozsa's conjecture in the random oracle model. As a result, this gives the first instantiatable separation between the classes by replacing the oracle with a cryptographic hash function, yielding a resolution to one of Aaronson's ten semi-grand challenges in quantum computing. (b) BPPQNC QNCBPP and QNCBPP BPPQNC. This shows that there is a subtle interplay between classical computation and shallow quantum computation. In fact, for the second separation, we establish that, for some problems, the ability to perform adaptive measurements in a single shallow quantum circuit, is more useful than the ability to perform polynomially many shallow quantum circuits without adaptive measurements. We also show that BPPQNC and BPPQNC are both strictly contained in BPPQNCBPP. (c) There exists a 2-message proof of quantum depth protocol. Such a protocol allows a classical verifier to efficiently certify that a prover must be performing a computation of some minimum quantum depth. Our proof of quantum depth can be instantiated using the recent proof of quantumness construction by Yamakawa and Zhandry. |
|---|---|
| ISSN: | 07378017 |
| DOI: | 10.1145/3564246.3585153 |