Related papers: NLTS Hamiltonians from classical LTCs
We derive a renormalized classical spin (RCS) theory for $S > 1/2$ quantum magnets by constraining a generalized classical theory that includes all multipolar fluctuations to a reduced CP$^1$ phase space of dipolar SU($2$) coherent states.…
We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due…
This paper builds upon our recent work, published in Lett. Math. Phys., 112: 94, 2022, where we established that the integrable Volterra lattice on a free associative algebra and the whole hierarchy of its symmetries admits a quantisation…
Examples of the construction of Hamiltonian structures for dynamical systems in field theory (including one reputedly non-Hamiltonian problem) without using Lagrangians, are presented. The recently developed method used requires the…
In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs…
We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We…
We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…
We prove that the existence of a Haantjes structure is a necessary and sufficient condition for a Hamiltonian system to be integrable in the Liouville-Arnold sense. This structure, expressed in terms of suitable operators whose Haantjes…
We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially…
Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this…
Understanding commuting local Hamiltonians (CLHs) is at the heart of many questions in quantum computational complexity and quantum physics: quantum error correcting codes, quantum NP, the PCP conjecture, topological order and more.
In this work we extend the notion of universal quantum Hamiltonians to the setting of translationally-invariant systems. We present a construction that allows a two-dimensional spin lattice with nearest-neighbour interactions, open…
We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods.…
The local Hamiltonian problem is famously complete for the class QMA, the quantum analogue of NP. The complexity of its semi-classical version, in which the terms of the Hamiltonian are required to commute (the CLH problem), has attracted…
An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibility in the choice of design parameters like rate, average…
Recent work on a free field realization of the Hamiltonian structures of the classical KP hierarchy and of its flows is reviewed. It is shown that it corresponds to a reduction of KP to the NLS system. (Talk given by D.A.D. at the NSERC-CAP…
Recent work has characterised rigorously what it means for one quantum system to simulate another, and demonstrated the existence of universal Hamiltonians -- simple spin lattice Hamiltonians that can replicate the entire physics of any…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…
A universal family of Hamiltonians can be used to simulate any local Hamiltonian by encoding its full spectrum as the low-energy subspace of a Hamiltonian from the family. Many spin-lattice model Hamiltonians -- such as Heisenberg or XY…
N-site-lattice Hamiltonians H are introduced and perceived as a set of systematic discrete approximants of a certain PT-symmetric square-well-potential model with the real spectrum and with a non-Hermiticity which is localized near the…