Related papers: Exact calculation of quantizer constants for arbit…
Lattice decoders constructed with neural networks are presented. Firstly, we show how the fundamental parallelotope is used as a compact set for the approximation by a neural lattice decoder. Secondly, we introduce the notion of…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
We present an efficient approach to precisely simulate tight binding models with optical lattices, based on programmable digital-micromirror-device (DMD) techniques. Our approach consists of a subroutine of Wegner-flow enabled precise…
This paper develops a new continuous approach to a similarity between periodic lattices of ideal crystals. Quantifying a similarity between crystal structures is needed to substantially speed up the Crystal Structure Prediction, because the…
Quasi-Monte Carlo (QMC) is an essential tool for integral approximation, Bayesian inference, and sampling for simulation in science, etc. In the QMC area, the rank-1 lattice is important due to its simple operation, and nice properties for…
We propose two low-complexity lattice code constructions that have competitive coding and shaping gains. The first construction, named systematic Voronoi shaping, maps short blocks of integers to the dithered Voronoi integers, which are…
We have implemented different algorithms for generating Poissonian and vectorizable random lattices. The random lattices fulfil the Voronoi/Delaunay construction. We measure the performance of our algorithms for the two types of random…
The projections of the lattices, may be used as models of quasicrystals, and the particular affine extension of the $H_2$ symmetry as a subgroup of $A_4$, discussed in the work, presents a different perspective to 5-fold symmetric…
We describe new techniques in the construction of optical lattices to realize a coherent atom-based microscope, comprised of two atomic species used as target and probe atoms, each in an independently controlled optical lattice. Precise and…
Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerating matrix multiplication (main component of large language…
Recent work have shown that the quantization for matrix multiplication problem can be optimally solved by quantizing each column in each matrix using a nested lattice code, and then multiplying the de-quantized matrices. It was further…
We study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive direction $(u,v)$ and two side lengths,…
We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied to face lattices of polyhedra and to various generalizations…
In this work we describe a new technique for numerical exact diagonalization. The method is particularly suitable for cold bosonic atoms in optical lattices, in which multiple atoms can occupy a lattice site. We describe the use of the…
This paper investigates the construction of space-filling designs for computer experiments. The space-filling property is characterized by the covering and separation radii of a design, which are integrated through the unified criterion of…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
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…
It is shown that the Coxeter-Todd lattice is the unique strongly perfect lattice in dimension 12.
A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a…
We present a general class of unbiased improved estimators for physical observables in lattice gauge theory computations which significantly reduces statistical errors at modest computational cost. The error reduction techniques, referred…