Related papers: Matrix Product States for Quantum Many-Fermion Sys…
While general quantum many-body systems require exponential resources to be simulated on a classical computer, systems of non-interacting fermions can be simulated exactly using polynomially scaling resources. Such systems may be of…
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time…
Understanding extreme non-locality in many-body quantum systems can help resolve questions in thermostatistics and laser physics. The existence of symmetry selection rules for Hamiltonians with non-decaying terms on infinite-size lattices…
We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the performance of a tensor network algorithm that…
Quantum algorithms for estimating the ground state energy of a quantum system often operate by preparing a classically accessible quantum state and then applying quantum phase estimation. Whether this approach yields quantum advantage…
We present a simple and stable numerical method to approximate the ground state of a quantum many-body system by multiple determinant states. This method searches these determinant states one by one according to the matching pursuit…
We show the feasibility of tensor network solutions for lattice gauge theories in Hamiltonian formulation by applying matrix product states algorithms to the Schwinger model with zero and non-vanishing fermion mass. We introduce new…
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS) and the algorithms thereof. The method is quite versatile and can be…
We propose a new quantum computational way of obtaining a ground-state energy and expectation values of observables of interacting Hamiltonians. It is based on the combination of the adiabatic quantum evolution to project a ground state of…
Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems,…
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 describe and discuss a recently proposed quantum Monte Carlo algorithm to compute the ground-state properties of various systems of interacting fermions. In this method, the ground state is projected from an initial wave function by a…
Determining ground state energies of quantum systems by hybrid classical/quantum methods has emerged as a promising candidate application for near-term quantum computational resources. Short of large-scale fault-tolerant quantum computers,…
Solving quantum many-body systems is one of the most significant regimes where quantum computing applies. Currently, as a hardware-friendly computational paradigms, variational algorithms are often used for finding the ground energy of…
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…
This work gives a detailed investigation of matrix product state (MPS) representations for pure multipartite quantum states. We determine the freedom in representations with and without translation symmetry, derive respective canonical…
We present a quantum algorithm for simulating complex many-body systems and finding their ground states, combining the use of tensor networks and density matrix renormalization group (DMRG) techniques. The algorithm is based on von…
We consider two-component fermions on the lattice in the unitarity limit. This is an idealized limit of attractive fermions where the range of the interaction is zero and the scattering length is infinite. Using Euclidean time projection,…
We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem…
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…