Related papers: Quantum State Preparation for the Schwinger Model
Convergence conditions for quantum annealing are derived for optimization problems represented by the Ising model of a general form. Quantum fluctuations are introduced as a transverse field and/or transverse ferromagnetic interactions, and…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
The real time evolution of quantum field theory models can be calculated order by order in perturbation theory. For $\lambda \phi^4$ models, the perturbative series have a zero radius of convergence which in part motivated the design of…
Using a Fermi-Bose mixture of ultra-cold atoms in an optical lattice, we construct a quantum simulator for a U(1) gauge theory coupled to fermionic matter. The construction is based on quantum links which realize continuous gauge symmetry…
Future quantum computers will enable novel sign-problem-free studies of dynamical phenomena in non-perturbative quantum field theories, including real-time evolution and spontaneous supersymmetry breaking. We are investigating applications…
We present an algorithm to study mixed-state dynamics in one-dimensional quantum lattice systems. The algorithm can be used, e.g., to construct thermal states or to simulate real time evolutions given by a generic master equation. Its two…
We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits,…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
The Quantum Lattice Boltzmann Method (QLBM) is one of the most promising approaches for realizing the potential of quantum computing in simulating computational fluid dynamics. Many recent works mostly focus on classical simulation, and…
The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
A discussion is given of the quantisation of a physical system with finite degrees of freedom subject to a Hamiltonian constraint by treating time as a constrained classical variable interacting with an unconstrained quantum state. This…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
We present a comparison of different quantum state preparation algorithms and their overall efficiency for the Schwinger model with a theta term. While adiabatic state preparation (ASP) is proved to be effective, in practice it leads to…
Real-time dynamics of the Schwinger model provide an effective description of quark confinement out of equilibrium, routinely employed to model hadronization processes in particle-physics event generators. Ab-initio simulations of such…
Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been…
Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science…
In the accompanying paper of arXiv:2505.00697, we have presented a generalized scheme of adaptive quantum gradient estimation (QGE) algorithm, and further proposed two practical variants which not only achieve doubly quantum enhancement in…