Related papers: NLTS Hamiltonians from classical LTCs
Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…
Conformal field theory has recently been applied to derive few-body Hamiltonians whose ground states are lattice versions of fractional quantum Hall states. The exact lattice models involve interactions over long distances, which is…
In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we…
We describe a general procedure which allows to construct, starting from a given Hamiltonian, the whole family of new ones sharing the same set of unparameterized trajectories in phase space. The symmetry structure of this family can be…
We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…
We construct a family of Ginsparg-Wilson Hamiltonians with improved chiral properties, starting from a construction of Creutz-Horvath-Neuberger that provides a doubler-free Hamiltonian lattice regularization for Dirac fermions in even…
The AdS/CFT correspondence realises the holographic principle where information in the bulk of a space is encoded at its border. We are yet a long way from a full mathematical construction of AdS/CFT, but toy models in the form of…
We propose an effective and lightweight learning algorithm, Symplectic Taylor Neural Networks (Taylor-nets), to conduct continuous, long-term predictions of a complex Hamiltonian dynamic system based on sparse, short-term observations. At…
Within CPT-symmetric quantum mechanics the most elementary differential form of the charge operator C is assumed. A closed-form integrability of the related coupled differential self-consistency conditions and a natural embedding of the…
We propose a new framework of Hessian-free force-gradient integrators that do not require the analytical expression of the force-gradient term based on the Hessian of the potential. Due to that the new class of decomposition algorithms for…
Two new families of completely integrable perturbations of the N-dimensional isotropic harmonic oscillator Hamiltonian are presented. Such perturbations depend on arbitrary functions and N free parameters and their integrals of motion are…
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…
This thesis develops advanced Tensor Network (TN) methods to address Hamiltonian Lattice Gauge Theories (LGTs), overcoming limitations in real-time dynamics and finite-density regimes. A novel dressed-site formalism is introduced, enabling…
Hamiltonian tridiagonal matrices characterized by multi-fractal spectral measures in the family of Iterated Function Systems can be constructed by a recursive technique here described. We prove that these Hamiltonians are almost-periodic.…
Locally testable codes (LTC) are error-correcting codes that have a local tester which can distinguish valid codewords from words that are "far" from all codewords by probing a given word only at a very few (sublinear, typically constant)…
In this paper we give the complete classification of solitons for a cubic NLS equation on the simplest network with a non-trivial topology: the tadpole graph, i.e. a ring with a half-line attached to it and free boundary conditions at the…
We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al…
While the impact of locality restrictions on quantum dynamics and algorithmic complexity has been well studied in the general case of time-dependent Hamiltonians, the capabilities of time-independent protocols are less well understood.…
Alternating current (ac) circuits can have electromagnetic edge modes protected by symmetries, analogous to topological band insulators or semimetals. How to make such a topological circuit? This paper illustrates a particular design idea…