Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
From MaRDI portal
(Redirected from Publication:4629598)
Bell nonlocalityinformation theorymarginal problempolyhedral projectionquantum entanglementShannon entropy
General and philosophical questions in quantum theory (81P05) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Information theory (general) (94A15) Measures of information, entropy (94A17)
Abstract: Marginal problems naturally arise in a variety of different fields: basically, the question is whether some marginal/partial information is compatible with a joint probability distribution. To this aim, the characterization of marginal sets via quantifier elimination and polyhedral projection algorithms is of primal importance. In this work, before considering specific problems, we review polyhedral projection algorithms with focus on applications in information theory, and, alongside known algorithms, we also present a newly developed geometric algorithm which walks along the face lattice of the polyhedron in the projection space. One important application of this is in the field of quantum non-locality, where marginal problems arise in the computation of Bell inequalities. We apply the discussed algorithms to discover many tight entropic Bell inequalities of the tripartite Bell scenario as well as more complex networks arising in the field of causal inference. Finally, we analyze the usefulness of these inequalities as nonlocality witnesses by searching for violating quantum states.
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- A recursive parametrization of unitary matrices
- Algebraic geometry of Bayesian networks
- An Algorithm for Convex Polytopes
- An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone
- An optimal convex hull algorithm in any fixed dimension
- Analysing causal structures with entropy
- Bell correlations in a Bose-Einstein condensate
- Bell inequalities for arbitrarily high-dimensional systems
- Bell inequalities from variable-elimination methods
- Beyond Bell's theorem: correlation scenarios
- Causal structures from entropic information: geometry and novel scenarios
- Causality. Models, reasoning, and inference
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Characterizing entanglement
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Correlation polytopes: Their geometry and complexity
- Detecting nonlocality in many-body quantum states
- Entropic Inequalities and Marginal Problems
- Entropy and information causality in general probabilistic theories
- Entropy in general physical theories
- Fourier algorithm revisited
- Fourier's Method of Linear Programming and Its Dual
- Generating all vertices of a polyhedron is hard
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 3557513 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Information theory and network coding
- Maximal qubit violation of n-locality inequalities in a star-shaped quantum network
- On the graph structure of convex polyhedra in n-space
- PANDA: a software for polyhedral transformations
- Polynomial algorithms in linear programming
- Polynomial Bell inequalities
- Practical issues on the projection of polyhedral sets
- Probing the quantum-classical boundary with compression software
- Proposed experiment to test local hidden-variable theories
- Quantum probability - quantum logic
- Real quantifier elimination is doubly exponential
- Separability and distillability in composite quantum systems - a primer
- Separability Criterion for Density Matrices
- Separability of mixed states: necessary and sufficient conditions.
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
- Static Analysis
- Strong NP-hardness of the quantum separability problem
- The entropic approach to causal correlations
- The maximum numbers of faces of a convex polytope
- Theory-independent limits on correlations from generalized Bayesian networks
- Tsirelson's bound from a generalized data processing inequality
- Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices
Cited in
(2)
This page was built for publication: Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629598)
