Related papers: Better Lattice Quantizers Constructed from Complex…
The architecture and capabilities of the computers currently in use for large-scale lattice QCD calculations are described and compared. Based on this present experience, possible future directions are discussed.
$Z(2)$ lattice gauge theory plays an important role in the study of the threshold probability of Quantum Error Correction (QEC) for a quantum code. For certain QEC codes, such as the well-known Kitaev's toric/surface code, one can find a…
It has long been conjectured that certain supersymmetric Yang-Mills (SYM) theories provide us with nonperturbative formulations of the string/M-theory. Although the supersymmetry (SUSY) on lattice is notoriously difficult in general, for a…
This paper extends the recently obtained complete and continuous map of the Lattice Isometry Space (LISP) to the practical case of dimension 3. A periodic 3-dimensional lattice is an infinite set of all integer linear combinations of basis…
We present a complete architecture for scalable quantum computation with ultracold atoms in optical lattices using optical tweezers focused to the size of a lattice spacing. We discuss three different two-qubit gates based on local…
There has been major progress in recent years in the development of improved discretizations of the QCD action, current operators, etc for use in numerical simulations that employ very coarse lattices. These lectures review the field…
We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…
We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a…
We give classifications of integral lattices which include the Barnes-Wall lattice $BW_{16}$ or laminated lattices of dimension $1 \leqslant d \leqslant 8$ and of minimum 4. Also, we give certain lattice neighboring from each lattice.…
The advantage of simulating lattice field theory with quantum computers is hamstrung by the limited resources that induce large errors from finite volume and sizable lattice spacings. Previous work has shown how classical simulations near…
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…
Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but are also a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes…
In this work, we prove that polar lattices, when tailored for lossy compression, are quantization-good in the sense that their normalized second moments approach $\frac{1}{2\pi e}$ as the dimension of lattices increases. It has been…
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
Lattice discretization of the supersymmetric Yang-Mills quantum mechanics is reviewed and results of the Monte Carlo simulations of the simplified model are presented. The D=4, N=2, quenched system, studied at finite temperature, reveals…
We define a natural coarse-graining procedure which can be applied to any closed equilibrium quantum system described by a density matrix ensemble and we show how the coarse-graining leads to the Gaussian and canonical ensembles. After this…
We classify nonultralocal Poisson brackets for 1-dimensional lattice systems and describe the corresponding regularizations of the Poisson bracket relations for the monodromy matrix . A nonultralocal quantum algebras on the lattices for…
Lattice studies of spontaneous supersymmetry breaking suffer from a sign problem that in principle can be evaded through novel methods enabled by quantum computing. Focusing on lower-dimensional lattice systems with more modest resource…
This article presents a novel encoding for quantum Lattice Boltzmann method algorithm using Carleman linearization. In contrast to previous articles \cite{Sanavio2024LatticeBC,sanavio2025carleman}, the encoding used allows for local…
We propose a numerical method of estimating various physical quantities in lattice (supersymmetric) quantum mechanics. The method consists only of deterministic processes such as computing a product of transfer matrix, and has no…