The Utility of Sparse Error Detection in Quantum Simulations
Abstract
The recent success of error detecting codes points toward their potential application to fault-tolerant simulations of nature. In this work, we examine the utility of sparse error detection for simulating lattice gauge theories using quantum computers. In particular, we study the time evolution of the lattice Schwinger model embedded into the Iceberg code family, , as well as the Hypercube code family, . The lattice of electrons and positrons in the axial gauge is embedded into a single code block or into multiple code blocks, and this work finds that large codeblocks are advantageous in the absence of connectivity constraints. Noisy classical simulations with realistic near-term error rates, infrequent syndrome measurements and physics-aware postselection are found to improve observable estimation. Under realistic noise rates for near-term quantum computers, this work finds that sparse error detection in quantum simulations has the potential to improve accuracy of observable estimation. Additional rounds of error detection are found to systematically drive errors in observables to the noise floor set by the code. These findings suggest that incorporating minimal implementations of fault tolerance in the near-term will enhance the performance of quantum simulations in nuclear physics and high-energy physics.
Cite
@article{arxiv.2608.02944,
title = {The Utility of Sparse Error Detection in Quantum Simulations},
author = {Henry Froland and Dorota M. Grabowska and Sebastian Grieninger and Jeremy Hartse and Anne L. Lashbrook and Zhiyao Li and Ziyuan Li and Sarah J. M. Powell and Martin J. Savage and Xiaojun Yao and Nikita A. Zemlevskiy},
journal= {arXiv preprint arXiv:2608.02944},
year = {2026}
}
Comments
32 pages, 37 figures, 4 tables, comments welcome