Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
Bojko N. Bakalov, Joao C. Getelina, Raghav G. Jha, Alexander F. Kemper, Yuan Liu

TL;DR
This paper advances quantum simulation techniques for fermionic quantum field theories, specifically the massive Thirring and Gross--Neveu models, by analyzing gate complexity, state preparation, and algebraic structures for various system sizes and flavors.
Contribution
It introduces methods for simulating these models on quantum computers, including ground state preparation and algebra classification, for arbitrary flavors and system sizes.
Findings
Gate complexity computed using product formula and qubitization methods.
Ground states prepared with high fidelity for systems up to 20 qubits.
Classified the dynamical Lie algebras, showing they belong to the same isomorphism class.
Abstract
The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, , discretized on a spatial one-dimensional lattice of size in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large and . We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
