REVIEW 1 cited by
Gauge invariant quantum circuits for $U(1)$ and Yang-Mills lattice gauge theories
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
Signed reviews
read the original abstract
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only polynomially increasing resources, a major openissue concerns the violation of gauge-invariance during the dynamics and the search for groundstates. Here, we propose a new class of parametrized quantum circuits that can represent states belonging only to the physical sector of the total Hilbert space. This class of circuits is compact yet flexible enough to be used as a variational ansatz to study ground state properties, as well as representing states originating from a real-time dynamics. Concerning the first application, the structure of the wavefunction ansatz guarantees the preservation of physical constraints such as the Gauss law along the entire optimization process, enabling reliable variational calculations. As for the second application, this class of quantum circuits can be used in combination with timedependent variational quantum algorithms, thus drastically reducing the resource requirements to access dynamical properties.
Forward citations
Cited by 1 Pith paper
-
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.