Efficiently verifiable quantum advantage on near-term analog quantum simulators
Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter, Yi-Kai Liu, Alicia J. Kollár, Alexey V. Gorshkov, Andrew M. Childs
TL;DR
The paper tackles the challenge of verifiably demonstrating quantum advantage on near-term analog quantum simulators. It introduces a protocol that couples a single-step Feynman-Kitaev encoding with a commuting $ZZ+Z$ Hamiltonian to certify classically hard sampling tasks, while requiring only $O(\lambda^2)$ classical time and $O(1)$ history-state samples from the prover. A measurement scheme estimates three key parameters—input fidelity $F_{in}$, sampling probability $p_{samp}$, and $|\operatorname{Tr}[\rho O_{10}]|^2$—to bound the output fidelity $F_{out}$ and the total variation distance to the ideal distribution, all via constant-shot, single-qubit measurements. The authors provide a near-term honest-prover strategy based on an echo-based history-state preparation and discuss realistic experimental pathways leveraging mostly analog computation with a global CZ gate. Overall, the work delivers a resource-efficient route to verified quantum advantage on analog devices, with concrete thresholds and robustness analyses that guide practical implementations.
Abstract
Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation, in which the verifier need only run an $O(λ^2)$-time classical computation, and the prover need only prepare $O(1)$ samples of a history state and perform $O(λ^2)$ single-qubit measurements, for a security parameter $λ$. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.
