Single-Round Proofs of Quantumness from Knowledge Assumptions
Paper i proceeding, 2025

A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptographic assumption). Such protocols play a crucial role in the certification of quantum devices. Existing single-round protocols based solely on a cryptographic hardness assumption (like asking the quantum computer to factor a large number) require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. In this work, we construct efficient single-round proofs of quantumness based on existing knowledge assumptions. While knowledge assumptions have not been previously considered in this context, we show that they provide a natural basis for separating classical and quantum computation. Our work also helps in understanding the interplay between black-box/white-box reductions and cryptographic assumptions in the design of proofs of quantumness. Specifically, we show that multi-round protocols based on Decisional Diffie-Hellman (DDH) or Learning With Errors (LWE) can be “compiled” into single-round protocols using a knowledge-of-exponent assumption [7] or knowledge-of-lattice-point assumption [36], respectively. We also prove an adaptive hardcore-bit statement for a family of claw-free functions based on DDH, which might be of independent interest.

Decisional Diffie-Hellman

Knowledge assumptions

Proofs of quantumness

Learning with errors

Författare

Petia Arabadjieva

Eidgenössische Technische Hochschule Zürich (ETH)

Alexandru Gheorghiu

Chalmers, Data- och informationsteknik, Data Science och AI

Victor Gitton

Eidgenössische Technische Hochschule Zürich (ETH)

Tony Metger

Eidgenössische Technische Hochschule Zürich (ETH)

Leibniz International Proceedings in Informatics, LIPIcs

18688969 (ISSN)

Vol. 325 8
9783959773614 (ISBN)

16th Innovations in Theoretical Computer Science Conference, ITCS 2025
New York, USA,

Ämneskategorier (SSIF 2025)

Datavetenskap (datalogi)

DOI

10.4230/LIPIcs.ITCS.2025.8

Mer information

Senast uppdaterat

2025-03-03