Efficiently verifiable quantum advantage on near-term analog quantum simulators
arXiv preprint arXiv:2403.08195, 2024•arxiv.org
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 (\lambda^ 2) $-time classical computation, and the …
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 (\lambda^ 2) $-time classical computation, and the …
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 -time classical computation, and the prover need only prepare samples of a history state and perform single-qubit measurements, for a security parameter . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.
arxiv.org