Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
arXiv preprint arXiv:2511.02904 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
Classical shadows provide a versatile framework for estimating many properties of quantum states from repeated, randomly chosen measurements without requiring full quantum state tomography. When prior information is available, such as knowledge of symmetries of states and operators, this knowledge can be exploited to significantly improve sample efficiency. In this work, we develop three classical shadow protocols for $\mathbb{Z}_2$ lattice gauge theory, where a dual formulation enables a rigorous analysis of resource requirements, including both circuit depth and sample complexity. Our approaches can offer exponential improvements in sample complexity over symmetry-agnostic methods, albeit at the cost of increased circuit complexity. While our analysis is restricted to $\mathbb{Z}_2$ lattice gauge theory, our approach offers a blueprint for similar protocols for more general lattice gauge theory models which are currently at the forefront of quantum simulation efforts.
citation-role summary
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.
citing papers explorer
-
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
-
Particle-preserving fermionic shadows with mode-independent sample complexity
Derives improved mode-independent sample complexity bounds O(η log η) for fermionic classical shadows on particle-preserving operators and Slater determinant overlaps.