Related papers: A polynomial-time algorithm for the ground state o…
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…
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…
In 2011, the fundamental gap conjecture for Schr\"odinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schr\"odinger equation with a convex potential and relative error \epsilon.…
We present an operational procedure to transform global symmetries into local symmetries at the level of individual quantum states, as opposed to typical gauging prescriptions for Hamiltonians or Lagrangians. We then construct a compatible…
Models whose ground states can be written as an exact matrix product state (MPS) provide valuable insights into phases of matter. While MPS-solvable models are typically studied as isolated points in a phase diagram, they can belong to a…
We show that the Guided Local Hamiltonian problem for stoquastic Hamiltonians is (promise) BPP-hard. The Guided Local Hamiltonian problem extends the Local Hamiltonian problem by incorporating an additional input known as a guiding state,…
Predicting properties across system parameters is an important task in quantum physics, with applications ranging from molecular dynamics to variational quantum algorithms. Recently, provably efficient algorithms to solve this task for…
Tensor network states, and in particular Projected Entangled Pair States (PEPS) have been a strong ansatz for the variational study of complicated quantum many-body systems, thanks to their built-in entanglement entropy area law. In this…
We examine whether it is possible for one-dimensional translationally-invariant Hamiltonians to have ground states with a high degree of entanglement. We present a family of translationally invariant Hamiltonians {H_n} for the infinite…
In this paper the local iterative Lie-Schwinger block-diagonalization method, introduced in [FP], [DFPR1], and [DFPR2] for quantum chains, is extended to higher-dimensional quantum lattice systems with Hamiltonians that can be written as…
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv)…
A general algorithm has been given for the generation of Coherent and Squeezed states, in one-dimensional hamiltonians with shape invariant potential, obtained from the master function. The minimum uncertainty states of these potentials are…
This article investigates the stability of the ground state subspace of a canonical parent Hamiltonian of a Matrix product state against local perturbations. We prove that the spectral gap of such a Hamiltonian remains stable under weak…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently,…
We provide an exact analysis of a class of randomized algorithms for solving overdetermined least-squares problems. We consider first-order methods, where the gradients are pre-conditioned by an approximation of the Hessian, based on a…
We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body…
Reconstructing a system Hamiltonian through measurements on its eigenstates is an important inverse problem in quantum physics. Recently, it was shown that generic many-body local Hamiltonians can be recovered by local measurements without…
We present a general graph-based Projected Entangled-Pair State (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural-matrix which…