Related papers: Sample-Based Krylov Quantum Diagonalization for th…
In this chapter, we demonstrate how real-time quantum Krylov subspace methods can be adapted to investigate open quantum systems described by the Lindblad formalism. We apply these methods to a two-photon-driven superconducting Kerr…
In recent years, arrays of atomic ions in a linear RF trap have proven to be a particularly successful platform for quantum simulation. However, a wide range of quantum models and phenomena have, so far, remained beyond the reach of such…
The vacuum of the lattice Schwinger model is prepared on up to 100 qubits of IBM's Eagle-processor quantum computers. A new algorithm to prepare the ground state of a gapped translationally-invariant system on a quantum computer is…
We discuss how a lattice Schwinger model can be realized in a linear ion trap, allowing a detailed study of the physics of Abelian lattice gauge theories related to one-dimensional quantum electrodynamics. Relying on the rich…
It is crucial to reduce the resources required to run quantum algorithms and simulate physical systems on quantum computers due to coherence time limitations. With regards to Hamiltonian simulation, a significant effort has focused on…
Correlated systems with hexagonal layered structures have come to fore with renewed interest in Cobaltates, transition-metal dichalcogenides and GdI2. While superconductivity, unusual metal and possible exotic states (prevented from long…
We present simulations of non-equilibrium dynamics of quantum field theories on digital quantum computers. As a representative example, we consider the Schwinger model, a 1+1 dimensional U(1) gauge theory, coupled through a Yukawa-type…
Gauge theories establish the standard model of particle physics, and lattice gauge theory (LGT) calculations employing Markov Chain Monte Carlo (MCMC) methods have been pivotal in our understanding of fundamental interactions. The present…
The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress…
Quantum simulations of quantum chromodynamics (QCD) require a representation of gauge fields and fermions on the finitely many degrees of freedom available on a quantum computer. We introduce a truncation of lattice QCD coupled to staggered…
An approximate analytical scheme of the dynamical mean field theory (DMFT) is developed for the description of the electron (ion) lattice systems with Hubbard correlations within the asymmetric Hubbard model where the chemical potentials…
This work provides a nonasymptotic error analysis of quantum Krylov algorithms based on real-time evolutions, subject to generic errors in the outputs of the quantum circuits. We prove upper and lower bounds on the resulting ground state…
Quantum field theory in the presence of strong background fields contains interesting problems where quantum computers may someday provide a valuable computational resource. In the NISQ era it is useful to consider simpler benchmark…
We study the quantum metric tensor and its scalar curvature for a particular version of the Lipkin-Meshkov-Glick model. We build the classical Hamiltonian using Bloch coherent states and find its stationary points. They exhibit the presence…
The Schwinger model, which describes lattice quantum electrodynamics in $1+1$ space-time dimensions, provides a valuable framework to investigate fundamental aspects of quantum field theory, and a stepping stone towards non-Abelian gauge…
Understanding the equilibrium properties and out of equilibrium dynamics of quantum field theories are key aspects of fundamental problems in theoretical particle physics and cosmology. However, their classical simulation is highly…
Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic…
Quantum subspace diagonalization and quantum Krylov algorithms offer a feasible, pre- or early-fault tolerant alternative to quantum phase estimation for using quantum computers to estimate the low-lying spectra of quantum systems. However,…
One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine…
We propose an algorithm to obtain Green's functions as a continued fraction on quantum computers, which is based on the construction of the Krylov basis using variational quantum algorithms, and included in a Lanczos iterative scheme. This…