Related papers: Efficient MPS algorithm for periodic boundary cond…
We develop holographic quantum simulation techniques to prepare correlated electronic ground states in quantum matrix product state (qMPS) form, using far fewer qubits than the number of orbitals represented. Our approach starts with a…
The interplay of quantum and classical simulation and the delicate divide between them is in the focus of massively parallelized tensor network state (TNS) algorithms designed for high performance computing (HPC). In this contribution, we…
Non-Hermitian systems exhibiting topological properties are attracting growing interest. In this work, we propose an algorithm for solving the ground state of a non-Hermitian system in the matrix product state (MPS) formalism based on a…
We investigate the persistence of spectral gaps of one-dimensional frustration free quantum lattice systems under weak perturbations and with open boundary conditions. Assuming the interactions of the system satisfy a form of local…
We investigate the efficiency of the recently proposed Restricted Boltzmann Machine (RBM) representation of quantum many-body states to study both the static properties and quantum spin dynamics in the two-dimensional Heisenberg model on a…
An algorithm is presented which computes a translationally invariant matrix product state approximation of the ground state of an infinite 1D system; it does this by embedding sites into an approximation of the infinite ``environment'' of…
Quantum-mechanical correlations of interacting fermions result in the emergence of exotic phases. Magnetic phases naturally arise in the Mott-insulator regime of the Fermi-Hubbard model, where charges are localized and the spin degree of…
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…
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…
Understanding the excitation spectrum in two-dimensional quantum many-body systems has long been a challenging task. We present an approach by introducing an excitation ansatz based on an infinite matrix product state (MPS) on a helix…
Dysprosium atoms have proven to be a promising platform for quantum simulation due to their strong magnetic moment and high tunability of interactions. In this work, we propose Dysprosium atoms for simulating the one-dimensional spin-1…
Quantum lattice models with large local Hilbert spaces emerge across various fields in quantum many-body physics. Problems such as the interplay between fermions and phonons, the BCS-BEC crossover of interacting bosons, or decoherence in…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
Quantum many-body scarred systems host nonthermal excited eigenstates immersed in a sea of thermal ones. In cases where exact expressions for these special eigenstates are not known, it is computationally demanding to distinguish them from…
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network…
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial…
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…
The Rodeo Algorithm is a quantum computing method for computing the energy spectrum of a Hamiltonian and preparing its energy eigenstates. We discuss how to improve the performance of the rodeo algorithm for each of these two applications.…
We propose a new quantum Monte Carlo algorithm to compute fermion ground-state properties. The ground state is projected from an initial wavefunction by a branching random walk in an over-complete basis space of Slater determinants. By…
In this paper, we consider the task of efficiently computing the numerical solution of evolutionary complex Ginzburg--Landau equations on Cartesian product domains with homogeneous Dirichlet/Neumann or periodic boundary conditions. To this…