Related papers: NLTS Hamiltonians from classical LTCs
In light of Lov\'{a}sz's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry--specifically…
Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and…
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem.…
Effective Hamiltonians are usually constructed by using canonical transformations or projection techniques. In contrast to this, we present a method for systems with arbitrary Hilbert space based on the introduction of cumulants. Cumulants…
Quantum simulations of lattice gauge theories for the foreseeable future will be hampered by limited resources. The historical success of improved lattice actions in classical simulations strongly suggests that Hamiltonians with improved…
By modifying and generalizing known supersymmetric models we are able to find four different sets of one-dimensional Hamiltonians for the inverted harmonic oscillator. The first set of Hamiltonians is derived by extending the supersymmetric…
The non-Hermitian models, which are symmetric under parity (P) and time-reversal (T) operators, are the cornerstone for the fabrication of new ultra-sensitive optoelectronic devices. However, providing the gain in such systems usually…
We consider a single particle tunnelling in a tight-binding model with nearest-neighbour couplings, in the presence of a periodic high-frequency force. An effective Hamiltonian for the particle is derived using an averaging method…
Discovering a suitable neural network architecture for modeling complex dynamical systems poses a formidable challenge, often involving extensive trial and error and navigation through a high-dimensional hyper-parameter space. In this…
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…
Imagine to discover a new fourth family of leptons at the Large Hadron Collider (LHC) but no signs of an associated fourth family of quarks. What would that imply? An intriguing possibility is that the new fermions needed to compensate for…
We show here that the Hamiltonian for an electronic system may be written exactly in terms of fluctuation operators that transition constituent fragments between internally correlated states, accounting rigorously for inter-fragment…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
In this paper we develop a straightforward procedure to construct higher dimensional isochronous Hamiltonian systems. We first show that a class of singular Hamiltonian systems obtained through the $\Omega$-modified procedure is equivalent…
We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins),…
We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…
In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…
As the continuum limit is approached, lattice QCD simulations tend to get trapped in the topological charge sectors of field space and may consequently give biased results in practice. We propose to bypass this problem by imposing open…
Trotter and linear-combination-of-unitary (LCU) are two popular Hamiltonian simulation methods. We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error, which enjoy both of their advantages. By adding few gates…
For a periodically driven quantum system an effective time-independent Hamiltonian is derived with an eigen-energy spectrum, which in the regime of large driving frequencies approximates the quasi-energies of the corresponding Floquet…