Related papers: Exact calculation of quantizer constants for arbit…
We systematically examine various proposals which aim at increasing the accuracy in the determination of the renormalization of two-fermion lattice operators. We concentrate on three finite quantities which are particularly suitable for our…
Quantum error correction will be a necessary component towards realizing scalable quantum computers with physical qubits. Theoretically, it is possible to perform arbitrarily long computations if the error rate is below a threshold value.…
We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…
Tensor network states provide an efficient class of states that faithfully capture strongly correlated quantum models and systems in classical statistical mechanics. While tensor networks can now be seen as becoming standard tools in the…
Recently, a class of mechanical lattices with reconfigurable, zero-stiffness structures has been proposed, called Totimorphic lattices. In this work, we introduce a computational framework that enables continuous reprogramming of a…
We investigate different methods for regularizing quantile regression when predicting either a subset of quantiles or the full inverse CDF. We show that minimizing an expected pinball loss over a continuous distribution of quantiles is a…
Overlaid oriented Voronoi diagrams (OOVDs) are known to provide useful data for the construction of optimal Euclidean $1$-Steiner trees. The theoretical time complexity of construction methods exploiting the OOVD is $O(n^2)$, but a…
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
The main result of this paper describes the normalizer of a finite parabolic subgroup of a (possibly infinite) Coxeter group. We use this to compute the automorphism groups of some Lorentzian lattices and K3 surfaces.
This paper studies the multivariate approximation of functions in weighted Korobov spaces using multiple rank-1 lattice rules. It has been shown by K\"{a}mmerer and Volkmer (2019) that algorithms based on multiple rank-1 lattices achieve…
This work concerns representations of a finite flat group scheme $G$, defined over a noetherian commutative ring $R$. The focus is on lattices, namely, finitely generated $G$-modules that are projective as $R$-modules, and on the full…
We propose a fast fourth-order cut cell method for solving constant-coefficient elliptic equations in two-dimensional irregular domains. In our methodology, the key to dealing with irregular domains is the poised lattice generation (PLG)…
Lattices of compatibly embedded finite fields are useful in computer algebra systems for managing many extensions of a finite field $\mathbb{F}_p$ at once. They can also be used to represent the algebraic closure $\bar{\mathbb{F}}_p$, and…
Lattice quantum chromodynamics (QCD) will soon become the primary theoretical tool in rigorous studies of single- and multi-hadron sectors of QCD. It is truly ab initio meaning that its only parameters are those of standard model. The…
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…
In this work, we present the first implementation of the face-centered cubic (FCC) lattice model for protein structure prediction with a quantum algorithm. Our motivation to encode the FCC lattice stems from our observation that the FCC…
The classic Voronoi cells can be generalized to a higher-order version by considering the cells of points for which a given $k$-element subset of the set of sites consists of the $k$ closest sites. We study the structure of the $k$-order…
We study nonuniform lattices in the automorphism group G of a locally finite simplicial tree X. In particular, we are interested in classifying lattices up to commensurability in G. We introduce two new commensurability invariants: quotient…
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations…
Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…