Related papers: Fermion determinants on a quantum computer
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum…
When lattice QCD is formulated in sectors of fixed quark numbers, the canonical fermion determinants can be expressed explicitly in terms of transfer matrices. This in turn provides a complete factorization of the fermion determinants in…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
Ab-initio Monte Carlo simulations of strongly-interacting fermionic systems are plagued by the fermion sign problem, making the non-perturbative study of many interesting regimes of dense quantum matter, or of theories of odd numbers of…
We discuss a method for regularizing chiral gauge theories. The idea is to formulate the gauge fields on the lattice, while the fermion determinant is regularized and computed in the continuum. A simple effective action emerges which lends…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as…
The chiral Schwinger model is formulated in the wilson-fermion formulation on the lattice and then simulated by the complex langevin algorithm. The simulation is done both without and with gauge fixing to the Lorentz gauge for the compact…
Given an efficient and systematic method for generating input sets for free fermionic heterotic model building we consider what the realistic bounds are for a statistical analysis of the free fermionic Landscape with a classical computer.…
We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…
We study the Z3 gauge theory with fermions on the quantum computer using the Variational Quantum Eigensolver (VQE) algorithm with IBM QISKit software. Using up to 9 qubits we are able to obtain accurate results for the ground state energy.…
Quantum signal processing allows for quantum eigenvalue transformation with Hermitian matrices, in which each eigenspace component of an input vector gets transformed according to its eigenvalue. In this work, we introduce the multivariate…
Quantum generative learning is a promising application of quantum computers, but faces several trainability challenges, including the difficulty in experimental gradient estimations. For certain structured quantum generative models,…
Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit…
Presented is a quantum computing model of a quantum field theory for a system of fermions interacting via a massive gauge field. The model describes a relativistic superconducting fluid and uses a metric tensor field to both encode the…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
Lattice QCD calculations have been conducted using large-scale classical computers based on the Lagrangian formalism of field theory for the past 40 years. On the other hand, the advent of quantum computers has brought increasing attention…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…