Related papers: Sampling cubic rings
We investigate protocols for generating a state $t$-design by using a fixed separable initial state and a diagonal-unitary $t$-design in the computational basis, which is a $t$-design of an ensemble of diagonal unitary matrices with random…
We introduce a compressed suffix array representation that, on a text $T$ of length $n$ over an alphabet of size $\sigma$, can be built in $O(n)$ deterministic time, within $O(n\log\sigma)$ bits of working space, and counts the number of…
A previous knowledge of the domains of dependence of an Hamilton Jacobi equation can be useful in its study and approximation. Information of this nature are, in general, difficult to obtain directly from the data of the problem. In this…
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion…
We describe an optoelectronic system for simultaneously generating parallel, independent streams of random bits using spectrally separated noise signals obtained from a single optical source. Using a pair of non-overlapping spectral filters…
It is shown that a random binary process with impulse-like autocorrelation can be generated by randomizing the length of symbols occurring in a random Bernoulli process. Such randomization is achieved by random (or judiciously designed…
The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature matrix. For this problem, we first propose an impressively…
We study the probabilistic sampling of a random variable, in which the variable is sampled only if it falls outside a given set, which is called the silence set. This helps us to understand optimal event-based sampling for the special case…
The efficiency of locally generating unitary designs, which capture statistical notions of quantum pseudorandomness, lies at the heart of wide-ranging areas in physics and quantum information technologies. While there are extensive potent…
We study the random sampling of band-limited functions of several variables. If a bandlimited function with bandwidth one has its essential support on a cube of volume $R^d$, then $\cO (R^d \log R^d)$ random samples suffice to approximate…
We propose the task of local state marking (LSM), where some multipartite quantum states chosen randomly from a known set of states are distributed among spatially separated parties without revealing the identities of the individual states.…
In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a…
We construct a quantum cluster structure on the skew-field of fractions ${\rm Frac}({\mathscr S}_\omega(\mathfrak{S}))$ of the stated ${\rm SL}_n$-skein algebra ${\mathscr S}_\omega(\mathfrak{S})$, where $\mathfrak{S}$ is a triangulable pb…
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…
We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced times. He proved that the signal can be reconstructed as…
Compensation for parameter dispersion is a significant challenge for control of inhomogeneous quantum ensembles. In this paper, we present a systematic methodology of sampling-based learning control (SLC) for simultaneously steering the…
Let $F$ be a number field with ring of integers $\Oc_F$ and $\Dc$ a division $F$-algebra with a maximal cyclic subfield $K$. We study rings occurring as quotients of a natural $\Oc_F$-order $\Lambda$ in $\Dc$ by two-sided ideals. We reduce…
For a string $S$, a palindromic substring $S[i..j]$ is said to be a \emph{shortest unique palindromic substring} ($\mathit{SUPS}$) for an interval $[s, t]$ in $S$, if $S[i..j]$ occurs exactly once in $S$, the interval $[i, j]$ contains $[s,…
In this paper, we mainly study the random sampling stability for signals in a weighted reproducing kernel subspace of $L_\nu^p(\mathbb{R}^d)$ without the additional requirement that the kernel function has symmetry. The sampling set is…
We consider the use of a single qutrit for random generation. This is possible because single qutrits exhibit contextuality features. We aim to optimize the entropy of the generated sequence. To do this, we do not rely on the KCBS…