Related papers: Space-filling lattice designs for computer experim…
Space-filling experimental designs are widely used in engineering computer experiments, where only a limited number of expensive model evaluations can be afforded. Distance-based designs such as Maximin or Minimax ensure global…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
A central question in Quantum Computing is how matrices in $SU(2)$ can be approximated by products over a small set of generators. A topology will be defined on $SU(2)$ so as to introduce the notion of a covering exponent which compares the…
The jump-walking Monte-Carlo algorithm is revisited and updated to study the equilibrium properties of systems exhibiting quasi-ergodicity. It is designed for a single processing thread as opposed to currently predominant algorithms for…
Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
This paper proposes a new method of constructing compact fully-connected Quasi-Cyclic Low Density Parity Check (QC-LDPC) codes with girth g = 8, 10, and 12. The originality of the proposed method is to impose constraints on the exponent…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
Room layout estimation is a long-existing robotic vision task that benefits both environment sensing and motion planning. However, layout estimation using point clouds (PCs) still suffers from data scarcity due to annotation difficulty. As…
Let \mathbb{F}_q^{n+l} denote the (n+l)-dimensional singular linear space over a finite field \mathbb{F}_q. For a fixed integer m\leq\min\{n,l\}, denote by \mathcal{L}^m_o(\mathbb{F}_q^{n+l}) the set of all subspaces of type (t,t_1), where…
Lattice discretizations of continuous manifolds are common tools used in a variety of physical contexts. Conventional discrete approximations, however, cannot capture all aspects of the original manifold, notably its topology. In this paper…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
The quantum mechanical concept of quasi-exact solvability is based on the idea of partial algebraizability of spectral problem. This concept is not directly extendable to the systems with infinite number of degrees of freedom. For such…
Quantum Monte Carlo methods are powerful tools for studying quantum many-body systems but face difficulties in accessing excited states and in treating sign problems. We present a continuous-time path-integral Monte Carlo method for…
Quasi-Monte Carlo (QMC) methods for estimating integrals are attractive since the resulting estimators typically converge at a faster rate than pseudo-random Monte Carlo. However, they can be difficult to set up on arbitrary posterior…
In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…
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.…
In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the…