Related papers: Sampling cubic rings
In this work, we investigate the sampling and reconstruction of spectrally $s$-sparse bandlimited graph signals governed by heat diffusion processes. We propose a random space-time sampling regime, referred to as {randomized} dynamical…
How to turn the flip of a coin into a random variable whose expected value equals a scattering amplitude? We answer this question by constructing a numerical algorithm to evaluate curve integrals - a novel formulation of scattering…
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…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
Contrary to the traditional pursuit of research on nonuniform sampling of bandlimited signals, the objective of the present paper is not to find sampling conditions that permit perfect reconstruction, but to perform the best possible signal…
We introduce the concept of selective quantum state tomography or SQST, a tomographic scheme that enables a user to estimate arbitrary elements of an unknown quantum state using a fixed measurement record. We demonstrate how this may be…
We propose novel methods for the exact synthesis of single-qubit unitaries with high success probability and gate fidelity, considering both time-bin and frequency-bin encodings. The proposed schemes are experimentally implementable with a…
We discuss how to achieve mapping from large sets of imperfect simulations and observational data with unsupervised domain adaptation. Under the hypothesis that simulated and observed data distributions share a common underlying…
The time domain linear sampling method (TD-LSM) solves inverse scattering problems using time domain data by creating an indicator function for the support of the unknown scatterer. It involves only solving a linear integral equation called…
In a circle (an S^1) with circumference 1 assume m objects distributed pseudo-randomly. In the universal covering R^1 assume the objects replicated accordingly, and take an interval L>1. In this interval, make the normalized histogram of…
If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vec{\lambda}=(\lambda_1,\lambda_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the…
We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of…
Let $K\subset\mathbb S^{d-1}$ be a convex spherical body. Denote by $\Delta(K)$ the distance between two random points in $K$ and denote by $\sigma(K)$ the length of a random chord of $K$. We explicitly express the distribution of…
It is proposed to create materials with a desired refraction coefficient in a bounded domain $D\subset \R^3$ by embedding many small balls with constant refraction coefficients into a given material. The number of small balls per unit…
This paper discusses sample allocation problem (SAP) in frequency-domain Compressive Sampling (CS) of time-domain signals. An analysis that is relied on two fundamental CS principles; the Uniform Random Sampling (URS) and the Uncertainty…
Slice sampling is an efficient Markov Chain Monte Carlo algorithm to sample from an unnormalized density with acceptance ratio always $1$. However, when the variable to sample is unbounded, its "stepping-out" heuristic works only locally,…
We derive explicit integrability conditions for stochastic integrals taken over time and space driven by a random measure. Our main tool is a canonical decomposition of a random measure which extends the results from the purely temporal…
Semi-device independent (Semi-DI) quantum random number generators (QRNG) gained attention for security applications, offering an excellent trade-off between security and generation rate. This paper presents a proof-of-principle time-bin…
Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational and physical uses. This is often referred to as pseudorandom…
The quantum stochastic drift protocol, also known as qDRIFT, has become a popular algorithm for implementing time-evolution of quantum systems using randomised compiling. In this work we develop qFLO, a higher order randomised algorithm for…