Related papers: Tsirelson Polytopes and Randomness Generation
One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations…
This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…
We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…
Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…
Tsirelson showed that $2\sqrt{2}$ is the maximum value that CHSH expression can take for quantum-correlations [B. S.Tsirelson, Lett. Math. Phys, 4 (1980) 93]. This bound simply follows from the algebra of observables. Recently by exploiting…
We demonstrate extraction of randomness from spontaneous-emission events less than 36 ns in the past, giving output bits with excess predictability below $10^{-5}$ and strong metrological randomness assurances. This randomness generation…
To consider a high-dimensional random process, we propose a notion about stochastic tensor-valued random process (TRP). In this work, we first attempt to apply a generic chaining method to derive tail bounds for all p-th moments of the…
We report on an optical setup generating more than one bit of randomness from one entangled bit (i.e. a maximally entangled state of two-qubits). The amount of randomness is certified through the observation of Bell non-local correlations.…
Randomness is a fundamental feature in nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
One of the distinguishing features of quantum theory is that its measurement outcomes are usually unpredictable or, equivalently, random. Moreover, this randomness is certifiable with minimal assumptions in the so-called device-independent…
In the well-studied (2,2,2) Bell experiment consisting of two parties, two measurement settings per party, and two possible outcomes per setting, it is known that if the experiment obeys no-signaling constraints, then the set of admissible…
We develop a framework for certifying randomness from Bell-test trials based on directly estimating the probability of the measurement outcomes with adaptive test supermartingales. The number of trials need not be predetermined, and one can…
Quantum mechanics may revolutionise many aspects of modern information processing as it promises significant advantages in several fields such as cryptography, computing and metrology. Quantum cryptography for instance allows us to…
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…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
We present a randomized polynomial-time simplex algorithm with higher probability and tighter bounds for linear programming by applying improved quasi-convex properties, a logarithmic rounding on a given polytope and its logarithmic…
Free will (or randomness) has been studied to achieve loophole-free Bell's inequality test and to provide device-independent quantum key distribution security proofs. The required randomness such that a local hidden variable model (LHVM)…
Although there is an extensive literature on the maxima of Gaussian processes, there are relatively few non-asymptotic bounds on their lower-tail probabilities. The aim of this paper is to develop such a bound, while also allowing for many…