[Paper Review] Factorization of Quantum Density Matrices According to Bayesian and Markov Networks

Robert R. Tucci|ArXiv.org|Jan 28, 2007

Quantum Computing Algorithms and Architecture9 references3 citations

TL;DR

This paper establishes that any quantum density matrix can be represented by both Bayesian (directed) and Markov (undirected) networks using complex-valued conditional probabilities. It generalizes classical d-separation theorems to quantum systems, showing that graphical d-separation detects unentangled node sets and links to CMI entanglement (squashed entanglement), providing a graphical framework for quantum conditional independence and entanglement structure.

ABSTRACT

We show that any quantum density matrix can be represented by a Bayesian network (a directed acyclic graph), and also by a Markov network (an undirected graph). We show that any Bayesian or Markov net that represents a density matrix, is logically equivalent to a set of conditional independencies (symmetries) satisfied by the density matrix. We show that the d-separation theorems of classical Bayesian and Markov networks generalize in a simple and natural way to quantum physics. The quantum d-separation theorems are shown to be closely connected to quantum entanglement. We show that the graphical rules for d-separation can be used to detect pairs of nodes (or of node sets) in a graph that are unentangled. CMI entanglement (a.k.a. squashed entanglement), a measure of entanglement originally discovered by analyzing Bayesian networks, is an important part of the theory of this paper.

Motivation & Objective

• To extend classical Bayesian and Markov network theories—particularly d-separation and conditional independence—to the quantum domain.
• To demonstrate that any quantum density matrix can be factorized using either a directed (Bayesian) or undirected (Markov) graphical model with complex amplitudes.
• To establish a formal connection between quantum d-separation and quantum entanglement, showing that d-separation detects unentangled subsystems.
• To show that CMI entanglement (squashed entanglement), originally derived from Bayesian network analysis, is a central measure in the proposed quantum graphical theory.
• To provide a pedagogical, self-contained framework that parallels classical and quantum network theories for researchers in quantum information and quantum foundations.

Proposed method

• Represent a quantum density matrix as a product of complex-valued conditional amplitudes associated with nodes in a directed acyclic graph (Bayesian network).
• Represent the same density matrix as a product of complex-valued affinities over maximal cliques in an undirected graph (Markov network).
• Define quantum d-separation using the same graphical rules as classical d-separation, but applied to complex amplitudes in quantum networks.
• Use Mobius inversion over the lattice of subsets to derive conditional independence relations from factorization structures.
• Apply the formalism to derive the CMI (squashed) entanglement measure as a natural consequence of the Bayesian network structure.
• Prove that a set of nodes is unentangled if and only if they are d-separated in the corresponding quantum graphical model.

Experimental results

Research questions

• RQ1 Can any quantum density matrix be represented by a quantum Bayesian or Markov network?
• RQ2 How do classical d-separation theorems generalize to the quantum domain in terms of conditional independence?
• RQ3 What is the relationship between quantum d-separation and quantum entanglement?
• RQ4 Can graphical rules detect unentangled subsystems in a quantum network?
• RQ5 How is the CMI (squashed) entanglement measure derived from the structure of quantum Bayesian networks?

Key findings

• Any quantum density matrix admits a factorization into a quantum Bayesian network (directed graph with complex transition matrices) and a quantum Markov network (undirected graph with complex clique affinities).
• Quantum d-separation theorems generalize classical d-separation and are logically equivalent to the set of conditional independence relations satisfied by the density matrix.
• A pair of node sets is unentangled if and only if they are d-separated in the quantum graphical model, providing a graphical criterion for detecting unentanglement.
• The CMI (squashed) entanglement measure arises naturally from the structure of quantum Bayesian networks and is a key component of the theory.
• The paper establishes that the graphical rules of d-separation can be used to infer quantum conditional independence and entanglement structure from the network topology.
• The theory is self-contained and pedagogically structured, with classical and quantum network theories developed in parallel for clarity and accessibility.