Characterizing Hybrid Causal Structures with the Exclusivity Graph Approach

• URL: http://arxiv.org/abs/2401.00063v1
• Date: Fri, 29 Dec 2023 19:44:38 GMT
• Title: Characterizing Hybrid Causal Structures with the Exclusivity Graph Approach
• Authors: Giovanni Rodari, Davide Poderini, Emanuele Polino, Alessia Suprano, Fabio Sciarrino, Rafael Chaves
• Abstract summary: We extend a graph theoretical technique to explore classical, quantum, and no-signaling distributions in hybrid scenarios. We show how with our method we can construct minimal Bell-like inequalities capable of simultaneously distinguishing classical, quantum, and no-signaling behaviors. The demonstrated method will represent a powerful tool to study quantum networks and for applications in quantum information tasks.
• Score: 0.41942958779358674
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Analyzing the geometry of correlation sets constrained by general causal structures is of paramount importance for foundational and quantum technology research. Addressing this task is generally challenging, prompting the development of diverse theoretical techniques for distinct scenarios. Recently, novel hybrid scenarios combining different causal assumptions within different parts of the causal structure have emerged. In this work, we extend a graph theoretical technique to explore classical, quantum, and no-signaling distributions in hybrid scenarios, where classical causal constraints and weaker no-signaling ones are used for different nodes of the causal structure. By mapping such causal relationships into an undirected graph we are able to characterize the associated sets of compatible distributions and analyze their relationships. In particular we show how with our method we can construct minimal Bell-like inequalities capable of simultaneously distinguishing classical, quantum, and no-signaling behaviors, and efficiently estimate the corresponding bounds. The demonstrated method will represent a powerful tool to study quantum networks and for applications in quantum information tasks.

Related papers

• Cyclic quantum causal modelling with a graph separation theorem [0.0]
  We introduce a robust probability rule and a novel graph-separation property, p-separation, which we prove to be sound and complete for all such models. Our approach maps cyclic causal models to acyclic ones with post-selection, leveraging the post-selected quantum teleportation protocol.
  arXiv  Detail & Related papers  (2025-02-06T15:51:15Z)
• Generalization Performance of Hypergraph Neural Networks [21.483543928698676]
  We develop margin-based generalization bounds for four representative classes of hypergraph neural networks. Our results reveal the manner in which hypergraph structure and spectral norms of the learned weights can affect the generalization bounds. Our empirical study examines the relationship between the practical performance and theoretical bounds of the models over synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2025-01-22T00:20:26Z)
• Quantum-enhanced causal discovery for a small number of samples [0.6665442733069773]
  This study proposes a novel quantum Peter-Clark (qPC) algorithm for causal discovery that does not assume any underlying model structures. We conducted systematic experiments on fundamental graph parts of causal structures, demonstrating that the qPC algorithm exhibits a significantly better performance. Our theoretical and experimental results demonstrate that the proposed quantum algorithm can empower classical algorithms for robust and accurate inference.
  arXiv  Detail & Related papers  (2025-01-09T07:05:22Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• Chordal Graphs and Distinguishability of Quantum Product States [0.0]
  We identify chordality as the key graph structure that drives distinguishability in one-way LOCC. We derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions.
  arXiv  Detail & Related papers  (2023-05-17T12:17:47Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• 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)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Localisation in quasiperiodic chains: a theory based on convergence of local propagators [68.8204255655161]
  We present a theory of localisation in quasiperiodic chains with nearest-neighbour hoppings, based on the convergence of local propagators. Analysing the convergence of these continued fractions, localisation or its absence can be determined, yielding in turn the critical points and mobility edges. Results are exemplified by analysing the theory for three quasiperiodic models covering a range of behaviour.
  arXiv  Detail & Related papers  (2021-02-18T16:19:52Z)
• Developing Constrained Neural Units Over Time [81.19349325749037]
  This paper focuses on an alternative way of defining Neural Networks, that is different from the majority of existing approaches. The structure of the neural architecture is defined by means of a special class of constraints that are extended also to the interaction with data. The proposed theory is cast into the time domain, in which data are presented to the network in an ordered manner.
  arXiv  Detail & Related papers  (2020-09-01T09:07:25Z)
• Emergent entanglement structures and self-similarity in quantum spin chains [0.0]
  We introduce an experimentally accessible network representation for many-body quantum states based on entanglement between all pairs of its constituents. We illustrate the power of this representation by applying it to a paradigmatic spin chain model, the XX model, and showing that it brings to light new phenomena.
  arXiv  Detail & Related papers  (2020-07-14T12:13:29Z)

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.