When Quantum Nonlocality Does Not Play Dice

• URL: http://arxiv.org/abs/2408.03665v2
• Date: Wed, 10 Sep 2025 14:10:47 GMT
• Title: When Quantum Nonlocality Does Not Play Dice
• Authors: Ravishankar Ramanathan, Yuan Liu, Stefano Pironio,
• Abstract summary: Bell inequality violations are often taken as evidence that quantum nonlocality guarantees intrinsic randomness.<n>We show that there exist nontrivial Bell inequalities that are maximally violated by quantum correlations yet fail to certify randomness for any fixed input pair.<n>We construct maximally nonlocal quantum correlations that are deterministic for every fixed input pair.
• Score: 3.722125357019147
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bell inequality violations are often taken as evidence that quantum nonlocality guarantees intrinsic randomness, effectively playing the role of a "dice" at the heart of many device-independent cryptographic protocols. We show that there exist nontrivial Bell inequalities that are maximally violated by quantum correlations yet fail to certify randomness for any fixed input pair, rendering them useless for a large class of standard device-independent schemes. This is achieved through a systematic construction based on symmetric deterministic extensions of nonlocal games. We further construct maximally nonlocal quantum correlations that are deterministic for every fixed input pair, in the sense that for any chosen inputs they admit a convex decomposition into strategies with fixed outputs for those inputs. In the no-signalling framework, this property corresponds to the "bound randomness" of [Ac\'in et al., PRA 93, 012319 (2016)], where an adversary-once learning the inputs-can steer the correlations into a decomposition that makes the outputs fully predictable, thereby making them useless in most existing device-independent protocols. In contrast, bound randomness is impossible in quantum theory: any quantum correlations that become deterministic once the inputs are revealed must in fact be local. Our results pinpoint the precise limits of determinism compatible with quantum nonlocality.

Related papers

• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• No Bound Randomness in Quantum Nonlocality [3.4072037792858034]
  In DI randomness amplification protocols, any amount of quantum nonlocality is sufficient to certify randomness.<n>In contrast to the hitherto considered fixed-input guessing probability, the average guessing probability over all inputs is a faithful and monotonic measure of nonlocality.
  arXiv  Detail & Related papers  (2025-09-10T14:19:51Z)
• 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)
• Necessary and Sufficient Condition for Randomness Certification from Incompatibility [5.38013403786666]
  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.
  arXiv  Detail & Related papers  (2024-09-23T13:13:47Z)
• 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)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Some consequences of Sica's approach to Bell's inequalities [55.2480439325792]
  Louis Sica derived Bell's inequalities from the hypothesis that the time series of outcomes observed in one station does not change if the setting in the other station is changed. In this paper, Sica's approach is extended to series with non ideal efficiency and to the actual time structure of experimental data.
  arXiv  Detail & Related papers  (2024-03-05T13:59:52Z)
• 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)
• 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)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• 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)
• 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)
• Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism [103.36492220921109]
  We show that although Strong Proportionality is a well-motivated and basic axiom, there is no deterministic strategyproof mechanism satisfying the property. We then identify a randomized mechanism called Random Rank which satisfies Strong Proportionality in expectation. Our main characterizes Random Rank as the unique mechanism that achieves universal truthfulness, universal anonymity, and Strong Proportionality in expectation.
  arXiv  Detail & Related papers  (2022-05-30T00:51:57Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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)
• Semi-Device-Independent Certification of Causal Nonseparability with Trusted Quantum Inputs [0.0]
  Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario. We show that certain causally nonseparable processes which cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations.
  arXiv  Detail & Related papers  (2021-07-22T18:14:04Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• 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)
• Bell's theorem for trajectories [62.997667081978825]
  A trajectory is not an outcome of a quantum measurement, in the sense that there is no observable associated with it. We show how to overcome this problem by considering a special case of our generic inequality that can be experimentally tested point-by-point in time.
  arXiv  Detail & Related papers  (2020-01-03T01:40:44Z)

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.