Certifying Randomness or its Lack Thereof for General Network Scenarios

• URL: http://arxiv.org/abs/2510.20993v1
• Date: Thu, 23 Oct 2025 20:43:51 GMT
• Title: Certifying Randomness or its Lack Thereof for General Network Scenarios
• Authors: Maria Ciudad Alañón, Daniel Centeno, Andrew Watford, Elie Wolfe,
• Abstract summary: We explore randomness certification in more general causal structures, namely, network scenarios.<n>We demonstrate how the computational tool known as the inflation technique can be adapted.<n>We also provide computational methods for the problem of certifying an absence of randomness, which should not be conflated with certifying the classicality of a given probability distribution.
• Score: 0.10499611180329804
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The certification of intrinsic randomness is foundational to quantum information theory and central in many practical applications thereof, such as in the generation of unquestionably random numbers and in cryptographic protocols. Device-independent randomness certification based on violations of Bell inequalities has been thoroughly investigated within the standard Bell scenario. In this work, we aim to extend this line of research by exploring randomness certification in more general causal structures, namely, network scenarios. To address this task, we demonstrate how the computational tool known as the inflation technique can be adapted. As proof of concept, we use inflation to certify randomness relative to a beyond-quantum adversary for sample probability distributions obtained in the bilocality and triangle scenarios. Complementarily, we also provide computational methods for the problem of certifying an absence of randomness, which should not be conflated with certifying the classicality of a given probability distribution. We conclude with a discussion of conceptual subtleties regarding randomness certification in networks, highlighting important open problems in this nascent research field.

Related papers

• Conformal Prediction for Multi-Source Detection on a Network [59.17729745907474]
  We study the multi-source detection problem.<n>Given snapshot observations of node infection status on a graph, estimate the set of source nodes that initiated the propagation.<n>We propose a novel conformal prediction framework that provides statistically valid recall guarantees for source set detection.
  arXiv  Detail & Related papers  (2025-11-12T01:09:56Z)
• 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)
• Applications of Certified Randomness [4.213239215827573]
  Certified randomness can be generated with untrusted quantum computers.<n>We explore real-world applications for which the use of certified randomness protocols may lead to improved security and fairness.
  arXiv  Detail & Related papers  (2025-03-25T15:22:41Z)
• Experimental quantum randomness enhanced by a quantum network [0.7432847575460758]
  We show that extending the conventional bipartite Bell scenario to hybrid quantum networks enhances the robustness of certifiable randomness.<n>Our protocol even enables randomness to be certified from Bell-local states.
  arXiv  Detail & Related papers  (2024-12-22T11:08:02Z)
• Certification of unbounded randomness with arbitrary noise [0.0]
  Quantum nonlocality has been identified as a resource that can be utilised to certify randomness.<n>We provide a scheme to certify unbounded randomness in a semi-device-independent way based on the maximal violation of Leggett-Garg inequalities.
  arXiv  Detail & Related papers  (2023-07-03T20:11:08Z)
• Numerically assisted determination of local models in network scenarios [55.2480439325792]
  We develop a numerical tool for finding explicit local models that reproduce a given statistical behaviour. We provide conjectures for the critical visibilities of the Greenberger-Horne-Zeilinger (GHZ) and W distributions. The developed codes and documentation are publicly available at281.com/mariofilho/localmodels.
  arXiv  Detail & Related papers  (2023-03-17T13:24:04Z)
• Shortcomings of Top-Down Randomization-Based Sanity Checks for Evaluations of Deep Neural Network Explanations [67.40641255908443]
  We identify limitations of model-randomization-based sanity checks for the purpose of evaluating explanations. Top-down model randomization preserves scales of forward pass activations with high probability.
  arXiv  Detail & Related papers  (2022-11-22T18:52:38Z)
• 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)
• CC-Cert: A Probabilistic Approach to Certify General Robustness of Neural Networks [58.29502185344086]
  In safety-critical machine learning applications, it is crucial to defend models against adversarial attacks. It is important to provide provable guarantees for deep learning models against semantically meaningful input transformations. We propose a new universal probabilistic certification approach based on Chernoff-Cramer bounds.
  arXiv  Detail & Related papers  (2021-09-22T12:46:04Z)
• 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)
• Certified Robustness to Label-Flipping Attacks via Randomized Smoothing [105.91827623768724]
  Machine learning algorithms are susceptible to data poisoning attacks. We present a unifying view of randomized smoothing over arbitrary functions. We propose a new strategy for building classifiers that are pointwise-certifiably robust to general data poisoning attacks.
  arXiv  Detail & Related papers  (2020-02-07T21:28:30Z)

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.