Revealing Incommensurability between Device-Independent Randomness, Nonlocality, and Entanglement using Hardy and Hardy-type Relations

• URL: http://arxiv.org/abs/2011.12518v3
• Date: Thu, 18 May 2023 05:23:52 GMT
• Title: Revealing Incommensurability between Device-Independent Randomness, Nonlocality, and Entanglement using Hardy and Hardy-type Relations
• Authors: Souradeep Sasmal, Ashutosh Rai, Sayan Gangopadhyay, Dipankar Home, Urbasi Sinha
• Abstract summary: We quantify randomness certified device-independently by using the Hardy and Cabello-Liang-Li (CLL) nonlocality relations. For the Hardy nonlocality, it is revealed that for a given amount of nonlocality signified by a particular non-zero value of the Hardy parameter, the amount of Hardy-certifiable randomness is not unique. On the other hand, for a given amount of CLL-nonlocality, the certifiable randomness is unique, similar to that for the CHSH nonlocality.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A comprehensive treatment of the quantification of randomness certified device-independently by using the Hardy and Cabello-Liang-Li (CLL) nonlocality relations is provided in the two parties - two measurements per party - two outcomes per measurement (2-2-2) scenario. For the Hardy nonlocality, it is revealed that for a given amount of nonlocality signified by a particular non-zero value of the Hardy parameter, the amount of Hardy-certifiable randomness is not unique, unlike the way the amount of certifiable randomness is related to the CHSH nonlocality. This is because any specified non-maximal value of Hardy nonlocality parameter characterises a set of quantum extremal distributions. Then this leads to a range of certifiable amounts of randomness corresponding to a given Hardy parameter. On the other hand, for a given amount of CLL-nonlocality, the certifiable randomness is unique, similar to that for the CHSH nonlocality. Furthermore, the tightness of our analytical treatment evaluating the respective guaranteed bounds for the Hardy and CLL relations is demonstrated by their exact agreement with the Semi-Definite-Programming based computed bounds. Interestingly, the analytically evaluated maximum achievable bounds of both Hardy and CLL-certified randomness have been found to be realisable for non-maximal values of the Hardy and CLL nonlocality parameters. In particular, we have shown that even close to the maximum 2 bits of CLL-certified randomness can be realised from non-maximally entangled pure two-qubit states corresponding to small values of the CLL nonlocal parameter. This, therefore, clearly illustrates the quantitative incommensurability between randomness, nonlocality and entanglement.

Related papers

• A Skewness-Based Criterion for Addressing Heteroscedastic Noise in Causal Discovery [47.36895591886043]
  We investigate heteroscedastic symmetric noise models (HSNMs) We introduce a novel criterion for identifying HSNMs based on the skewness of the score (i.e., the gradient of the log density) of the data distribution. We propose SkewScore, an algorithm that handles heteroscedastic noise without requiring the extraction of external noise.
  arXiv  Detail & Related papers  (2024-10-08T22:28:30Z)
• Incorporating Zero-Probability Constraints to Device-Independent Randomness Expansion [11.765274200974774]
  We explore various forms of randomness that are certifiable in the so-called device-independent (DI) paradigm. In this work, we determine the certifiable randomness when zero-probability constraints are incorporated into the task of DI randomness expansion.
  arXiv  Detail & Related papers  (2024-01-16T15:57:17Z)
• Off-policy estimation of linear functionals: Non-asymptotic theory for semi-parametric efficiency [59.48096489854697]
  The problem of estimating a linear functional based on observational data is canonical in both the causal inference and bandit literatures. We prove non-asymptotic upper bounds on the mean-squared error of such procedures. We establish its instance-dependent optimality in finite samples via matching non-asymptotic local minimax lower bounds.
  arXiv  Detail & Related papers  (2022-09-26T23:50:55Z)
• 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)
• Tilted Hardy paradoxes for device-independent randomness extraction [5.802194744651422]
  We introduce a family of tilted Hardy paradoxes that allow to self-test general pure two-qubit entangled states. We also introduce a family of Hardy tests for maximally entangled states of local dimension $4, 8$ as the potential candidates for DI randomness extraction.
  arXiv  Detail & Related papers  (2022-05-05T16:30:28Z)
• Tight analytic bound on the trade-off between device-independent randomness and nonlocality [1.7188280334580197]
  Two parties sharing entangled quantum systems can generate correlations that cannot be produced using only shared classical resources. These nonlocal correlations are a fundamental feature of quantum theory but also have practical applications. The amount of certifiable randomness that can be generated from some given non-local correlations is a key quantity of interest.
  arXiv  Detail & Related papers  (2022-04-30T01:40:15Z)
• Nonparametric Conditional Local Independence Testing [69.31200003384122]
  Conditional local independence is an independence relation among continuous time processes. No nonparametric test of conditional local independence has been available. We propose such a nonparametric test based on double machine learning.
  arXiv  Detail & Related papers  (2022-03-25T10:31:02Z)
• Dense Uncertainty Estimation via an Ensemble-based Conditional Latent Variable Model [68.34559610536614]
  We argue that the aleatoric uncertainty is an inherent attribute of the data and can only be correctly estimated with an unbiased oracle model. We propose a new sampling and selection strategy at train time to approximate the oracle model for aleatoric uncertainty estimation. Our results show that our solution achieves both accurate deterministic results and reliable uncertainty estimation.
  arXiv  Detail & Related papers  (2021-11-22T08:54:10Z)
• Robust Uncertainty Bounds in Reproducing Kernel Hilbert Spaces: A Convex Optimization Approach [9.462535418331615]
  It is known that out-of-sample bounds can be established at unseen input locations. We show how computing tight, finite-sample uncertainty bounds amounts to solving parametrically constrained linear programs.
  arXiv  Detail & Related papers  (2021-04-19T19:27:52Z)
• Device-independent bounds from Cabello's nonlocality argument [0.0]
  Hardy-type arguments manifest Bell nonlocality in one of the simplest possible ways. We show that the maximum quantum value for Cabello's nonlocality is achieved by a pure two-qubit state and projective measurements.
  arXiv  Detail & Related papers  (2021-03-17T21:28:49Z)
• Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality [92.35257908210316]
  We study the problem of estimating a low-rank tensor given incomplete and corrupted observations. We find that it attains unimprovable rates $ell-2$ accuracy.
  arXiv  Detail & Related papers  (2020-06-15T17:47:13Z)

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.