Related papers: Efficient MPS algorithm for periodic boundary cond…
In the functional approach to quantum chromodynamics, the properties of hadronic bound states are accessible via covariant integral equations, e.g. the Bethe-Salpeter equations for mesons. In particular, one has to deal with linear,…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
We compute ground state fidelity of the one-dimensional Bose-Hubbard model at unit filling factor. To this aim, we apply the DMRG algorithm to systems with open and periodic boundary conditions. We find that fidelity differs significantly…
The continuous matrix product state (cMPS) ansatz is a promising numerical tool for studying quantum many-body systems in continuous space. Although it provides a clean framework that allows one to directly simulate continuous systems, the…
Using an NMR quantum computer, we experimentally simulate the quantum phase transition of a Heisenberg spin chain. The Hamiltonian is generated by a multiple pulse sequence, the nuclear spin system is prepared in its (pseudo-pure) ground…
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…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
Under suitable assumptions, the quantum phase estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground state energy. However, QPE requires a large number of ancilla qubits and large circuit…
Many fractional quantum Hall states can be expressed as a correlator of a given conformal field theory used to describe their edge physics. As a consequence, these states admit an economical representation as an exact Matrix Product States…
Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We…
The Fermi-Hubbard model is of fundamental importance in condensed-matter physics, yet is extremely challenging to solve numerically. Finding the ground state of the Hubbard model using variational methods has been predicted to be one of the…
We calculate the electron paramagnetic resonance (EPR) spectra of the antiferromagnetic spin-1 chain compound Y(2)BaNi(1-x)Mg(x)O(5) for different values of x and temperature T much lower than the Haldane gap (~100K). The low-energy…
Using the density matrix formalism, we prove an existence theorem of the periodic steady-state for an arbitrary periodically-driven system. This state has the same period as the modulated external influence, and it is realized as an…
Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians.…
We present a new theoretical approach for the study of the phase diagram of interacting quantum particles: bosons, fermions or spins. In the neighborhood of a phase transition, the expected renormalization group structure is recovered both…
We present a new subspace iteration method for computing low-lying eigenpairs (excited states) of high-dimensional quantum many-body Hamiltonians with nearest neighbor interactions on two-dimensional lattices. The method is based on a new…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
An efficient numerical method is developed using the matrix product formalism for computing the properties at finite energy densities in one-dimensional (1D) many-body localized (MBL) systems. Arguing that any efficient (possibly quantum)…
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…