Related papers: Local Hamiltonian Problem with succinct ground sta…
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…
A method is presented in which the ground-state subspace is projected out of a Hamiltonian representation. As a result of this projection, an effective Hamiltonian is constructed where its ground-state coincides with an excited-state of the…
Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A natural question is whether we should expect to efficiently…
One of the central challenges in the study of quantum many-body systems is the complexity of simulating them on a classical computer. A recent advance of Landau et al. gave a polynomial time algorithm to actually compute a succinct…
In this paper, we investigate a system of quantum electrodynamics with cutoffs. The total Hamiltonian is defined on a tensor product of a fermion Fock space and a boson Fock. It is shown that, under spatially localized conditions and…
A family of quantum Hamiltonians is said to be universal if any other finite-dimensional Hamiltonian can be approximately encoded within the low-energy space of a Hamiltonian from that family. If the encoding is efficient, universal…
QMA and QCMA are possible quantum analogues of the complexity class NP. In QCMA the verifier is a quantum program and the proof is classical. In contrast, in QMA the proof is also a quantum state. We show that two known QMA-complete…
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be…
Despite progress in quantum Hamiltonian complexity, little is known about the computational complexity of quantum physics at the thermodynamic limit. Even defining the problem is not straight forward. We study the complexity of estimating…
We propose a framework to design concurrently a frustration-free quantum many-body Hamiltonian and its numerically exact ground states on a sufficiently large finite-size cluster in one and two dimensions using an elementary matrix product…
A broad range of quantum optimisation problems can be phrased as the question whether a specific system has a ground state at zero energy, i.e.\ whether its Hamiltonian is frustration free. Frustration-free Hamiltonians, in turn, play a…
The area law for entanglement entropy fundamentally reflects the complexity of quantum many-body systems, demonstrating ground states of local Hamiltonians to be represented with low computational complexity. While this principle is…
We study the question of what kind of a macroscopic superposition can(not) naturally exist as a ground state of some gapped local many-body Hamiltonian. We derive an upper bound on the energy gap of an arbitrary physical Hamiltonian…
Strongly interacting quantum systems described by non-stoquastic Hamiltonians exhibit rich low-temperature physics. Yet, their study poses a formidable challenge, even for state-of-the-art numerical techniques. Here, we investigate…
The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph. The particles can move between adjacent vertices and experience a repulsive on-site interaction. The Hamiltonian is determined by a choice of…
By using a recently proposed probabilistic approach, we determine the exact ground state of a class of matrix Hamiltonian models characterized by the fact that in the thermodynamic limit the multiplicities of the potential values assumed by…
We prove that every injective Matrix Product State is the unique ground state of a simple hopping theory. We start by studying the low energy spectrum of parent Hamiltonians of injective Matrix Product States in a particular long range and…
One of the main challenges in the field of quantum simulation and computation is to identify ways to certify the correct functioning of a device when a classical efficient simulation is not available. Important cases are situations in which…
We introduce reinforcement learning (RL) formulations of the problem of finding the ground state of a many-body quantum mechanical model defined on a lattice. We show that stoquastic Hamiltonians - those without a sign problem - have a…
Knowledge of the ground state of a homogeneous quantum many-body system can be used to find the exact ground state of a dual inhomogeneous system with a confining potential. For the complete family of parent Hamiltonians with a ground state…