Pith. sign in

REVIEW 1 cited by

Faster Digital Quantum Simulation by Symmetry Protection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.16248 v2 pith:VC2MK3K5 submitted 2020-06-29 quant-ph

Faster Digital Quantum Simulation by Symmetry Protection

classification quant-ph
keywords quantumsimulationsymmetryerrorprotectiontechniquealgorithmerrors
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Simulating the dynamics of quantum systems is an important application of quantum computers and has seen a variety of implementations on current hardware. We show that by introducing quantum gates implementing unitary transformations generated by the symmetries of the system, one can induce destructive interference between the errors from different steps of the simulation, effectively giving faster quantum simulation by symmetry protection. We derive rigorous bounds on the error of a symmetry-protected simulation algorithm and identify conditions for optimal symmetry protection. In particular, when the symmetry transformations are chosen as powers of a unitary, the error of the algorithm is approximately projected to the so-called quantum Zeno subspaces. We prove a bound on this approximation error, exponentially improving a recent result of Burgarth, Facchi, Gramegna, and Pascazio. We apply the symmetry protection technique to the simulations of the XXZ Heisenberg interactions with local disorder and the Schwinger model in quantum field theory. For both systems, the technique can reduce the simulation error by several orders of magnitude over the unprotected simulation. Finally, we provide numerical evidence suggesting that the technique can also protect simulation against other types of coherent, temporally correlated errors, such as the $1/f$ noise commonly found in solid-state experiments.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimal Lower Bounds for Hamiltonian Simulation

    quant-ph 2026-07 conditional novelty 7.0

    There exist simple weighted-local Hamiltonians for which quantum simulation requires Ω(min over K of (Kt + t²λ_K²/ε)) gates — exactly matching the composite qDRIFT algorithm's cost.