Cryptographic Characterization of Quantum Advantage

Abstract

Quantum computational advantage refers to an existence of computational tasks that are easy for quantum computing but hard for classical one. Unconditionally showing quantum advantage is beyond our current understanding of complexity theory, and therefore some computational assumptions are needed. Which complexity assumption is necessary and sufficient for quantum advantage? In this paper, we show that inefficient-verifier proofs of quantumness (IV-PoQ) exist if and only if classically-secure one-way puzzles (OWPuzzs) exist. As far as we know, this is the first time that a complete cryptographic characterization of quantum advantage is obtained. IV-PoQ capture various types of quantum advantage previously studied, such as sampling-based quantum advantage and searching-based one. Previous work [Morimae and Yamakawa, Crypto 2024] showed that IV-PoQ can be constructed from OWFs, but a construction of IV-PoQ from weaker assumptions was left open. Our result solves the open problem. OWPuzzs are one of the most fundamental quantum cryptographic primitives implied by many quantum cryptographic primitives weaker than one-way functions (OWFs). The equivalence between IV-PoQ and classically-secure OWPuzzs therefore highlights that if there is no quantum advantage, then these fundamental primitives do not exist. The equivalence also means that quantum advantage is an example of the applications of OWPuzzs. Except for commitments, no application of OWPuzzs was known before. Our result shows that quantum advantage is another application of OWPuzzs, which solves the open question of [Chung, Goldin, and Gray, Crypto 2024]. Moreover, it is the first quantum-computation-classical-communication (QCCC) application of OWPuzzs.

arXiv comment58 pages, 2 figures

References in corpus (16)

• Quantum advantage with shallow circuits
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Pseudorandom States, Non-Cloning Theorems and Quantum Money
• Quantum commitments and signatures without one-way functions
• Impossibility of Classically Simulating One-Clean-Qubit Computation
• Classically-Verifiable Quantum Advantage from a Computational Bell Test
• Quantum Cryptography in Algorithmica
• Hardness of classically sampling one clean qubit model with constant total variation distance error
• Quantum Pseudorandomness and Classical Complexity
• Semi-Quantum Money
• Verifiable Quantum Advantage without Structure
• Quantum Depth in the Random Oracle Model
• Quantum Unpredictability
• A Qubit, a Coin, and an Advice String Walk Into a Relational Problem