Quantum Causal Unravelling
arXiv:2109.13166 · doi:10.1038/s41534-022-00578-4
Abstract
Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process, under the assumption that the process has bounded information loss and induces causal dependencies whose strength is above a fixed (but otherwise arbitrary) threshold. Our method is based on a quantum algorithm whose complexity scales polynomially in the total number of input/output systems, in the dimension of the systems involved in each interaction, and in the inverse of the chosen threshold for the strength of the causal dependencies. Under additional assumptions, we also provide a second algorithm that has lower complexity and requires only local state preparation and local measurements. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography. Similarly, they can be used to identify useful communication channels in quantum networks, and to test the internal structure of uncharacterized quantum circuits.
arXiv comment43 pages, 5 figures. Modified to match the published version. This version supercedes arXiv:2012.01731
References in corpus (32)
- The Quantum Internet
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Quantum fingerprinting
- Symmetric Informationally Complete Quantum Measurements
- A class of quantum many-body states that can be efficiently simulated
- Efficient quantum state tomography
- Classical simulation of quantum many-body systems with a tree tensor network
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Quantum Circuits for General Multiqubit Gates
- Quantum-state preparation with universal gate decompositions
- The lesson of causal discovery algorithms for quantum correlations: Causal explanations of Bell-inequality violations require fine-tuning
- Operational Markov condition for quantum processes
- Quantum causal modelling
- Quantum common causes and quantum causal models
- Theory-independent limits on correlations from generalised Bayesian networks
- Inferring causal structure: a quantum advantage
- Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
- A graph-separation theorem for quantum causal models
- Cyclic Quantum Causal Models
- Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
- Quantum speedup in the identification of cause-effect relations
- Resource theories of multi-time processes: A window into quantum non-Markovianity
- Quantum violations in the Instrumental scenario and their relations to the Bell scenario
- Using quantum theory to reduce the complexity of input-output processes
- A quantum causal discovery algorithm
- Quantum learning of classical stochastic processes: The Completely-Positive Realization Problem
- Quantum interactive proofs and the complexity of separability testing
- Quantum Causal Models
- Test one to test many: a unified approach to quantum benchmarks
- Quantum Compression of Tensor Network States
- Quantifying Causality in Quantum and General Models
Cited by in corpus (6)
- Inferring the arrow of time in quantum spatiotemporal correlations
- Quantum space-time marginal problem: global causal structure from local causal information
- Quantum Causal Inference with Extremely Light Touch
- Quantifying Quantum Causal Influences
- Detecting Quantum Capacities of Continuous-Variable Quantum Channels
- Testing identity of collections of quantum states: sample complexity analysis