Related papers: Complexity of Supersymmetric Systems and the Cohom…
We show that the two-dimensional (2D) local Hamiltonian problem with the constraint that the ground state obeys area laws is QMA-complete. We also prove similar results in 2D translation-invariant systems and for the 3D Heisenberg and…
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 build exactly solvable lattice Hamiltonians for fermionic symmetry-protected topological (SPT) phases in (3+1)D classified by group supercohomology. A central benefit of our construction is that it produces an explicit finite-depth…
Supersymmetry, originally proposed in particle physics, refers to a dual relation that connects fermionic and bosonic degrees of freedom in a system. Recently, there has been considerable interest in applying the idea of supersymmetry to…
In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a…
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…
Simulating quantum many-body systems represents a fundamental challenge where classical machine learning methods are severely bottlenecked by the exponential curse of dimensionality. Variational Quantum Algorithms (VQAs) offer a native…
An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class P^QMA[log], and motivated its study by showing that the physical…
For families of Hamiltonians defined by parts that are local, the most general definition of a symmetry algebra is the commutant algebra, i.e., the algebra of operators that commute with each local part. Thinking about symmetry algebras as…
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of Hamming weight $k$. The Hamming weight…
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…
We consider the simplest nontrivial supersymmetric quantum mechanical system involving higher derivatives. We unravel the existence of additional bosonic and fermionic integrals of motion forming a nontrivial algebra. This allows one to…
It is widely recognized that the main difficulty in designing devices which could process information using quantum states is due to the decoherence of local excitations about a ground state. A solution to this problem was suggested in…
Within quantum mechanics which works with parity-pseudo-Hermitian Hamiltonians we study the tunneling in a symmetric double well formed by two delta functions with complex conjugate strengths. The model is exactly solvable and exhibits…
We study the complexity of finding the ground state energy density of a local Hamiltonian on a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a function problem, in which we request an estimate…
We construct a supersymmetric quantum mechanical model in which the energy eigenvalues of the Hamiltonians are the products of Riemann zeta functions. We show that the trivial and nontrivial zeros of the Riemann zeta function naturally…
We prove that generic quantum local Hamiltonians are gapless. In fact, we prove that there is a continuous density of states above the ground state. The Hamiltonian can be on a lattice in any spatial dimension or on a graph with a bounded…
A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above…
We introduce the concept of "quantum geometric nesting'' (QGN) to characterize the idealized ordering tendencies of certain flat-band systems implicit in the geometric structure of the flat-band subspace. Perfect QGN implies the existence…
Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible matchgate circuits, we identify a class of quadratic…