Related papers: Quantization for uniform distributions on hexagona…
Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega=(\omega_n)_{n\geq 1}$ uniformly distributed…
Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…
We determine the inner product on the Hilbert space of wavefunctions of the universe by imposing the Hermiticity of the quantum Hamiltonian in the context of the minisuperspace model. The corresponding quantum probability density reproduces…
We determine the distribution of the conductors $N$ of rational elliptic curves when ordered by naive height $H$, in the form of an explicit density function for the ratios $N/H$. Our work is essentially an effective version of the…
In this work, we study distributions of unitaries generated by random quantum circuits containing only symmetry-respecting gates. We develop a unified approach applicable to all symmetry groups and obtain an equation that determines the…
We investigate how quantum coherence can be distributed among the several off-diagonal elements of an arbitrary density matrix. An easily computable quantity that captures this variability notion is proposed and it is argued that it…
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…
We study the convergence rate of the optimal quantization for a probability measure sequence $(\mu_{n})_{n\in\mathbb{N}^{*}}$ on $\mathbb{R}^{d}$ converging in the Wasserstein distance in two aspects: the first one is the convergence rate…
Quantized Neural Networks (QNNs), which use low bitwidth numbers for representing parameters and performing computations, have been proposed to reduce the computation complexity, storage size and memory usage. In QNNs, parameters and…
We investigate optimal encoding and retrieval of digital data, when the storage/communication medium is described by quantum mechanics. We assume an m-ary alphabet with arbitrary prior distribution, and an n-dimensional quantum system.…
We investigate the problem of testing the equivalence between two discrete histograms. A {\em $k$-histogram} over $[n]$ is a probability distribution that is piecewise constant over some set of $k$ intervals over $[n]$. Histograms have been…
Unbiased random vectors i.e. distributed uniformly in n-dimensional space, are widely applied and the computational cost of generating a vector increases only linearly with n. On the other hand, generating uniformly distributed random…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
Quantization has proven effective in high-resolution and large-scale simulations, which benefit from bit-level memory saving. However, identifying a quantization scheme that meets the requirement of both precision and memory efficiency…
Given a fixed quadratic extension K of Q, we consider the distribution of elements in K of norm 1 (denoted N). When K is an imaginary quadratic extension, N is naturally embedded in the unit circle in C and we show that it is…
One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n \alpha)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $\alpha$. Another…
This article studies a general divide-and-conquer algorithm for approximating continuous one-dimensional probability distributions with finite mean. The article presents a numerical study that compares pre-existing approximation schemes…
We prove limit theorems for the greatest common divisor and the least common multiple of random integers. While the case of integers uniformly distributed on a hypercube with growing size is classical, we look at the uniform distribution on…
Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…