Expanding bipartite Bell inequalities for maximum multi-partite randomness

• URL: http://arxiv.org/abs/2308.07030v1
• Date: Mon, 14 Aug 2023 09:41:04 GMT
• Title: Expanding bipartite Bell inequalities for maximum multi-partite randomness
• Authors: Lewis Wooltorton and Peter Brown and Roger Colbeck
• Abstract summary: 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.
• Score: 0.9208007322096533
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nonlocal tests on multipartite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult. For example, extremal Bell inequalities are tight witnesses of nonlocality, however achieving their maximum violation places constraints on the underlying quantum system, which can reduce the rate of randomness generation. As a result there is often a trade-off between maximum randomness and the amount of violation of a given Bell inequality. Here, we explore this trade-off for more than two parties. More precisely, we study the maximum amount of randomness that can be certified by correlations exhibiting a violation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. We find that maximum quantum violation and maximum randomness are incompatible for any even number of parties, with incompatibility diminishing as the number of parties grow, and conjecture the precise trade-off. We also show that maximum MABK violation is not necessary for maximum randomness for odd numbers of parties. To obtain our results, 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, showing how intuition learned in the bipartite case can find use in more complex scenarios.

Related papers

• 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)
• Optimal Multi-Distribution Learning [88.3008613028333]
  Multi-distribution learning seeks to learn a shared model that minimizes the worst-case risk across $k$ distinct data distributions. We propose a novel algorithm that yields an varepsilon-optimal randomized hypothesis with a sample complexity on the order of (d+k)/varepsilon2.
  arXiv  Detail & Related papers  (2023-12-08T16:06:29Z)
• Device-independent randomness based on a tight upper bound of the maximal quantum value of chained inequality [11.658472781897123]
  We derive the tight upper bound of the maximum quantum value for chained Bell inequality with arbitrary number of measurements. Based on the tight upper bound we present the lower bounds on the device independent randomness with respect to the Werner states.
  arXiv  Detail & Related papers  (2023-05-23T14:10:03Z)
• 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)
• Bell inequalities with overlapping measurements [52.81011822909395]
  We study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
  arXiv  Detail & Related papers  (2023-03-03T18:11:05Z)
• 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)
• Bell inequality violations with random mutually unbiased bases [0.0]
  We investigate the problem of exhibiting Bell nonlocality for a two-qudit entangled pure state using a randomly chosen set of mutually unbiased bases. We find that even if we employ only two-setting Bell inequalities, we find a significant chance of obtaining a Bell violation if the two parties are individually allowed to measure a sufficient number of MUBs.
  arXiv  Detail & Related papers  (2022-05-09T04:51:30Z)
• An elegant proof of self-testing for multipartite Bell inequalities [0.0]
  This work presents a simple and broadly applicable self-testing argument for N-partite correlation Bell inequalities with two binary outcome observables per party. To showcase the versatility of our proof technique, we obtain self-testing statements for N party Mermin-Ardehali-Bei-Klyshko (MABK) and Werner-Wolf-Weinfurter-.Zukowski-Brukner (WWW.ZB) family of linear Bell inequalities.
  arXiv  Detail & Related papers  (2022-02-14T18:00:50Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting [81.70513857417106]
  We design and analyze CascadeBAI, an algorithm for finding the best set of $K$ items. An upper bound on the time complexity of CascadeBAI is derived by overcoming a crucial analytical challenge. We show, through the derivation of a lower bound on the time complexity, that the performance of CascadeBAI is optimal in some practical regimes.
  arXiv  Detail & Related papers  (2020-01-23T16:47:52Z)
• 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.