REVIEW 2 cited by
Solving Gauss's Law on Digital Quantum Computers with Loop-String-Hadron Digitization
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
abstract
We show that using the loop-string-hadron (LSH) formulation of SU(2) lattice gauge theory (arXiv:1912.06133) as a basis for digital quantum computation easily solves an important problem of fundamental interest: implementing gauge invariance (or Gauss's law) exactly. We first discuss the structure of the LSH Hilbert space in $d$ spatial dimensions, its truncation, and its digitization with qubits. Error detection and mitigation in gauge theory simulations would benefit from physicality "oracles,'"so we decompose circuits that flag gauge invariant wavefunctions. We then analyze the logical qubit costs and entangling gate counts involved with the protocols. The LSH basis could save or cost more qubits than a Kogut-Susskind-type representation basis, depending on how the bases are digitized as well as the spatial dimension. The numerous other clear benefits encourage future studies into applying this framework.
Forward citations
Cited by 2 Pith papers
-
Creation of Wave Packets for Quantum Chromodynamics on Quantum Computers
A quantum algorithm based on Haag-Ruelle theory and LCU proposes to prepare hadron wave packets from the vacuum in 3D lattice QCD, with a success probability that shrinks polynomially with lattice spacing, energy, and...
-
Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory
Gauss's law constraints in Z2 lattice gauge theory can be made into quantum error-correcting codes of arbitrary distance, with provably optimal encoding rate within the constructed family.
Discussion (0). Continue with ORCID to comment.