Related papers: On the exact continuous mapping of fermions
We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…
The algebraic structure of the 1D Hubbard model is studied by means of the fermionic R-operator approach. This approach treats the fermion models directly in the framework of the quantum inverse scattering method. Compared with the graded…
We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins),…
For systems described by finite matrices, an affine form is developed for the maps that describe evolution of density matrices for a quantum system that interacts with another. This is established directly from the Heisenberg picture. It…
We present a method to compute the Fermi function of the Hamiltonian for a system of independent fermions, based on an exact decomposition of the grand-canonical potential. This scheme does not rely on the localization of the orbitals and…
In contrast to the determinant, no algorithm is known for the exact determination of the permanent of a square matrix that runs in time polynomial in its dimension. Consequently, non interacting fermions are classically efficiently…
Exact unitary transformations play a central role in the analysis and simulation of many-body quantum systems, yet the conditions under which they can be carried out exactly and efficiently remain incompletely understood. We show that exact…
We explicitly construct an integrable and strongly interacting dissipative quantum circuit via a trotterization of the Hubbard model with imaginary interaction strength. To prove integrability, we build an inhomogeneous transfer matrix,…
We provide physics-inspired derivations of a number of algorithms for computing the permanent of a matrix. In particular we formulate the computation of the permanent as a Grassmann integral that may be viewed as an interacting many-fermion…
Simulation of fermionic systems is one of the most promising applications of quantum computers. It spans problems in quantum chemistry, high-energy physics and condensed matter. Underpinning the core steps of any quantum simulation…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
We propose a numerically exact method for a mixture with a single impurity immersed in several majority fermions, confined in a harmonic potential. We separate one of the degrees of freedom through an appropriately tailored canonical…
Compact representations of fermionic Hamiltonians are necessary to perform calculations on quantum computers that lack error-correction. A fermionic system is typically defined within a subspace of fixed particle number and spin while…
We acquire a method of constructing an infinite set of exact eigenfunctions of 1--d interacting spinless Fermionic systems. Creation and annihilation operators for the interacting system are found and thereby the many--body Hamiltonian is…
We consider the behavior of Fermi atoms on optical superlattices with two-well structure of each node. Fermions on such lattices serve as an analog simulator of Fermi type Hamiltonian. We derive a mapping between fermion quantum ordering in…
Fermionic Gaussian states are eigenstates of quadratic Hamiltonians and are widely used in quantum many-body problems. We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be…
We study the entanglement Hamiltonian for finite intervals in infinite quantum chains for two different free-particle systems: coupled harmonic oscillators and fermionic hopping models with dimerization. Working in the ground state, the…
Mappings between fermions and qubits are valuable constructions in physics. To date only a handful exist. In addition to revealing dualities between fermionic and spin systems, such mappings are indispensable in any quantum simulation of…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian…