Efficiently verifiable quantum advantage on near-term analog quantum simulators
<|reference_start|>Efficiently verifiable quantum advantage on near-term analog quantum simulators: 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 prover need only prepare $O(1)$ samples of a history state and perform $O(\lambda^2)$ single-qubit measurements, for a security parameter $\lambda$. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.<|reference_end|>
@article{liu2024efficiently,
    title={Efficiently verifiable quantum advantage on near-term analog quantum
  simulators},
    author={Zhenning Liu, Dhruv Devulapalli, Dominik Hangleiter, Yi-Kai Liu,
  Alicia J. Koll'ar, Alexey V. Gorshkov, Andrew M. Childs},
    journal={arXiv preprint arXiv:2403.08195},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.08195},
    primaryClass={quant-ph cs.CC}
}