Quantum Graphical Models and Belief Propagation
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Abstract Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersley–Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702 · cited 1×
“tates (PEPS) for higher dimensions [VC04a, SDV06a]. These form an important class of states for the description of quantum many-body systems. For instance, density matrix renormalization group (DMRG) [Whi92a] — one of the most successful method for the numerical study of spin chains — is now understood as a variationa…”
MethodFactor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Rigorous results on valence-bond ground states in antiferromagnets
Affleck, I., Kennedy, T., Lieb, E. H., & Tasaki, H. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.799 · Cited by 2,223
Efficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
The finite group velocity of quantum spin systems
Lieb, E. H., & Robinson, D. W. (1972) · Communications in Mathematical Physics · doi:10.1007/bf01645779 · Cited by 1,463
Finitely correlated states on quantum spin chains
Fannes, M., Nachtergaele, B., & Werner, R. F. (1992) · Communications in Mathematical Physics · doi:10.1007/bf02099178 · Cited by 1,422
Thermodynamic limit of density matrix renormalization.
Östlund, S., & Rommer, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3537 · Cited by 1,077
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Classical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577
Negative Entropy and Information in Quantum Mechanics
Cerf, N. J., & Adami, C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.5194 · Cited by 461
Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
Uhlmann, A. (1977) · Communications in Mathematical Physics · doi:10.1007/bf01609834 · Cited by 431 · cited 1×
“similar arguments. For the n= 1 case, eqs. (36) and (37) imply converse results. Theorem 3.6. If ρU|X∪W = ρU|X or ρW|X∪U = ρW|X then S(U: W|X) = 0. Proof. As explained in [HJPW03a], Uhlman’s theorem [Uhl77a], implies that S(U : W|X) = 0 iff there exists a trace preserving, completely positive map EU∪X∪W|U∪X : L(HU ⊗HX)…”
InfluentialStructure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality
Hayden, P., Jozsa, R., Petz, D., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1049-z · Cited by 429
Optimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105
Self-citation
Cited by
Power of data in quantum machine learning
Huang, H.-Y., Broughton, M., Mohseni, M., Babbush, R., Boixo, S., Neven, H., & McClean, J. R. (2021) · Nature Communications · doi:10.1038/s41467-021-22539-9 · Cited by 896
Wood, C. J., & Spekkens, R. W. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/3/033002 · Cited by 335
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Towards a formulation of quantum theory as a causally neutral theory of Bayesian inference
Leifer, M. S., & Spekkens, R. W. (2013) · Physical Review A · doi:10.1103/physreva.88.052130 · Cited by 285
Self-citationEfficient Tensor Network Simulation of IBM’s Eagle Kicked Ising Experiment
Tindall, J., Fishman, M., Stoudenmire, E. M., & Sels, D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010308 · Cited by 152
Metadata
- Authors
- Leifer, M. S., & Poulin, D.
- Venue
- Annals of Physics
- Publisher
- Elsevier BV
- Published
- 2008-08
- Volume
- 323
- Issue
- 8
- Pages
- 1899-1946
- ISSN
- 0003-4916 (ISSN-L)
- OpenAlex
- W2164790530
- Cited by
- 148
- References
- 13
- FWCI
- 1.97
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.