Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.25211

Thermodynamic Proof of Quantumness without Structure

Florian Meier, Hayata Yamasaki

quant-phSubmitted Sep 21, 2026• Announced Sep 23, 2026• 0 citations
arXivHTMLPDF

Abstract

Demonstrating that a machine performs genuinely quantum operations is a central challenge in quantum information processing. Existing proofs of quantumness typically rely on computational tasks that are infeasible for classical machines under assumptions such as computational hardness, or explicit bounds on classical runtime, memory, or oracle queries. Here we introduce an alternative paradigm: a thermodynamic proof of quantumness based on energy consumption. Using the search problem of Yamakawa and Zhandry with a structureless uniformly random oracle, we show that any classical machine solving the task with constant success probability must generate entropy that grows exponentially with the security parameter. By Landauer's principle, this implies an exponential lower bound on heat dissipation and hence on the energy consumption of any cyclic classical implementation. In contrast, the corresponding quantum prover solves the task with polynomial query and gate complexity, giving polynomial energy consumption under standard assumptions for quantum implementations. Thus, in the random-oracle setting, sufficiently low energy consumption in a successful implementation certifies quantumness through a macroscopic thermodynamic observation of energy consumption.

AI Summary

Can low energy consumption certify quantum computation without bounding classical runtime or memory? This paper proposes a thermodynamic proof of quantumness for the Yamakawa–Zhandry search problem relative to a uniformly random oracle. The task is to find a codeword $\pi=(x_1,\ldots,x_n)$ satisfying $H_i(x_i)=1$ for every coordinate, using the folded Reed–Solomon code underlying the existing query-complexity separation. For constant success probability $\Delta$, the paper derives a classical transcript-entropy lower bound of order $\lambda 2^{\lambda^c}$, where $n=\Theta(\lambda)$ and $0<c<1$. Bounded-query soundness, with threshold $Q^*=2^{\lambda^c}$ and error $\varepsilon=2^{-\Omega(\lambda)}$, implies that any successful unbounded strategy reaches this threshold with probability at least $\Delta-\varepsilon$. An entropy bound for adaptive, variable-length random-oracle transcripts then gives explicit finite-size constants. Under the stipulated cyclic memory-reset model, Landauer’s principle converts this into $W_{\mathrm C}\geq k_BT\,\Omega(\lambda 2^{\lambda^c})$. The existing quantum prover uses polynomially many queries and gates; polynomial energy consumption additionally assumes polynomial control and erasure costs. The certification requires repeated operation with memory reset after each run; operationally forcing or certifying erasure for an arbitrary adversary remains open. A truly random oracle of the required size is impractical. Suggested hash-function instantiations therefore make certification conditional on security assumptions, and the quantum device must implement coherent oracle access. The proposed experimental test compares empirical success frequency and average full-cycle energy consumption against the theoretical bounds; no experimental demonstration is reported.

Little sign of AI-generated textOverclaimsStrong assumptionsPossible error

Central claim may not hold: The classical energy bound incorrectly treats retention and erasure of the complete query transcript as unavoidable, although reversible computation with oracle-assisted uncomputation can clear that transcript before cyclic reset. The quantum energy upper bound assumes a polynomial-size reversible implementation of a uniformly random oracle, which is not supplied by the query model and generally does not exist. Replacing the random oracle by a seeded pseudorandom function does not preserve the information-theoretic entropy bound against unbounded classical solvers under ordinary computational security assumptions.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
6 + 16 pages, 4 figures, comments welcome

Related papers

Energy-Consumption Advantage of Quantum Computation

Florian Meier, Hayata Yamasaki

Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers. Quantum computation offers advantages over classical computation in terms of various computational resources; however, proving its energy-consumption advantage has been challenging due to the lack of a theoretical foundation linking the physical concept of energy with the computer-scientific notion of complexity for quantum computation. To bridge this gap, we introduce a general framework for studying the energy consumption of quantum and classical computation, based on a computational model conventionally used for studying query complexity in computational complexity theory. Within this framework, we derive an upper bound for the achievable energy consumption of quantum computation, accounting for imperfections in implementation appearing in practice. As part of this analysis, we construct a protocol for Landauer erasure with finite precision in a finite number of steps, which constitutes a contribution of independent interest. Additionally, we develop techniques for proving a nonzero lower bound of energy consumption of classical computation, based on the energy-conservation law and Landauer’s principle. Using these general bounds, we rigorously prove that quantum computation achieves an exponential energy-consumption advantage over classical computation for solving a paradigmatic computational problem—Simon’s problem. Furthermore, we propose explicit criteria for experimentally demonstrating this energy-consumption advantage of quantum computation, analogous to the experimental demonstrations of quantum computational supremacy. These results establish a foundational framework and techniques to explore the energy consumption of computation, opening an alternative way to study the advantages of quantum computation.

