Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1401.6500

Holographic Transformation for Quantum Factor Graphs

Ryuhei Mori

Published Jan 25, 2014• 0 citations
arXivHTMLPDF

Abstract

Recently, a general tool called a holographic transformation, which transforms an expression of the partition function to another form, has been used for polynomial-time algorithms and for improvement and understanding of the belief propagation. In this work, the holographic transformation is generalized to quantum factor graphs.
DOI
10.48550/arxiv.1401.6500

Related papers

Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories

Ryuhei Mori

The holographic transformation, belief propagation and loop calculus are generalized to problems in generalized probabilistic theories including quantum mechanics. In this work, the partition function of classical factor graph is represented by an inner product of two high-dimensional vectors both of which can be decomposed to tensor products of low-dimensional vectors. On the representation, the holographic transformation is clearly understood by using adjoint linear maps. Furthermore, on the formulation using inner product, the belief propagation is naturally defined from the derivation of the loop calculus formula. As a consequence, the holographic transformation, the belief propagation and the loop calculus are generalized to measurement problems in quantum mechanics and generalized probabilistic theories.

arXiv:1501.04183•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•4 citations

Factor Graphs for Quantum Information Processing

Michael X. Cao

[...] In this thesis, we are interested in generalizing factor graphs and the relevant methods toward describing quantum systems. Two generalizations of classical graphical models are investigated, namely double-edge factor graphs (DeFGs) and quantum factor graphs (QFGs). Conventionally, a factor in a factor graph represents a nonnegative real-valued local functions. Two different approaches to generalize factors in classical factor graphs yield DeFGs and QFGs, respectively. We proposed/re-proposed and analyzed generalized versions of belief-propagation algorithms for DeFGs/QFGs. As a particular application of the DeFGs, we investigate the information rate and their upper/lower bounds of classical communications over quantum channels with memory. In this study, we also propose a data-driven method for optimizing the upper/lower bounds on information rate.

arXiv:2203.12413•Mar 23, 2022•2 citations

Quantum factor graphs: Closing-the-box operation and variational approaches

Michael X. Cao, Pascal O. Vontobel

Factor graphs and the sum-product algorithms form a powerful framework for expressing a great variety of algorithms in coding theory, signal processing, artificial intelligence, and other areas. Two different approaches to derive the sum-product algorithm are given by the so-called closing-the-box operation or by a variational approach known as Bethe free energy function minimization. In this paper we consider a generalization of factor graphs known as quantum factor graphs, along with a generalization of the sum-product algorithm known as the quantum sum-product algorithm. We explore the generalization of the closing-the-box operation and the Bethe free energy function from the classical to the quantum setup. Some expressions that hold exactly in the classical case hold only approximately in the quantum case; we give some analytical and numerical characterizations of these approximations.

International Symposium on Information Theory and its Applications•Oct 1, 2016•2 citations

Holographic software for quantum networks

Arthur Jaffe, Zhengwei Liu, Alex Wozniakowski

We introduce a pictorial approach to quantum information, called holographic software . Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform (SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the n -qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.

arXiv:1605.00127•Science China Mathematics•Feb 12, 2018•35 citations

Experimental Results About The Dynamics Of The Generalized Belief Propagation Used On Ldpc Codes

Jean-Christophe Sibel, Sylvain Reynal, David Declercq

In the context of channel coding, the Generalized Belief Propagation (GBP) is an iterative algorithm used to recover the transmission bits sent through a noisy channel. To ensure a reliable transmission, we apply a map on the bits, that is called a code. This code induces artificial correlations between the bits to send, and it can be modeled by a graph whose nodes are the bits and the edges are the correlations. This graph, called Tanner graph, is used for most of the decoding algorithms like Belief Propagation or Gallager-B. The GBP is based on a non unic transformation of the Tanner graph into a so called region-graph. A clear advantage of the GBP over the other algorithms is the freedom in the construction of this graph. In this article, we explain a particular construction for specific graph topologies that involves relevant performance of the GBP. Moreover, we investigate the behavior of the GBP considered as a dynamic system in order to understand the way it evolves in terms of the time and in terms of the noise power of the channel. To this end we make use of classical measures and we introduce a new measure called the hyperspheres method that enables to know the size of the attractors.

•May 22, 2012•0 citations

Theory of linear quantum transformation and its application

Sixia Yu, Lu Huai-Xin

The theory of linear quantum transformation is briefly reviewed. Its applications demonstrated here include the normal product and anti normal product of the exponential quadratic forms, the partition function of quadratic Hamiltonian, and some application in the calculation of the entanglement and fidelity of Gaussian packets.

College Physics•Jan 1, 2004•0 citations
The holographic transformation, belief propagation and loop calculus are generalized to problems in generalized probabilistic theories including quantum mechanics. In this work, the partition function of classical factor graph is represented by an inner product of two high-dimensional vectors both of which can be decomposed to tensor products of low-dimensional vectors. On the representation, the holographic transformation is clearly understood by using adjoint linear maps. Furthermore, on the formulation using inner product, the belief propagation is naturally defined from the derivation of the loop calculus formula. As a consequence, the holographic transformation, the belief propagation and the loop calculus are generalized to measurement problems in quantum mechanics and generalized probabilistic theories.
[...] In this thesis, we are interested in generalizing factor graphs and the relevant methods toward describing quantum systems. Two generalizations of classical graphical models are investigated, namely double-edge factor graphs (DeFGs) and quantum factor graphs (QFGs). Conventionally, a factor in a factor graph represents a nonnegative real-valued local functions. Two different approaches to generalize factors in classical factor graphs yield DeFGs and QFGs, respectively. We proposed/re-proposed and analyzed generalized versions of belief-propagation algorithms for DeFGs/QFGs. As a particular application of the DeFGs, we investigate the information rate and their upper/lower bounds of classical communications over quantum channels with memory. In this study, we also propose a data-driven method for optimizing the upper/lower bounds on information rate.
Factor graphs and the sum-product algorithms form a powerful framework for expressing a great variety of algorithms in coding theory, signal processing, artificial intelligence, and other areas. Two different approaches to derive the sum-product algorithm are given by the so-called closing-the-box operation or by a variational approach known as Bethe free energy function minimization. In this paper we consider a generalization of factor graphs known as quantum factor graphs, along with a generalization of the sum-product algorithm known as the quantum sum-product algorithm. We explore the generalization of the closing-the-box operation and the Bethe free energy function from the classical to the quantum setup. Some expressions that hold exactly in the classical case hold only approximately in the quantum case; we give some analytical and numerical characterizations of these approximations.
We introduce a pictorial approach to quantum information, called holographic software . Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform (SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the n -qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.
In the context of channel coding, the Generalized Belief Propagation (GBP) is an iterative algorithm used to recover the transmission bits sent through a noisy channel. To ensure a reliable transmission, we apply a map on the bits, that is called a code. This code induces artificial correlations between the bits to send, and it can be modeled by a graph whose nodes are the bits and the edges are the correlations. This graph, called Tanner graph, is used for most of the decoding algorithms like Belief Propagation or Gallager-B. The GBP is based on a non unic transformation of the Tanner graph into a so called region-graph. A clear advantage of the GBP over the other algorithms is the freedom in the construction of this graph. In this article, we explain a particular construction for specific graph topologies that involves relevant performance of the GBP. Moreover, we investigate the behavior of the GBP considered as a dynamic system in order to understand the way it evolves in terms of the time and in terms of the noise power of the channel. To this end we make use of classical measures and we introduce a new measure called the hyperspheres method that enables to know the size of the attractors.