Polynomial Bell inequalities
From MaRDI portal
Abstract: It is a recent realization that many of the concepts and tools of causal discovery in machine learning are highly relevant to problems in quantum information, in particular quantum nonlocality. The crucial ingredient in the connection between both fields is the tool of Bayesian networks, a graphical model used to reason about probabilistic causation. Indeed, Bell's theorem concerns a particular kind of a Bayesian network and Bell inequalities are a special case of linear constraints following from such models. It is thus natural to look for generalized Bell scenarios involving more complex Bayesian networks. The problem, however, relies on the fact that such generalized scenarios are characterized by polynomial Bell inequalities and no current method is available to derive them beyond very simple cases. In this work, we make a significant step in that direction, providing a general and practical method for the derivation of polynomial Bell inequalities in a wide class of scenarios, applying it to a few cases of interest. We also show how our construction naturally gives rise to a notion of non-signalling in generalized networks.
Recommendations
- Causal structures from entropic information: geometry and novel scenarios
- The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning
- Beyond Bell's theorem. II: Scenarios with arbitrary causal structure
- Theory-independent limits on correlations from generalized Bayesian networks
- Avenues to generalising Bell inequalities
Cites work
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- Algebraic geometry of Bayesian networks
- An optimal convex hull algorithm in any fixed dimension
- Bell inequalities for arbitrarily high-dimensional systems
- Bell inequalities from variable-elimination methods
- Bell's Inequalities and Density Matrices: Revealing “Hidden” Nonlocality
- Bell's inequalities and quantum communication complexity
- Bell's theorem for general N-qubit states
- Correlation polytopes: Their geometry and complexity
- Entropic Inequalities and Marginal Problems
- Fourier's Method of Linear Programming and Its Dual
- scientific article; zbMATH DE number 5317666 (Why is no real title available?)
- Nonlinear Bell inequalities tailored for quantum networks
- On modifications of Reichenbach's principle of common cause in light of Bell's theorem
- Real quantifier elimination is doubly exponential
- The complexity of linear problems in fields
Cited in
(42)- Generalized quantum no-go theorems of pure states
- Universality of the spherical collapse with respect to the matter type: the case of a barotropic fluid with linear equation of state
- Optimization over trace polynomials
- Restricted distribution of quantum correlations in bilocal network
- Characterizing nonbilocal correlation: a geometric perspective
- Generalization of measurement-induced nonlocality In the bilocal scenario
- Quantifying measurement-induced nonbilocal correlation
- Device-independently verifying full network nonlocality of quantum networks
- Polyhedral duality in Bell scenarios with two binary observables
- Nonlinear Bell inequalities tailored for quantum networks
- Full 3D numerical relativity simulations of neutron star-boson star collisions with BAM
- The eccentric behavior of inspiralling compact binaries
- A Quantum Multi-Proxy Blind Signature Scheme Based on Entangled Four-Qubit Cluster State
- Bell's Inequalities and Algebraic Structure
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
- Analysing causal structures with entropy
- Stochastic movement subject to a reset-and-residence mechanism: transport properties and first arrival statistics
- Nonlocality of a type of multi-star-shaped quantum networks
- Record statistics for random walks and Lévy flights with resetting
- Heterogeneous diffusion with stochastic resetting
- Causal structures from entropic information: geometry and novel scenarios
- Exact fluctuating hydrodynamics of active lattice gases—typical fluctuations
- Extremely high-order convergence in simulations of relativistic stars
- EHT tests of the strong-field regime of general relativity
- Polynomial representation of quantum entanglement
- Entanglement without hidden nonlocality
- Optimal mean first-passage time of a Brownian searcher with resetting in one and two dimensions: experiments, theory and numerical tests
- Beyond Bell's theorem. II: Scenarios with arbitrary causal structure
- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- Optimal Quantum Violations of n‐Locality Inequalities with Conditional Dependence on Inputs
- Revisited aspects of the local set in CHSH Bell scenario
- Generalized n‐Locality Inequalities in Linear‐Chain Network for Arbitrary Inputs Scenario and Their Quantum Violations
- Correlations in star networks: from Bell inequalities to network inequalities
- A convergent inflation hierarchy for quantum causal structures
- Star network quantum steering
- Maximal qubit violation of n-locality inequalities in a star-shaped quantum network
- The entropic approach to causal correlations
- Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square
- Entanglement criterion and strengthened Bell inequalities based on the Pearson correlation
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Black hole solutions in theory of ModMax-dRGT-like massive gravity
- Measurement incompatibility based in-equivalence between Bell and network nonlocality
This page was built for publication: Polynomial Bell inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960675)
