Harnessing Causal Indefiniteness for Accessing Locally Inaccessible Data

• URL: http://arxiv.org/abs/2407.20543v2
• Date: Fri, 07 Mar 2025 05:59:59 GMT
• Title: Harnessing Causal Indefiniteness for Accessing Locally Inaccessible Data
• Authors: Sahil Gopalkrishna Naik, Samrat Sen, Ram Krishna Patra, Ananya Chakraborty, Mir Alimuddin, Manik Banik, Pratik Ghosal,
• Abstract summary: We investigate causal indefiniteness in the classical Data Retrieval task.<n>We show that those embedded in an indefinite causal structure generally outperform those operating within a definite causal framework.<n>We also report an intriguing super-activation phenomenon, where two quantum processes, each individually inefficient for the DR task, become useful when combined.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent studies suggest that physical theories can exhibit indefinite causal structures, where the causal order of events is fundamentally undefined yet logically consistent. Beyond its foundational appeal, causal indefiniteness has also emerged as a novel information-theoretic resource, offering advantages in various information processing tasks. Here, we investigate its utility in the classical Data Retrieval (DR) task. In its simplest version, a referee encodes classical messages into bipartite quantum states and distributes the local parts to two distant parties, ensuring that neither can independently extract any information about the encoded message. To retrieve their assigned data, parties must collaborate, and we show that those embedded in an indefinite causal structure generally outperform those operating within a definite causal framework. For the bipartite case, we establish a duality between the DR task and the well known Guess Your Neighbour's Input game and derive a criterion analogous to the Peres-Horodecki separability test to identify quantum processes that yield nontrivial success in the DR task. We also report an intriguing super-activation phenomenon, where two quantum processes, each individually inefficient for the DR task, become useful when combined. Extending the analysis to tripartite case, we show that classical causally inseparable processes can outperform quantum bi-causal processes in the DR task. Our study, thus, reveals several unexplored aspects of causal indefiniteness, inviting deeper investigation.

Related papers

• Simulating Noncausality with Quantum Control of Causal Orders [0.0]
  We show that the SHIFT measurement can be implemented using a quantum switch of classical communications. This shows that the structure of the Lugano process can be simulated by a quantum switch and that successful SHIFT discrimination witnesses causal nonseparability rather than noncausality.
  arXiv  Detail & Related papers  (2025-02-21T16:39:55Z)
• Rethinking State Disentanglement in Causal Reinforcement Learning [78.12976579620165]
  Causality provides rigorous theoretical support for ensuring that the underlying states can be uniquely recovered through identifiability. We revisit this research line and find that incorporating RL-specific context can reduce unnecessary assumptions in previous identifiability analyses for latent states. We propose a novel approach for general partially observable Markov Decision Processes (POMDPs) by replacing the complicated structural constraints in previous methods with two simple constraints for transition and reward preservation.
  arXiv  Detail & Related papers  (2024-08-24T06:49:13Z)
• New Rules for Causal Identification with Background Knowledge [59.733125324672656]
  We propose two novel rules for incorporating BK, which offer a new perspective to the open problem. We show that these rules are applicable in some typical causality tasks, such as determining the set of possible causal effects with observational data.
  arXiv  Detail & Related papers  (2024-07-21T20:21:21Z)
• Robustness of contextuality under different types of noise as quantifiers for parity-oblivious multiplexing tasks [0.0]
  We use analytical and numerical tools to estimate robustness of contextuality in POM scenarios under different types of noise. We obtain a general relation between robustness of contextuality to depolarisation and the success rate in any $n$-to-1 POM scenario.
  arXiv  Detail & Related papers  (2024-06-18T16:43:43Z)
• To Believe or Not to Believe Your LLM [51.2579827761899]
  We explore uncertainty quantification in large language models (LLMs) We derive an information-theoretic metric that allows to reliably detect when only epistemic uncertainty is large. We conduct a series of experiments which demonstrate the advantage of our formulation.
  arXiv  Detail & Related papers  (2024-06-04T17:58:18Z)
• Identifiable Latent Neural Causal Models [82.14087963690561]
  Causal representation learning seeks to uncover latent, high-level causal representations from low-level observed data. We determine the types of distribution shifts that do contribute to the identifiability of causal representations. We translate our findings into a practical algorithm, allowing for the acquisition of reliable latent causal representations.
  arXiv  Detail & Related papers  (2024-03-23T04:13:55Z)
• Alternative robust ways of witnessing nonclassicality in the simplest scenario [0.0]
  We relate notions of nonclassicality in the simplest nontrivial scenario. We use an approach based on the notion of bounded ontological distinctness for preparations. As an application of our findings, we treat the case of two-bit parity-oblivious multiplexing in the presence of noise.
  arXiv  Detail & Related papers  (2023-11-22T15:41:34Z)
• 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)
• Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario [0.0]
  We present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy. Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties.
  arXiv  Detail & Related papers  (2023-03-13T20:42:53Z)
• 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)
• Active Bayesian Causal Inference [72.70593653185078]
  We propose Active Bayesian Causal Inference (ABCI), a fully-Bayesian active learning framework for integrated causal discovery and reasoning. ABCI jointly infers a posterior over causal models and queries of interest. We show that our approach is more data-efficient than several baselines that only focus on learning the full causal graph.
  arXiv  Detail & Related papers  (2022-06-04T22:38:57Z)
• BaCaDI: Bayesian Causal Discovery with Unknown Interventions [118.93754590721173]
  BaCaDI operates in the continuous space of latent probabilistic representations of both causal structures and interventions. In experiments on synthetic causal discovery tasks and simulated gene-expression data, BaCaDI outperforms related methods in identifying causal structures and intervention targets.
  arXiv  Detail & Related papers  (2022-06-03T16:25:48Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Semi-Device-Independent Certification of Causal Nonseparability with Trusted Quantum Inputs [0.0]
  Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario. We show that certain causally nonseparable processes which cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations.
  arXiv  Detail & Related papers  (2021-07-22T18:14:04Z)
• Discovering Latent Causal Variables via Mechanism Sparsity: A New Principle for Nonlinear ICA [81.4991350761909]
  Independent component analysis (ICA) refers to an ensemble of methods which formalize this goal and provide estimation procedure for practical application. We show that the latent variables can be recovered up to a permutation if one regularizes the latent mechanisms to be sparse.
  arXiv  Detail & Related papers  (2021-07-21T14:22:14Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Background Independence and Quantum Causal Structure [0.0]
  One of the key ways in which quantum mechanics differs from relativity is that it requires a fixed background reference frame for spacetime. A combination of the two theories is expected to yield non-classical, or "indefinite", causal structures. We present a background-independent formulation of the process matrix formalism.
  arXiv  Detail & Related papers  (2021-06-02T09:13:13Z)
• Simple and maximally robust processes with no classical common-cause or direct-cause explanation [0.0]
  We analyze the minimum requirements for a quantum process to fail to admit a CCDC explanation. We present "simple" processes, which we prove to be the most robust ones against general noise. We also present a semi-definite hierarchy that can detect and quantify the non-classical CCDC programminges of every non-classical CCDC process.
  arXiv  Detail & Related papers  (2021-01-27T19:00:05Z)

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.