Related papers: NLTS Hamiltonians from good quantum codes
Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits. However, they are impacted by short cycles,…
We prove stability of the spectral gap for gapped, frustration-free Hamiltonians under general, quasi-local perturbations. We present a necessary and sufficient condition for stability, which we call "Local Topological Quantum Order" and…
We initiate the study of quantum Locally Testable Codes (qLTCs). We provide a definition together with a simplification, denoted sLTCs, for the special case of stabilizer codes, together with some basic results using those definitions. The…
Microscopically conserving reduced models of many-body systems have a long, highly successful history. Established theories of this type are the random-phase approximation for Coulomb fluids and the particle-particle ladder model for…
The construction of parent Hamiltonians that possess a given state as their ground state is a well-studied problem. In this work, we generalize this notion by considering simple quantum states and examining the local Hamiltonians that have…
Flatbands (FBs) are dispersionless energy bands in the single-particle spectrum of a translational invariant tight-binding network. The FBs occur due to destructive interference, resulting in macroscopically degenerate eigenstates living in…
With our recently proposed effective Hamiltonian via Monte Carlo, we are able to compute low energy physics of quantum systems. The advantage is that we can obtain not only the spectrum of ground and excited states, but also wave functions.…
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…
We propose a quantum algorithm to obtain the lowest eigenstate of any Hamiltonian simulated by a quantum computer. The proposed algorithm begins with an arbitrary initial state of the simulated system. A finite series of transforms is…
Recently, it was shown that fractional quantum Hall states can be defined on fractal lattices. Proposed exact parent Hamiltonians for these states are nonlocal and contain three-site terms. In this work, we look for simpler, approximate…
Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over…
Previous $\lambda$-deformed {\it non-Hermitian} Hamiltonians with respect to the usual scalar product of Hilbert spaces dealing with harmonic oscillator-like developments are (re)considered with respect to a new scalar product in order to…
Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to…
Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an $m$-dimensional space of physical parameters, the ground…
It is well known that the ground state energy of many-particle Hamiltonians involving only 2-body interactions can be obtained using constrained optimizations over density matrices which arise from reducing an N-particle state. While…
The relativistic Klein-Gordon system is studied as an illustration of Quantum Mechanics using non-Hermitian operators as observables. A version of the model is considered containing a generic coordinate- and energy-dependent…
Topological phases are characterized by their entanglement properties, which is manifest in a direct relation between entanglement spectra and edge states discovered by Li and Haldane. We propose to leverage the power of synthetic quantum…
The local Hamiltonian problem plays the equivalent role of SAT in quantum complexity theory. Understanding the complexity of the intermediate case in which the constraints are quantum but all local terms in the Hamiltonian commute, is of…
Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived -- one based on nonprimitive narrow-sense BCH codes and the other directly…
We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-check (qLDPC) code and fault-tolerant quantum circuits. DTDs…