Necessary and Sufficient Condition for Randomness Certification from Incompatibility

• URL: http://arxiv.org/abs/2409.14991v1
• Date: Mon, 23 Sep 2024 13:13:47 GMT
• Title: Necessary and Sufficient Condition for Randomness Certification from Incompatibility
• Authors: Yi Li, Yu Xiang, Jordi Tura, Qiongyi He,
• Abstract summary: Quantum randomness can be certified from probabilistic behaviors demonstrating Bell nonlocality or Einstein-Podolsky-Rosen steering. We provide the necessary and sufficient condition for nonzero certifiable randomness in terms of measurement incompatibility.
• Score: 5.38013403786666
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum randomness can be certified from probabilistic behaviors demonstrating Bell nonlocality or Einstein-Podolsky-Rosen steering, leveraging outcomes from uncharacterized devices. However, such nonlocal correlations are not always sufficient for this task, necessitating the identification of required minimum quantum resources. In this work, we provide the necessary and sufficient condition for nonzero certifiable randomness in terms of measurement incompatibility and develop approaches to detect them. Firstly, we show that the steering-based randomness can be certified if and only if the correlations arise from a measurement compatibility structure that is not isomorphic to a hypergraph containing a star subgraph. In such a structure, the central measurement is individually compatible with the measurements at branch sites, precluding certifiable randomness in the central measurement outcomes. Subsequently, we generalize this result to the Bell scenario, proving that the violation of any chain inequality involving $m$ inputs and $d$ outputs rules out such a compatibility structure, thereby validating all chain inequalities as credible witnesses for randomness certification. Our results point out the role of incompatibility structure in generating random numbers, offering a way to identify minimum quantum resources for the task.

Related papers

• Self-testing of Nonmaximal Genuine Entangled States using Tripartite Hardy Relations [0.0]
  We show that in the tripartite scenario with all parties' local events being space-like separated, Hardy-type nonlocality constitutes a stronger manifestation of nonlocal correlations than Mermin-type inequalities. This framework highlights the pivotal role of Hardy-type reasoning in the detection and certification of genuine multipartite nonlocality.
  arXiv  Detail & Related papers  (2025-04-28T05:15:40Z)
• 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)
• 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)
• 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)
• Nonparametric Identifiability of Causal Representations from Unknown Interventions [63.1354734978244]
  We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables. Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
  arXiv  Detail & Related papers  (2023-06-01T10:51:58Z)
• 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)
• 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)
• Quantum correlations on the no-signaling boundary: self-testing and more [0.39146761527401425]
  We prove that self-testing is possible in all nontrivial Classes beyond the known examples of Hardy-type correlations. All correlations of $mathcalM$ in the simplest Bell scenario are attainable as convex combinations of those achievable using a Bell pair and projective measurements.
  arXiv  Detail & Related papers  (2022-07-28T01:55:21Z)
• Incompatibility of observables, channels and instruments in information theories [68.8204255655161]
  We study the notion of compatibility for tests of an operational probabilistic theory. We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.
  arXiv  Detail & Related papers  (2022-04-17T08:44:29Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)

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.