Related papers: Strongly Universal Hamiltonian Simulators
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…
We initiate a research program for the systematic investigation of quantum superintegrable systems involving the interaction of two non-relativistic particles with spin $1/2$ moving in the three-dimensional Euclidean space. In this paper,…
Entanglement is central to our understanding of many-body quantum matter. In particular, the entanglement spectrum, as eigenvalues of the reduced density matrix of a subsystem, provides a unique footprint of properties of strongly…
Hamiltonian quantum simulation of bosons on digital quantum computers requires truncating the Hilbert space to finite dimensions. The method of truncation and the choice of basis states can significantly impact the complexity of the quantum…
Quantum-disordered models provide a versatile platform to explore the emergence of quantum excitations in many-body systems. The engineering of spin models at the atomic scale with scanning tunneling microscopy and the local imaging of…
We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized…
We describe a technique to emulate a two-level \PT-symmetric spin Hamiltonian, replete with gain and loss, using only the unitary dynamics of a larger quantum system. This we achieve by embedding the two-level system in question in a…
Multi-component quantum systems in strong interaction with their environment are receiving increasing attention due to their importance in a variety of contexts, ranging from solid state quantum information processing to the quantum…
We consider the generalized rotor Hamiltonians capable of describing quantum systems invariant with respect to symmetry point-groups that go beyond the usual D_2-symmetry of a tri-axial rotor. We discuss the canonical de-quantisation…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
Supersymmetric quantum mechanics is a powerful tool for generating exactly solvable potentials departing from a given initial one. If applied to the harmonic oscillator, a family of Hamiltonians ruled by polynomial Heisenberg algebras is…
The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…
This paper proposes a novel approach to Hamiltonian simulation using Decision Diagrams (DDs), which are an exact representation based on exploiting redundancies in representations of quantum states and operations. While the simulation of…
We present a new scheme to perform noise resilient universal adiabatic quantum computation using two-body interactions. To achieve this, we introduce a new family of error detecting subsystem codes whose gauge generators and a set of their…
Classical spin Hamiltonians are a powerful tool to model complex systems, characterised by a local structure given by the local Hamiltonians. One of the best understood local structures is the grammar of formal languages, which are central…
The development of machine learning sheds new light on the problem of statistical thermodynamics in multicomponent alloys. However, a data-driven approach to construct the effective Hamiltonian requires sufficiently large data sets, which…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
According to a fundamental result in quantum computing, any unitary transformation on a composite system can be generated using so-called 2-local unitaries that act only on two subsystems. Beyond its importance in quantum computing, this…
In this Letter we show that an arbitrarily good approximation to the propagator e^{itH} for a 1D lattice of n quantum spins with hamiltonian H may be obtained with polynomial computational resources in n and the error \epsilon, and…
We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd,…