Simulating scalar field theories on quantum computers with limited resources
Andy C. Y. Li, Alexandru Macridin, Stephen Mrenna, Panagiotis, Spentzouris

TL;DR
This paper introduces a quantum algorithm for simulating $$^4$ scalar field theories on qubit computers, enabling efficient state preparation in both symmetric and broken phases with resource scaling proportional to lattice size.
Contribution
It presents a novel quantum algorithm combining variational and adiabatic methods for efficient $$^4$ state preparation, including techniques to handle phase transition degeneracies.
Findings
Efficient $$^4$ state preparation over a range of parameters.
Optimization of adiabatic evolution reduces time complexity.
Method to address broken-symmetry degeneracy using external fields.
Abstract
We present a quantum algorithm for implementing lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the implementation of the evolution operator is proportional to the lattice size. The algorithm allows efficient state preparation for a large range of input parameters in both the normal and broken-symmetry phases. The states are prepared using a combination of variational and adiabatic evolution methods. First, the ground state of a local Hamiltonian, which includes the self-interaction, is prepared using short variational circuits. Next, this state is evolved by switching on the coupling between the lattice sites adiabatically. The parameters defining the local Hamiltonian are adjustable and constitute the input of our algorithm. We present a…
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.
