arXiv:2609.25211
Thermodynamic Proof of Quantumness without Structure
Florian Meier, Hayata Yamasaki
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.
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