Bayesian Networks of Density Operators

• URL: http://arxiv.org/abs/2607.27876v1
• Date: Thu, 30 Jul 2026 08:51:05 GMT
• Title: Bayesian Networks of Density Operators
• Abstract summary: We study quantum analogues of Bayesian networks on a directed acyclic graph (DAG)<n>We distinguish two constructions for positive definite density operators on finite-dimensional tensor-product Hilbert spaces.
• Score: 0.30079490585515334
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study quantum analogues of Bayesian networks on a directed acyclic graph (DAG), distinguishing two constructions for positive definite density operators on finite-dimensional tensor-product Hilbert spaces. The intrinsic construction starts from a joint state and its conditional-independence properties. The extrinsic construction assembles a state sequentially from prescribed local quantum kernels, following an ordering compatible with the arrows of the DAG. For the intrinsic construction, we prove the equivalence of the ordered, local, and global directed Markov properties, together with entropy, recursive-factorization, and logarithmic characterizations. The extrinsic construction always gives a normalized state and recovers each kernel as a conditional on all preceding systems. The same kernel, however, need not be recovered from the marginal on the vertex and its parents; a three-qubit example exhibits this obstruction. We prove that independence of the chosen topological ordering is sufficient exactly for transitive DAGs: every order-invariant kernel family then yields an intrinsically directed Markov state. Finally, we associate a logarithmic candidate with every positive definite state and DAG, prove that it is subnormalized, and show that the trace-one candidate is a directed Markov state. Both the candidate and the excess global information are invariant under DAG Markov equivalence.

Related papers

• Spin-coherent quantum designs [0.0]
  We show that the canonical finite coherent-state formula reconstructs every operator in the rank-$S$ sector exactly if and only if the sampling points form a spherical $(2J+S)$-design.<n>We derive practical protocols for estimating moments of spin operators from these constructions, with direct applications to polarimetry, magnetometry, and quantum state tomography.
  arXiv  Detail & Related papers  (2026-08-11T18:00:06Z)
• Frame-Dependent Traces and the Third-Particle Paradox [45.88028371034407]
  We show that the Paradox of the Third Particle arises when comparing subsystem descriptions across Quantum Reference Tracing perspectives.<n>We argue that our condition captures the Paradox content: rather than imposing consistency on the whole state space, we reproduce exactly the states on which it holds.
  arXiv  Detail & Related papers  (2026-07-23T18:00:01Z)
• Singularizing preserving countable additivity quantum channels on quantum measurable cardinals [0.0]
  We investigate the structural and dynamical properties of a class of quantum channels on von Neumann algebras.<n>We establish a suffucient condition under which a channel preserves $$-additivity and exhibits a singularizing property.<n>In conjunction with the theory of Ulam real-valued measurable cardinals, this framework reveals a novel phenomenon.
  arXiv  Detail & Related papers  (2026-05-24T08:02:13Z)
• The Marginal Problem for Density Operators [0.30079490585515334]
  We study when local reduced density operators can be assembled into a global quantum state with a prescribed Markov structure.<n>We prove that this obstruction is captured exactly by a trace condition.<n>Three-qubit Pauli examples show that the quantum obstructions are real.
  arXiv  Detail & Related papers  (2026-05-19T07:06:54Z)
• Quantum Randomized Subspace Iteration [0.0]
  We introduce the quantum randomized subspace iteration (QRSI)<n> QRSI conjugates the Hamiltonian by independent random unitaries across as many branches as the degeneracy g.<n>We prove that the construction spans the full eigenspace almost surely and preserves the spectral gap exactly on every branch.
  arXiv  Detail & Related papers  (2026-04-10T16:47:22Z)
• Deterministic Zeroth-Order Mirror Descent via Vector Fields with A Posteriori Certification [45.85698554568285]
  We develop a deterministic zeroth-order mirror descent framework by replacing gradients with a general vector field.<n>Our analysis provides an evaluation template for last-rate inequality evaluations.<n>Together, these results expose a hidden geometric linking Bregman identities, deterministic certification, and robust conic geometry in zeroth-order mirror descent.
  arXiv  Detail & Related papers  (2026-01-31T10:05:05Z)
• Construction and Rigorous Analysis of Quantum-Like States [0.0]
  This work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the adjacency matrices of such networks.<n>We show that symmetric construction of such networks leads to an equal superposition of the $|+rangle, |-rangle$ Hadamard states.<n>We also prove two methods to construct any arbitrary single qubit state $|psirangle = a|0rangle + b|1rangle,, |a|2+|b|2=1$.
  arXiv  Detail & Related papers  (2025-07-28T19:22:32Z)
• Understanding Heterophily for Graph Neural Networks [42.640057865981156]
  We present theoretical understandings of the impacts of different heterophily patterns for Graph Neural Networks (GNNs) We show that the separability gains are determined by the normalized distance of the $l$-powered neighborhood distributions. Experiments on both synthetic and real-world data verify the effectiveness of our theory.
  arXiv  Detail & Related papers  (2024-01-17T11:01:28Z)
• On the Stability of Expressive Positional Encodings for Graphs [46.967035678550594]
  Using Laplacian eigenvectors as positional encodings faces two fundamental challenges. We introduce Stable and Expressive Positional generalizations (SPE) SPE is the first architecture that is (1) provably stable, and (2) universally expressive for basis invariant functions.
  arXiv  Detail & Related papers  (2023-10-04T04:48:55Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
  A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold. We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent. A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
  arXiv  Detail & Related papers  (2021-06-10T19:54:19Z)
• Complete entropic inequalities for quantum Markov chains [17.21921346541951]
  We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional algebra satisfies a modified log-Sobolev inequality. We also establish the first general approximateization property of relative entropy.
  arXiv  Detail & Related papers  (2021-02-08T11:47:37Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)

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.