Noise robustness of three outcome Bell certified quantum randomness

• URL: http://arxiv.org/abs/2606.21371v2
• Date: Thu, 25 Jun 2026 09:49:02 GMT
• Title: Noise robustness of three outcome Bell certified quantum randomness
• Abstract summary: We investigate device-independent certification of global randomness based on Bell inequality violations in bipartite scenarios.<n>We find that a substantial number of inequalities certify significant amounts of min-entropy.
• Score: 0.10439136407307048
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate device-independent certification of global randomness based on Bell inequality violations in bipartite scenarios with three outcomes per party. Our goal is to determine whether multi-outcome measurements allow one to surpass the amount of randomness achievable with binary outputs in realistic scenarios. We begin by analyzing several known Bell expressions and evaluating their robustness against noise for randomness certification. We then introduce a systematic method for generating new Bell expressions within structured families and perform a large-scale numerical study. We find that a substantial number of inequalities certify significant amounts of min-entropy. In particular, we identify simple inequalities that achieve near-maximal global randomness while involving a reduced number of measurement settings, thus improving the balance between certified randomness and number of inputs. Moreover, the vast majority of nontrivial certificates exhibit robustness against realistic noise, maintaining positive certified randomness away from the ideal regime. These results demonstrate that strong device-independent randomness expansion in multi-outcome scenarios is not restricted to carefully engineered inequalities, but arises generically within suitably constructed families of Bell expressions.

Related papers

• Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario [0.11726720776908518]
  We develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses.<n>We show that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality.
  arXiv  Detail & Related papers  (2026-08-08T20:40:47Z)
• Genuine Multipartite Nonlocality for Arbitrary Input: Maximal Randomness Generation and Robust Self-Testing [0.0]
  We introduce a Bell inequality capable of identifying genuine multipartite nonlocality (GMNL) in an arbitrary m-partite scenario.<n>We show that our framework enables the extraction of maximal global DI randomness (m bits) at the optimal quantum violation.
  arXiv  Detail & Related papers  (2026-06-09T14:45:31Z)
• Combating Noisy Labels through Fostering Self- and Neighbor-Consistency [120.4394402099635]
  Label noise is pervasive in various real-world scenarios, posing challenges in supervised deep learning.<n>We propose a noise-robust method named Jo-SNC (textbfJoint sample selection and model regularization based on textbfSelf- and textbfNeighbor-textbfConsistency)<n>We design a self-adaptive, data-driven thresholding scheme to adjust per-class selection thresholds.
  arXiv  Detail & Related papers  (2026-01-19T07:55:29Z)
• Measurement-Incompatibility Constraints for Maximal Randomness [5.560127372386599]
  Certifying maximal quantum randomness without assumptions about system dimension remains a pivotal challenge for secure communication and foundational studies.<n>Here, we introduce a generalized framework to directly certify maximal randomness from observed probability distributions across systems with arbitrary user numbers.<n>Our results establish a versatile and experimentally accessible route to scalable randomness certification, with implications for quantum cryptography and the physics of nonlocal correlations.
  arXiv  Detail & Related papers  (2025-05-23T07:45:11Z)
• Local models and Bell inequalities for the minimal triangle network [78.45663456116702]
  Nonlocal correlations enable surprising phenomena in quantum information and quantum foundations.<n>We study one of the simplest scenarios, namely that of distributions invariant under permutations of parties in the minimal triangle network.<n>We provide insights on the existence of a classical-quantum gap in the triangle network with binary outcomes.
  arXiv  Detail & Related papers  (2025-03-20T19:11:06Z)
• Randomness versus Nonlocality in Multi-input and Multi-output Quantum Scenario [6.898796252063761]
  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.
  arXiv  Detail & Related papers  (2024-08-08T16:25:23Z)
• Expanding bipartite Bell inequalities for maximum multi-partite randomness [0.8192907805418583]
  We study the maximum amount of randomness that can be certified by correlations exhibiting a violation of the Mermin-Ardehali-Belinskii-Klyshko inequality.<n>We derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call expanding Bell inequalities''
  arXiv  Detail & Related papers  (2023-08-14T09:41:04Z)
• RobustMQ: Benchmarking Robustness of Quantized Models [54.15661421492865]
  Quantization is an essential technique for deploying deep neural networks (DNNs) on devices with limited resources. We thoroughly evaluated the robustness of quantized models against various noises (adrial attacks, natural corruptions, and systematic noises) on ImageNet. Our research contributes to advancing the robust quantization of models and their deployment in real-world scenarios.
  arXiv  Detail & Related papers  (2023-08-04T14:37:12Z)
• 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)
• Hidden Cost of Randomized Smoothing [72.93630656906599]
  In this paper, we point out the side effects of current randomized smoothing. Specifically, we articulate and prove two major points: 1) the decision boundaries of smoothed classifiers will shrink, resulting in disparity in class-wise accuracy; 2) applying noise augmentation in the training process does not necessarily resolve the shrinking issue due to the inconsistent learning objectives.
  arXiv  Detail & Related papers  (2020-03-02T23:37:42Z)
• 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.