arXiv:2305.11212•PRX Energy•May 13, 2025•57 citations

Simpler Proofs of Quantumness

Zvika Brakerski, Venkata Koppula, Umesh V. Vazirani +1 more

A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the first step towards constructing a useful quantum computer. There are currently three approaches for exhibiting proofs of quantumness: (i) Inverting a classically-hard one-way function (e.g. using Shor's algorithm). This seems technologically out of reach. (ii) Sampling from a classically-hard-to-sample distribution (e.g. BosonSampling). This may be within reach of near-term experiments, but for all such tasks known verification requires exponential time. (iii) Interactive protocols based on cryptographic assumptions. The use of a trapdoor scheme allows for efficient verification, and implementation seems to require much less resources than (i), yet still more than (ii). In this work we propose a significant simplification to approach (iii) by employing the random oracle heuristic. (We note that we do not apply the Fiat-Shamir paradigm.) We give a two-message (challenge-response) proof of quantumness based on any trapdoor claw-free function. In contrast to earlier proposals we do not need an adaptive hard-core bit property. This allows the use of smaller security parameters and more diverse computational assumptions (such as Ring Learning with Errors), significantly reducing the quantum computational effort required for a successful demonstration.

arXiv:2005.04826•Leibniz international proceedings in informatics•Jan 1, 2020•60 citations

Depth-efficient proofs of quantumness

Zhenning Liu, Alexandru Gheorghiu

A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and be accepted, while any polynomial-time classical prover will be rejected with high probability, based on plausible computational assumptions. To answer the verifier's challenges, existing proofs of quantumness typically require the quantum prover to perform a combination of polynomial-size quantum circuits and measurements. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits (and measurements) together with log-depth classical computation. Our first construction is a generic compiler that allows us to translate all existing proofs of quantumness into constant quantum depth versions. Our second construction is based around the learning with rounding problem, and yields circuits with shorter depth and requiring fewer qubits than the generic construction. In addition, the second construction also has some robustness against noise.

arXiv:2107.02163•Quantum•Sep 19, 2022•24 citations

A provable quantum advantage for approximate optimization via decoded quantum interferometry

Maximilian J. Kramer, Elies Gil-Fuster, Benjamin D. M. Jones +2 more

Decoded quantum interferometry (DQI) is a novel paradigm for tackling approximate optimization problems on quantum computers. This framework comes with strong performance guarantees and exploits a well-established duality between optimization and coding theory. A central question, however, is whether DQI can actually provably outperform all polynomial-time classical algorithms. In this work, we establish such an advantage in an oracle setting: we consider an optimization task called folded optimal polynomial intersection (folded OPI), where the acceptance sets are chosen randomly and accessed through membership oracles. We establish a strict gap between the approximation ratio achievable by any polynomial-time classical algorithm and the approximation ratio achieved by the DQI algorithm. Our proof builds on Jordan et al.'s DQI framework for approximate optimization and extends the classical lower-bound method underlying Yamakawa and Zhandry's exact-search oracle separation to approximation. Building on recent developments by Sun and Wootters, Horinaga and Yamakawa, and Jo, we further show that a modified version of the DQI algorithm achieves a strictly higher score guarantee on typical sampled folded OPI instances. As a concrete example, for code rate $0.3$, DQI achieves expected scores of approximately $0.85$. In contrast, exceeding the classical threshold of $0.65$ by any fixed amount with constant probability on sampled instances requires super-polynomially many classical membership queries.

quant-pharXiv:2610.02145•Oct 2, 2026•5 citations

Certified Randomness without Structure Against Shallow-Query Adversaries

Dakshita Khurana, Bhaskar Roberts, Avishay Tal

In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a codeword preimage of a publicly computable function H. They conjectured that given any H, a successful prover must sample their preimage from a high-entropy distribution over possible answers. If true, this would give a certifiable randomness protocol in the quantum random oracle model. As partial evidence for their conjecture, Yamakawa and Zhandry proved the security of their certifiable randomness protocol assuming the Aaronson-Ambainis conjecture. We prove the security of the certifiable randomness protocol of Yamakawa-Zhandry unconditionally, without relying on the unproven Aaronson-Ambainis conjecture, against low query-depth quantum adversaries: specifically, adversaries that make up to o(\log λ) adaptive quantum queries to the random oracle.

quant-pharXiv:2608.24832•Aug 26, 2026•1 citation

Unconditional Proofs of Quantumness Between Small-Space Machines

A. C. Cem Say, M. Utkan Gezer

Abstract A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers. Existing approaches to provide proofs of quantumness depend on unproven assumptions about some task being impossible for machines of a particular model under certain resource restrictions. We study a setup where both devices have space bounds o (log log n ). Under such memory budgets, it has been unconditionally proven that probabilistic Turing machines are unable to solve certain computational problems. We formulate a new class of problems and show that these problems are polynomial-time solvable for quantum machines, impossible for classical machines, and have the property that their solutions can be “proved” by a small-space quantum machine to a classical machine with the same space bound. These problems form the basis of our newly defined protocol, where the polynomial-time verifier's verdict about the tested machine's quantumness is not conditional on an unproven weakness assumption.

arXiv:2412.02662•Quantum Information and Computation•Feb 15, 2025•1 citation
Demonstrating that a machine performs genuinely quantum operations is a central challenge in quantum information processing. Existing proofs of quantumness typically rely on computational tasks that are infeasible for classical machines under assumptions such as computational hardness, or explicit bounds on classical runtime, memory, or oracle queries. Here we introduce an alternative paradigm: a thermodynamic proof of quantumness based on energy consumption. Using the search problem of Yamakawa and Zhandry with a structureless uniformly random oracle, we show that any classical machine solving the task with constant success probability must generate entropy that grows exponentially with the security parameter. By Landauer's principle, this implies an exponential lower bound on heat dissipation and hence on the energy consumption of any cyclic classical implementation. In contrast, the corresponding quantum prover solves the task with polynomial query and gate complexity, giving polynomial energy consumption under standard assumptions for quantum implementations. Thus, in the random-oracle setting, sufficiently low energy consumption in a successful implementation certifies quantumness through a macroscopic thermodynamic observation of energy consumption.
Can low energy consumption certify quantum computation without bounding classical runtime or memory? This paper proposes a thermodynamic proof of quantumness for the Yamakawa–Zhandry search problem relative to a uniformly random oracle. The task is to find a codeword π=(x1,…,xn)\pi=(x_1,\ldots,x_n)π=(x1​,…,xn​) satisfying Hi(xi)=1H_i(x_i)=1Hi​(xi​)=1 for every coordinate, using the folded Reed–Solomon code underlying the existing query-complexity separation.
For constant success probability Δ\DeltaΔ, the paper derives a classical transcript-entropy lower bound of order λ2λc\lambda 2^{\lambda^c}λ2λc, where n=Θ(λ)n=\Theta(\lambda)n=Θ(λ) and 0<c<10<c<10<c<1. Bounded-query soundness, with threshold Q∗=2λcQ^*=2^{\lambda^c}Q∗=2λc and error ε=2−Ω(λ)\varepsilon=2^{-\Omega(\lambda)}ε=2−Ω(λ), implies that any successful unbounded strategy reaches this threshold with probability at least Δ−ε\Delta-\varepsilonΔ−ε. An entropy bound for adaptive, variable-length random-oracle transcripts then gives explicit finite-size constants. Under the stipulated cyclic memory-reset model, Landauer’s principle converts this into WC≥kBT Ω(λ2λc)W_{\mathrm C}\geq k_BT\,\Omega(\lambda 2^{\lambda^c})WC​≥kB​TΩ(λ2λc). The existing quantum prover uses polynomially many queries and gates; polynomial energy consumption additionally assumes polynomial control and erasure costs.
The certification requires repeated operation with memory reset after each run; operationally forcing or certifying erasure for an arbitrary adversary remains open. A truly random oracle of the required size is impractical. Suggested hash-function instantiations therefore make certification conditional on security assumptions, and the quantum device must implement coherent oracle access. The proposed experimental test compares empirical success frequency and average full-cycle energy consumption against the theoretical bounds; no experimental demonstration is reported.
Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers. Quantum computation offers advantages over classical computation in terms of various computational resources; however, proving its energy-consumption advantage has been challenging due to the lack of a theoretical foundation linking the physical concept of energy with the computer-scientific notion of complexity for quantum computation. To bridge this gap, we introduce a general framework for studying the energy consumption of quantum and classical computation, based on a computational model conventionally used for studying query complexity in computational complexity theory. Within this framework, we derive an upper bound for the achievable energy consumption of quantum computation, accounting for imperfections in implementation appearing in practice. As part of this analysis, we construct a protocol for Landauer erasure with finite precision in a finite number of steps, which constitutes a contribution of independent interest. Additionally, we develop techniques for proving a nonzero lower bound of energy consumption of classical computation, based on the energy-conservation law and Landauer’s principle. Using these general bounds, we rigorously prove that quantum computation achieves an exponential energy-consumption advantage over classical computation for solving a paradigmatic computational problem—Simon’s problem. Furthermore, we propose explicit criteria for experimentally demonstrating this energy-consumption advantage of quantum computation, analogous to the experimental demonstrations of quantum computational supremacy. These results establish a foundational framework and techniques to explore the energy consumption of computation, opening an alternative way to study the advantages of quantum computation.
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the first step towards constructing a useful quantum computer. There are currently three approaches for exhibiting proofs of quantumness: (i) Inverting a classically-hard one-way function (e.g. using Shor's algorithm). This seems technologically out of reach. (ii) Sampling from a classically-hard-to-sample distribution (e.g. BosonSampling). This may be within reach of near-term experiments, but for all such tasks known verification requires exponential time. (iii) Interactive protocols based on cryptographic assumptions. The use of a trapdoor scheme allows for efficient verification, and implementation seems to require much less resources than (i), yet still more than (ii). In this work we propose a significant simplification to approach (iii) by employing the random oracle heuristic. (We note that we do not apply the Fiat-Shamir paradigm.) We give a two-message (challenge-response) proof of quantumness based on any trapdoor claw-free function. In contrast to earlier proposals we do not need an adaptive hard-core bit property. This allows the use of smaller security parameters and more diverse computational assumptions (such as Ring Learning with Errors), significantly reducing the quantum computational effort required for a successful demonstration.
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and be accepted, while any polynomial-time classical prover will be rejected with high probability, based on plausible computational assumptions. To answer the verifier's challenges, existing proofs of quantumness typically require the quantum prover to perform a combination of polynomial-size quantum circuits and measurements. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits (and measurements) together with log-depth classical computation. Our first construction is a generic compiler that allows us to translate all existing proofs of quantumness into constant quantum depth versions. Our second construction is based around the learning with rounding problem, and yields circuits with shorter depth and requiring fewer qubits than the generic construction. In addition, the second construction also has some robustness against noise.
Decoded quantum interferometry (DQI) is a novel paradigm for tackling approximate optimization problems on quantum computers. This framework comes with strong performance guarantees and exploits a well-established duality between optimization and coding theory. A central question, however, is whether DQI can actually provably outperform all polynomial-time classical algorithms. In this work, we establish such an advantage in an oracle setting: we consider an optimization task called folded optimal polynomial intersection (folded OPI), where the acceptance sets are chosen randomly and accessed through membership oracles. We establish a strict gap between the approximation ratio achievable by any polynomial-time classical algorithm and the approximation ratio achieved by the DQI algorithm. Our proof builds on Jordan et al.'s DQI framework for approximate optimization and extends the classical lower-bound method underlying Yamakawa and Zhandry's exact-search oracle separation to approximation. Building on recent developments by Sun and Wootters, Horinaga and Yamakawa, and Jo, we further show that a modified version of the DQI algorithm achieves a strictly higher score guarantee on typical sampled folded OPI instances. As a concrete example, for code rate 0.30.30.3, DQI achieves expected scores of approximately 0.850.850.85. In contrast, exceeding the classical threshold of 0.650.650.65 by any fixed amount with constant probability on sampled instances requires super-polynomially many classical membership queries.
In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a codeword preimage of a publicly computable function H. They conjectured that given any H, a successful prover must sample their preimage from a high-entropy distribution over possible answers. If true, this would give a certifiable randomness protocol in the quantum random oracle model. As partial evidence for their conjecture, Yamakawa and Zhandry proved the security of their certifiable randomness protocol assuming the Aaronson-Ambainis conjecture. We prove the security of the certifiable randomness protocol of Yamakawa-Zhandry unconditionally, without relying on the unproven Aaronson-Ambainis conjecture, against low query-depth quantum adversaries: specifically, adversaries that make up to o(\log λ) adaptive quantum queries to the random oracle.
Abstract A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers. Existing approaches to provide proofs of quantumness depend on unproven assumptions about some task being impossible for machines of a particular model under certain resource restrictions. We study a setup where both devices have space bounds o (log log n ). Under such memory budgets, it has been unconditionally proven that probabilistic Turing machines are unable to solve certain computational problems. We formulate a new class of problems and show that these problems are polynomial-time solvable for quantum machines, impossible for classical machines, and have the property that their solutions can be “proved” by a small-space quantum machine to a classical machine with the same space bound. These problems form the basis of our newly defined protocol, where the polynomial-time verifier's verdict about the tested machine's quantumness is not conditional on an unproven weakness assumption.