Nonclassicality in correlations without causal order
- URL: http://arxiv.org/abs/2307.02565v1
- Date: Wed, 5 Jul 2023 18:04:16 GMT
- Title: Nonclassicality in correlations without causal order
- Authors: Ravi Kunjwal and Ognyan Oreshkov
- Abstract summary: We propose a notion of classicality for correlations--termed deterministic consistency--that goes beyond causal inequalities.
A key contribution of this work is an explicit nonclassicality witness that goes beyond causal inequalities.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Causal inequalities are device-independent constraints on correlations
realizable via local operations under the assumption of definite causal order
between these operations. While causal inequalities in the bipartite scenario
require nonclassical resources within the process-matrix framework for their
violation, there exist tripartite causal inequalities that admit violations
with classical resources. The tripartite case puts into question the status of
a causal inequality violation as a witness of nonclassicality, i.e., there is
no a priori reason to believe that quantum effects are in general necessary for
a causal inequality violation. Here we propose a notion of classicality for
correlations--termed deterministic consistency--that goes beyond causal
inequalities. We refer to the failure of deterministic consistency for a
correlation as its antinomicity, which serves as our notion of nonclassicality.
Deterministic consistency is motivated by a careful consideration of the
appropriate generalization of Bell inequalities--which serve as witnesses of
nonclassicality for non-signalling correlations--to the case of correlations
without any non-signalling constraints. This naturally leads us to the
classical deterministic limit of the process matrix framework as the
appropriate analogue of a local hidden variable model. We then define a
hierarchy of sets of correlations--from the classical to the most
nonclassical--and prove strict inclusions between them. We also propose a
measure for the antinomicity of correlations--termed 'robustness of
antinomy'--and apply our framework in bipartite and tripartite scenarios. A key
contribution of this work is an explicit nonclassicality witness that goes
beyond causal inequalities, inspired by a modification of the Guess Your
Neighbour's Input (GYNI) game that we term the Guess Your Neighbour's Input or
NOT (GYNIN) game.
Related papers
- Refined Tsirelson Bounds on Multipartite Bell Inequalities [0.0]
We present refined Tsirelson (quantum) bounds on the Svetlichny and Mermin-Klyshko inequalities.
We analyze concrete examples in which our bounds are strictly tighter than the known bounds.
arXiv Detail & Related papers (2024-06-23T19:44:45Z) - Fairness-Accuracy Trade-Offs: A Causal Perspective [58.06306331390586]
We analyze the tension between fairness and accuracy from a causal lens for the first time.
We show that enforcing a causal constraint often reduces the disparity between demographic groups.
We introduce a new neural approach for causally-constrained fair learning.
arXiv Detail & Related papers (2024-05-24T11:19:52Z) - Tsirelson bounds for quantum correlations with indefinite causal order [4.162019309587634]
We provide a general method for bounding the violation of arbitrary causal inequalities.
We prove that the maximum violation is generally smaller than the algebraic maximum.
Surprisingly, we find that the algebraic maximum of arbitrary causal inequalities can be achieved by a new type of processes.
arXiv Detail & Related papers (2024-03-05T08:07:10Z) - Relating Wigner's Friend Scenarios to Nonclassical Causal Compatibility, Monogamy Relations, and Fine Tuning [0.7421845364041001]
We show that the LF no-go theorem poses formidable challenges for the field of causal modeling.
We prove that no nonclassical causal model can explain violations of LF inequalities without violating the No Fine-Tuning principle.
arXiv Detail & Related papers (2023-09-22T16:32:39Z) - Classifying Causal Structures: Ascertaining when Classical Correlations
are Constrained by Inequalities [0.0]
We develop methods for detecting causal scenarios that impose inequality constraints versus those which do not.
Many scenarios with exclusively equality constraints can be detected via a condition articulated by Henson, Lal and Pusey.
We are able to resolve all but three causal scenarios, providing evidence that the HLP condition is, in fact, exhaustive.
arXiv Detail & Related papers (2023-08-04T15:23:55Z) - Invariant Causal Set Covering Machines [64.86459157191346]
Rule-based models, such as decision trees, appeal to practitioners due to their interpretable nature.
However, the learning algorithms that produce such models are often vulnerable to spurious associations and thus, they are not guaranteed to extract causally-relevant insights.
We propose Invariant Causal Set Covering Machines, an extension of the classical Set Covering Machine algorithm for conjunctions/disjunctions of binary-valued rules that provably avoids spurious associations.
arXiv Detail & Related papers (2023-06-07T20:52:01Z) - Nonparametric Identifiability of Causal Representations from Unknown
Interventions [63.1354734978244]
We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables.
Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
arXiv Detail & Related papers (2023-06-01T10:51:58Z) - Fairness and robustness in anti-causal prediction [73.693135253335]
Robustness to distribution shift and fairness have independently emerged as two important desiderata required of machine learning models.
While these two desiderata seem related, the connection between them is often unclear in practice.
By taking this perspective, we draw explicit connections between a common fairness criterion - separation - and a common notion of robustness.
arXiv Detail & Related papers (2022-09-20T02:41:17Z) - Causal Expectation-Maximisation [70.45873402967297]
We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs.
We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables.
We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
arXiv Detail & Related papers (2020-11-04T10:25:13Z) - A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
We propose a weaker assumption that we call $2$-adjacency faithfulness.
We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
arXiv Detail & Related papers (2020-10-27T13:04:08Z) - Anomalous non-classicality via correlative and entropic Bell
inequalities [0.0]
We find that the violation of the correlative Bell inequality does not entail a violation of the correlative Bell inequality for certain parameter values.
This anomaly helps to precisely qualify the type of non-classical resource.
We identify the 'exotic' type that gives rise to non-classical resources under all non-equivalent operational party assignments.
arXiv Detail & Related papers (2020-07-07T13:57:21Z)
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.