Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators
Year: 2025
Type: article
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 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.
Source: PRX Quantum
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $3,450
Funders: National Science Foundation, U.S. Department of Energy, National Institute of Standards and Technology, Defense Advanced Research Projects Agency, Office of Science, Multidisciplinary University Research Initiative, Advanced Scientific Computing Research, Air Force Office of Scientific Research
Awards: G1543527024, G1938338418, G1965873410, G2127201742, G2545343486, QLCI-CI: NSF Quantum Leap Challenge Institute for Robust Quantum Simulation, G3094313881, FUNDAMENTAL ALGORITHMIC RESEARCH FOR QUANTUM COMPUTING, FUNDAMENTAL ALGORITHMIC RESEARCH FOR QUANTUM COMPUTING, G4010038600, EFFICIENT AND RELIABLE MAPPING OF QUANTUM COMPUTATIONS ONTO REALISTIC ARCHITECTURES, G5372923749, Graduate Research Fellowship Program (GRFP), G7436220671, G7788518008, EFFICIENT AND RELIABLE MAPPING OF QUANTUM COMPUTATIONS ONTO REALISTIC ARCHITECTURES, G8532239345, G8729776176
OpenAlex ID: W4408220582