Factorization of Quantum Density Matrices According to Bayesian and Markov Networks

Details Factorization of Quantum Density Matrices According to Bayesian and Markov Networks Factorization of Quantum Density Matrices According to Bayesian and Markov Networks

2007-01-28

arxiv.org/abs/quant-ph/0701201v1

Physics

Quantum Physics

48 pages (files: 1 .tex, 1 .sty, 7 .eps)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Factorization of Quantum Density Matrices According to Bayesian and Markov Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Factorization of Quantum Density Matrices According to Bayesian and Markov Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Factorization of Quantum Density Matrices According to Bayesian and Markov Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-197295