In this thesis, we begin by reviewing some of the most important Hamiltonian simulation algorithms that are applied in simulation of quantum field theories. Then we focus on state preparation which has been the slowest subroutine in previously known algorithms. We present two distinct methods that improve upon prior results. The first method utilizes classical computational tools such as Density Matrix Renormalization Group to produce an efficient quantum algorithm for simulating fermionic quantum field theories in 1+1 dimensions. The second method presented is a heuristic algorithm that can prepare the vacuum of fermionic systems in more general cases and more efficiently than previous methods. With our last method, state preparation is no longer the bottleneck, as its runtime has the same asymptotic scaling with the desired precision as the remainder of the simulation algorithm. We then numerically demonstrate the effectiveness of this last method for the 1+1 dimensional Gross-Neveu model.
In this thesis, we begin by reviewing some of the most important Hamiltonian simulation algorithms that are applied in simulation of quantum field theories. Then we focus on state preparation which has been the slowest subroutine in previously known algorithms. We present two distinct methods that improve upon prior results. The first method utilizes classical computational tools such as Density Matrix Renormalization Group to produce an efficient quantum algorithm for simulating fermionic quantum field theories in 1+1 dimensions. The second method presented is a heuristic algorithm that can prepare the vacuum of fermionic systems in more general cases and more efficiently than previous methods. With our last method, state preparation is no longer the bottleneck, as its runtime has the same asymptotic scaling with the desired precision as the remainder of the simulation algorithm. We then numerically demonstrate the effectiveness of this last method for the 1+1 dimensional Gross-Neveu model.
Answering whether quantum computers can efficiently simulate quantum field theories has both theoretical and practical motivation. From the theoretical point of view, it answers the question of whether a hypothetical computer that utilizes quantum field theory would be more powerful than other quantum computers. From the practical point of view, when reliable quantum computers are eventually built, these algorithms can help us better understand the underlying physics that govern our world. In the best known quantum algorithms for simulating quantum field theories, the time scaling is dominated by initial state preparation. In this paper, we exclusively focus on state preparation and present a heuristic algorithm that can prepare the vacuum of fermionic systems in more general cases and more efficiently than previous methods. With our method, state preparation is no longer the bottleneck, as its runtime has the same asymptotic scaling with the desired precision as the remainder of the simulation algorithm. We numerically demonstrate the effectiveness of our proposed method for the 1+1 dimensional Gross-Neveu model.
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present an algorithm for preparing particle states to use in simulation of fermionic quantum field theory (QFT) on a quantum computer, which is based on the matrix product state ansatz. We apply this to the massive Gross-Neveu model in one spatial dimension to illustrate the algorithm, but we believe the same algorithm with slight modifications can be used to simulate any one-dimensional massive fermionic QFT. In the case where the number of particle species is 1, our algorithm can prepare particle states using $O\left({\ensuremath{\epsilon}}^{\ensuremath{-}3.23...}\right)$ gates, which is much faster than previous known results, namely, $O\left({\ensuremath{\epsilon}}^{\ensuremath{-}8\ensuremath{-}o\left(1\right)}\right)$. Furthermore, unlike previous methods which were based on adiabatic state preparation, the method given here should be able to simulate quantum phases unconnected to the free theory.
Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions with quartic interactions. The algorithm introduces new techniques to meet the additional challenges posed by the characteristics of fermionic fields, and its run time is polynomial in the desired precision and the energy. Thus, it constitutes further progress towards an efficient quantum algorithm for simulating the Standard Model of particle physics.
In this thesis, the numerical simulation of strongly-interacting many-body quantum-mechanical systems using matrix product states (MPS) is considered. Compared to classical systems, quantum many-body systems possess an exponentially enlarged number of degrees of freedom, significantly complicating a simulation on a classical computer. Matrix-Product-States are a novel representation of arbitrary quantum many-body states. Using quantum information theory, it is possible to show that Matrix-Product-States provide a polynomial-sized representation of one-dimensional quantum systems, thus allowing an efficient simulation of one-dimensional quantum system on classical computers. Matrix-Product-States form the conceptual framework of the density-matrix renormalization group (DMRG). Based upon this connection, deeper understanding of the density matrix renormalization group can be obtained. After a general introduction in the first chapter of this thesis, the second chapter deals with Matrix-Product-States, focusing on the development of fast and stable algorithms. It is possible to extend the Matrix-Product-States approach to be able to represent arbitrary operators, the so-called Matrix-Product-Operators, which allows a fast and flexible calculation of arbitrary expectation values. To obtain algorithms to efficiently calculate groundstates, the density-matrix renormalization group is reformulated using the Matrix-Product-States framework. Further, time-dependent problems are considered. Two different algorithms are presented, one based on a Trotter decomposition of the time-evolution operator, the other one on Krylov subspaces. Finally, the evaluation of dynamical spectral functions is discussed, and a correction vector-based method is presented. In the following chapters, the methods presented in the second chapter, are applied to a number of different physical problems. The third chapter deals with the existence of chiral phases in isotropic one-dimensional quantum spin systems. A preceding analytical study based on a mean-field approach indicated the possible existence of those phases in an isotopic Heisenberg model with a frustrating zig-zag interaction and a magnetic field. In this thesis, the existence of the chiral phases will be shown numerically by using Matrix-Product-States-based algorithms. A key effect of interacting one-dimensional quantum-mechanical many-body systems is the spin-charge separation. However, up to now only signs of the spin-charge separation have been observed in experiments. In the fourth chapter, we propose an experiment using ultracold atomic gases in optical lattices, which allows a well controlled observation of the spin-charge separation (of different hyperfine states of the ultracold atoms) with current state of the art experimental techniques. Ultracold atoms in optical lattices are well described by (Bose)-Hubbard models. In order to support this proposal, we present numerical results for realistic system parameters. Matrix-Product-States are an excellent tool for the simulation of one-dimensional quantum systems, however, they are not well suited for the simulation of higher dimensional systems. For strongly-correlated systems, for instance cuprates-based high-temperature superconductors, quantum fluctuations play an essential role. Classical mean-field theories neglect any kind of fluctuations, thus they are not suitable to describe strongly-correlated systems. The dynamical mean-field theory (DMFT) fully takes local quantum fluctuations into account but neglects any kind of spatial fluctuations. The many-body problem on the lattice is mapped onto an impurity problem, which needs to be solved self-consistently. In the last chapter of this thesis, Matrix-Product-States-based algorithms are used to solve the impurity problem of the dynamical mean-field theory. We present results for a Hubbard model on a one-dimensional lattice and on a Bethe lattice obtained by the dynamical mean-field and compare them with exact results.
Quantum computing offers a paradigm shift in efficiently simulating quantum field theories (QFTs). In this review, we outline two new techniques for the simulation of QFTs on quantum devices. The first technique employs Hamiltonian Truncation (HT) for nonperturbative real-time QFT simulations on Noisy Intermediate-Scale Quantum (NISQ) devices. As a use case, we apply the HT approach to the Schwinger model. For the observables studied, HT avoids complex state preparation, reducing circuit depth and making the algorithm well suited for NISQ devices. Validated on the ibm_brisbane quantum computer with results showing good agreement with numerical simulations, HT presents an efficient alternative to lattice models. The second approach introduces a continuous-variable quantum computing (CVQC) framework for simulating the real-time dynamics of QFTs, where quantum field values are encoded directly into photonic qumodes. By avoiding the overhead of field digitization, CVQC enables scalable simulations using significantly fewer quantum resources than traditional qubit-based approaches. Classical emulation of the qumode lattice successfully reproduces scattering processes in [Formula: see text]-dimensional [Formula: see text] theory. Together, these methods demonstrate viable paths toward near-term quantum simulations of interacting field theories, offering complementary strategies to address challenges in nonperturbative studies in high-energy physics.
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, Nf, discretized on a spatial one-dimensional lattice of size L 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 Nf and L. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with Nf=1,2,3,4 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 class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large Nf fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.