A privacy-preserving publicly verifiable quantum random number generator
- URL: http://arxiv.org/abs/2305.10909v1
- Date: Thu, 18 May 2023 12:13:48 GMT
- Title: A privacy-preserving publicly verifiable quantum random number generator
- Authors: Tanvirul Islam, Anindya Banerji, Chin Jia Boon, Wang Rui, Ayesha
Reezwana, James A. Grieve, Rodrigo Piera, and Alexander Ling
- Abstract summary: We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
limitations on computing power can restrict an end-user's ability to perform such verification.
- Score: 48.7576911714538
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Verifying the quality of a random number generator involves performing
computationally intensive statistical tests on large data sets commonly in the
range of gigabytes. Limitations on computing power can restrict an end-user's
ability to perform such verification. There are also applications where the
user needs to publicly demonstrate that the random bits they are using pass the
statistical tests without the bits being revealed. We report the implementation
of an entanglement-based protocol that allows a third party to publicly perform
statistical tests without compromising the privacy of the random bits.
Related papers
- Local contextuality-based self-tests are sufficient for randomness expansion secure against quantum adversaries [0.0]
We show that local contextuality-based self-tests are sufficient to construct a randomness expansion protocol that is secure against unbounded quantum adversaries.
Our protocol is based on self-testing from non-contextuality inequalities and we prove that our schemeally produces secure random numbers which are $mathcalO(mstepsilon)$-close to uniformly distributed and private.
arXiv Detail & Related papers (2024-09-30T08:31:46Z) - Sequential Kernelized Independence Testing [101.22966794822084]
We design sequential kernelized independence tests inspired by kernelized dependence measures.
We demonstrate the power of our approaches on both simulated and real data.
arXiv Detail & Related papers (2022-12-14T18:08:42Z) - Validation tests of GBS quantum computers give evidence for quantum
advantage with a decoherent target [62.997667081978825]
We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data.
We show how one can disprove faked data, and apply this to a classical count algorithm.
arXiv Detail & Related papers (2022-11-07T12:00:45Z) - Testing randomness of series generated in Bell's experiment [62.997667081978825]
We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle.
Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent.
The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
arXiv Detail & Related papers (2022-08-31T17:39:29Z) - Source-independent quantum random number generator against tailored
detector blinding attacks [6.86599501487994]
We propose a quantum random number generation protocol that addresses source vulnerability and ferocious detector blinding attacks.
We experimentally demonstrate the ability of our protocol to generate random numbers for two-dimensional measurement with a generation speed of 0.1 bit per pulse.
arXiv Detail & Related papers (2022-04-26T08:47:37Z) - Certified Random Number Generation from Quantum Steering [1.0820909926464386]
Certified randomness protocols have been developed which remove the need for trust in devices by taking advantage of nonlocality.
Here, we use a photonic platform to implement our protocol, which operates in the quantum steering scenario.
We demonstrate an approach for a steering-based generator of public or private randomness, and the first generation of certified random bits, with the detection loophole closed.
arXiv Detail & Related papers (2021-11-18T03:49:43Z) - Lossless Compression of Efficient Private Local Randomizers [55.657133416044104]
Locally Differentially Private (LDP) Reports are commonly used for collection of statistics and machine learning in the federated setting.
In many cases the best known LDP algorithms require sending prohibitively large messages from the client device to the server.
This has led to significant efforts on reducing the communication cost of LDP algorithms.
arXiv Detail & Related papers (2021-02-24T07:04:30Z) - Certified Randomness From Steering Using Sequential Measurements [0.0]
A single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness.
Motivated by these difficulties in the device-independent setting, we consider the scenario of one-sided device independence.
We show how certain aspects of previous work can be adapted to this scenario and provide theoretical bounds on the amount of randomness which can be certified.
arXiv Detail & Related papers (2020-08-03T08:18:29Z) - Fast self-testing Quantum Random Number Generator based on homodyne
detection [0.0]
Self-testing and Semi-Device Independent protocols are becoming the preferred choice for quantum technologies.
We certify 145.5MHz of quantum random bit generation rate.
arXiv Detail & Related papers (2020-04-17T15:35:33Z) - Statistical Limits of Supervised Quantum Learning [90.0289160657379]
We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension.
We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
arXiv Detail & Related papers (2020-01-28T17:35:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.