Randomness versus Nonlocality in Multi-input and Multi-output Quantum Scenario
- URL: http://arxiv.org/abs/2408.04566v2
- Date: Thu, 5 Sep 2024 12:57:47 GMT
- Title: Randomness versus Nonlocality in Multi-input and Multi-output Quantum Scenario
- Authors: Chao Zhang, Yi Li, Xiao-Min Hu, Yu Xiang, Chuan-Feng Li, Guang-Can Guo, Jordi Tura, Qihuang Gong, Qiongyi He, Bi-Heng Liu,
- Abstract summary: Device-independent randomness certification based on Bell nonlocality does not require any assumptions about the devices.
Our work unravels the internal connection between randomness and nonlocality, and effectively enhances the performance of tasks such as device-independent random number generation.
- Score: 6.898796252063761
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Device-independent randomness certification based on Bell nonlocality does not require any assumptions about the devices and therefore provides adequate security. Great effort has been made to demonstrate that nonlocality is necessary for generating quantum randomness, but the minimal resource required for random number generation has not been clarified. Here we first prove and experimentally demonstrate that violating any two-input Bell inequality is both necessary and sufficient for certifying randomness, however, for the multi-input cases, this sufficiency ceases to apply, leading to certain states exhibiting Bell nonlocality without the capability to certify randomness. We examine two typical classes of Bell inequalities with multi-input and multi-output, the facet inequalities and Salavrakos-Augusiak-Tura-Wittek-Ac\'in-Pironio Bell inequalities, in the high-dimensional photonic system, and observe the violation of the latter one can always certify randomness which is not true for the former. The private randomness with a generation rate of 1.867\pm0.018 bits per photon pair is obtained in the scenario of Salavrakos-Augusiak-Tura-Wittek-Ac\'in-Pironio Bell inequalities with 3-input and 4-output. Our work unravels the internal connection between randomness and nonlocality, and effectively enhances the performance of tasks such as device-independent random number generation.
Related papers
- Maximum Quantum Non-Locality is not always Sufficient for Device-Independent Randomness Generation [3.7482527016282963]
We present families of $n$-player non-local games for $n geq 2$ and families of non-local behaviors on the quantum boundary that do not allow to certify any randomness against a classical adversary.
Our results show the existence of a form of bound randomness against classical adversaries, highlighting that device-independent randomness and quantum non-locality can be maximally inequivalent resources.
arXiv Detail & Related papers (2024-08-07T10:07:39Z) - Incorporating Zero-Probability Constraints to Device-Independent
Randomness Expansion [11.765274200974774]
We explore various forms of randomness that are certifiable in the so-called device-independent (DI) paradigm.
In this work, we determine the certifiable randomness when zero-probability constraints are incorporated into the task of DI randomness expansion.
arXiv Detail & Related papers (2024-01-16T15:57:17Z) - Expanding bipartite Bell inequalities for maximum multi-partite
randomness [0.9208007322096533]
We study the maximum amount of randomness that can be certified by correlations exhibiting a violation of the Mermin-Ardehali-Belinskii-Klyshko inequality.
We derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities"
Our technique allows one to take a bipartite Bell expression, known as the seed, and transform it into a multipartite Bell inequality tailored for randomness certification.
arXiv Detail & Related papers (2023-08-14T09:41:04Z) - Certification of unbounded randomness without nonlocality [0.0]
We provide a scheme to certify unbounded randomness in a semi-device-independent way based on the maximal violation of Leggett-Garg inequalities.
The scheme is independent of the choice of the quantum state, and consequently even "quantum" noise could be utilized to self-test quantum measurements.
arXiv Detail & Related papers (2023-07-03T20:11:08Z) - Semi-device independent nonlocality certification for near-term quantum
networks [46.37108901286964]
Bell tests are the most rigorous method for verifying entanglement in quantum networks.
If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used.
We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
arXiv Detail & Related papers (2023-05-23T14:39:08Z) - Experimental certification of more than one bit of quantum randomness in
the two inputs and two outputs scenario [0.0]
We present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources.
We use semi-definite programming to provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy.
Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties.
arXiv Detail & Related papers (2023-03-13T20:42:53Z) - Sparse random Hamiltonians are quantumly easy [105.6788971265845]
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems.
This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state.
Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
arXiv Detail & Related papers (2023-02-07T10:57:36Z) - 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) - Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof.
We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
arXiv Detail & Related papers (2022-03-30T18:00:00Z) - Single photon randomness originating from the symmetry of dipole
emission and the unpredictability of spontaneous emission [55.41644538483948]
Quantum random number generation is a key ingredient for quantum cryptography and fundamental quantum optics.
We experimentally demonstrate quantum random number generation based on the spontaneous emission process.
The scheme can be extended to random number generation by coherent single photons with potential applications in solid-state based quantum communication at room temperature.
arXiv Detail & Related papers (2021-02-18T14:07:20Z) - Using Randomness to decide among Locality, Realism and Ergodicity [91.3755431537592]
An experiment is proposed to find out, or at least to get an indication about, which one is false.
The results of such experiment would be important not only to the foundations of Quantum Mechanics.
arXiv Detail & Related papers (2020-01-06T19:26: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.