Related papers: NLTS Hamiltonians from classical LTCs
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for quantum fault tolerance. Dramatic recent progress on qLDPC codes has led to constructions which are asymptotically good, and which admit linear-time…
Although the no-u-turn sampler (NUTS) is a widely adopted method for performing Bayesian inference, it requires numerous posterior gradients which can be expensive to compute in practice. Recently, there has been a significant interest in…
We train hierarchical Transformers on the task of synthesizing hardware circuits directly out of high-level logical specifications in linear-time temporal logic (LTL). The LTL synthesis problem is a well-known algorithmic challenge with a…
We construct a class of lattice Hamiltonians whose single-particle spectrum consists of an arbitrary number of exactly degenerate flat bands that reproduce the analytic structure of the first $p$ Landau levels restricted to the lattice.…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…
We train a small message-passing graph neural network to predict Hamiltonian cycles on Erd\H{o}s-R\'enyi random graphs in a critical regime. It outperforms existing hand-crafted heuristics after about 2.5 hours of training on a single GPU.…
In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed…
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…
There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper,…
The nonrelativistic Hamiltonians of scalar, spinor and vector particles in the electromagnetic field are studied by applying the Douglas-Kroll-Hess approach. Their relativistic Hamiltonians are expanded on the potential, and the…
In this paper, we construct an infinite family of normal Cayley graphs, which are $2$-distance-transitive but neither distance-transitive nor $2$-arc-transitive. This answers a question raised by Chen, Jin and Li in 2019 and corrects a…
Linear optical networks are devices that turn classical incident modes by a linear transformation into outgoing ones. In general, the quantum version of such transformations may mix annihilation and creation operators. We derive a simple…
Improved Kogut-Susskind Hamiltonians for quantum simulations of non-Abelian Yang-Mills gauge theories are developed for honeycomb (2+1D) and hyperhoneycomb (3+1D) spatial tessellations. This is motivated by the desire to identify lattices…
Recent results have shown the stability of frustration-free Hamiltonians to weak local perturbations, assuming several conditions. In this paper, we prove the stability of free fermion Hamiltonians which are gapped and local. These free…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
Recently the breakthrough method of hypergraph containers, developed independently by Balogh, Morris, and Samotij as well as Saxton and Thomason, has been used to study sparse random analogs of a variety of classical problems from…
Commuting local Hamiltonians provide a testing ground for studying many of the most interesting open questions in quantum information theory, including the quantum PCP conjecture and the existence of area laws. Although they are a…
This work provides the first explicit and non-random family of $[[N,K,D]]$ LDPC quantum codes which encode $K \in \Theta(N^\frac{4}{5})$ logical qubits with distance $D \in \Omega(N^\frac{3}{5})$. The family is constructed by amalgamating…
We present a prescription for an effective lightcone (LC) Hamiltonian that includes the effects of zero modes, focusing on the case of Conformal Field Theories (CFTs) deformed by relevant operators. We show how the prescription resolves a…
With recent breakthroughs in the construction of good qLDPC codes and nearly good qLTCs, the study of (co)homological invariants of quantum code complexes, which fundamentally underlie their logical operations, has become evidently…