Paper 2023/1911
Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization
Abstract
We introduce protocols for classical verification of quantum depth (CVQD). These protocols enable a classical verifier to differentiate between devices of varying quantum circuit depths, even in the presence of classical computation. The goal is to demonstrate that a classical verifier can reject a device with a quantum circuit depth of no more than $d$, even if the prover employs additional polynomial-time classical computation to deceive. Conversely, the verifier accepts a device with a quantum circuit depth of $d'>d$. Previous results for separating hybrid quantum-classical computers with various quantum depths require either quantum access to oracles or interactions between the classical verifier and the quantum prover. However, instantiating oracle separations can significantly increase the quantum depth in general, and interaction challenges the quantum device to keep the qubits coherent while waiting for the verifier's messages. These requirements pose barriers to implementing the protocols on near-term devices. In this work, we present a two-message protocol under the quantum hardness of learning with errors and the random oracle heuristic. An honest prover only needs classical access to the random oracle, and therefore any instantiation of the oracle does not increase the quantum depth. To our knowledge, our protocol is the first non-interactive CVQD, the instantiation of which using concrete hash functions, e.g., SHA-3, does not require additional quantum depth. Our second protocol seeks to explore the minimality of cryptographic assumptions and the tightness of the separations. To accomplish this, we introduce an untrusted quantum machine that shares entanglements with the target machine. Utilizing a robust self-test, our protocol certifies the depth of the target machine with information-theoretic security and nearly optimal separation.
Note: Preprint.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- hybrid computationoracle separationquantum depth
- Contact author(s)
-
nc67 @ rice edu
shung @ cs utexas edu - History
- 2023-12-15: approved
- 2023-12-13: received
- See all versions
- Short URL
- https://ia.cr/2023/1911
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1911, author = {Nai-Hui Chia and Shih-Han Hung}, title = {Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1911}, year = {2023}, url = {https://eprint.iacr.org/2023/1911} }