Abstract
A central question for causal inference is to decide whether a set of correlations fits a given causal structure. In general, this decision problem is computationally infeasible and hence several approaches have emerged that look for certificates of compatibility. Here, we review several such approaches based on entropy. We bring together the key aspects of these entropic techniques with unified terminology, filling several gaps and establishing new connections, all illustrated with examples. We consider cases where unobserved causes are classical, quantum and post-quantum, and discuss what entropic analyses tell us about the difference. This difference has applications to quantum cryptography, where it can be crucial to eliminate the possibility of classical causes. We discuss the achievements and limitations of the entropic approach in comparison to other techniques and point out the main open problems.
Funder
Engineering and Physical Sciences Research Council
Subject
General Physics and Astronomy,General Engineering,General Mathematics
Reference116 articles.
1. Causality
2. Geiger D Meek C. 1999 Quantifier elimination for statistical problems. In Proc. of the Fifteenth Conf. on Uncertainty in Artificial Intelligence Pavia Italy 17–20 June pp. 226–235. Burlington MA: Morgan Kaufmann Publishers Inc.
3. Algebraic geometry of Bayesian networks
4. Causal inference via algebraic geometry: feasibility tests for functional causal structures with two binary observed variables;Lee CM;J. Causal Inf.,2017
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献