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

Physics World

Beyond belief

Published Dec 1, 2005• 0 citations
Publisher
DOI
10.1088/2058-7058/18/12/22

Related papers

An modified beyond belief propagation algorithm over AWGN channel

Yibo Lv, Lin Wang

Recently one decoding algorithm called as beyond belief propagation (BP) algorithm for LDPC Codes is derived using the knowledge of trapping set and different from standard BP algorithm, whose performance outperforms that of the latter over binary symmetric channel (BSC). However, the former is not suitable for additive white Gaussian noise (AWGN) channel. In this paper how to improve bit error rate (BER) performance of Beyond BP Algorithm is investigated over AWGN channel. It is found that this algorithm can be modified through setting appropriate penalty factor and obtains better performance than BP one over AWGN channel. The simulation results show dependently on choosing penalty factor modified Beyond BP Algorithm outperforms BP one over AWGN channel in high signal noise rate (SNR) region or almost whole SNR one and there are some differences for different code rates. Concretely, for medium or low code rate proposed algorithm can obtain more performance gain relative to high one when short frame is used.

International Symposium on Communications and Information Technologies•Sep 1, 2013•2 citations

Beyond Understanding

Physics World•Apr 1, 2000•0 citations

Quantum Information Fusion and Correction under the Transferable Belief Model

Qianli Zhou, Hao Luo, Lipeng Pan +2 more

The transferable belief model (TBM), developed within Dempster-Shafer theory, represents ambiguity and partial ignorance through set-valued belief masses. Its classical operations, however, can grow combinatorially over the power set. We formulate TBM reasoning on quantum circuits using the mass function quantum state (MFQS). The resulting framework covers belief representation, credal-level fusion and correction, product-space operations, and the generalized Bayesian theorem. For prepared MFQS inputs, CCR and the entire $α$-junction use element-wise gate modules whose logical counts are linear in the number of frame elements. These circuits avoid explicit operation-stage updates over all $2^n$ focal-set coordinates. A noisy multi-domain classifier-fusion example further demonstrates interpretable source fusion and improved robustness to gate-control noise. The results establish Dempster-Shafer structures as a semantic layer for quantum information processing beyond singleton-probability representations.

arXiv:2410.08949•Oct 11, 2024•2 citations

In Search of Reality

Bernard d’Espagnat

Springer eBooks•Jan 1, 1983•103 citations

VLSI Architecture of a High Speed Polar Code Decoder using Finite Length Scaling LDPC Codes

Kandi Naveen, Vishnubhatla Sai Lakshmi Manonmai, Murala Sri Jaya Nikhitha +2 more

In this concise a polar decoder form propagation based on belief is formulated which employ finite length LDPC systems. Here the belief sum-product Propagation (BP) is designed for LDPC system beyond affecting the binary communication erasure channels. Belief decoding is parallel and iterative in nature, as it own iteratively nature the required idleness and energy dissemination increments straightly. The prompt report stated that unstable node (VNs) is reduced during individual iteration than as BP. Declination of erased VNs reduces decoding process cause a forceful decrease in complexity, compared among polar decoder that is designed based on CSFG. CSFG is implemented with Quarter-way scheduling algorithm, a sub-factor graph reduces valuations of taken by belief decoder but due to different variable nodes used in the process it has large complication during design. To overcome this BPD with LDPC codes is designed. Simulation and synthesis results in the progressive art reveal that LDPC system drawn better in performance in contrast with belief based propagation.

International Conference on Electrical, Electronics, Information and Communication Technologies (ICEEICT)•Apr 5, 2023•5 citations

Philosophy

Harry Paul

Cambridge University Press eBooks•Jun 5, 2008•0 citations
Recently one decoding algorithm called as beyond belief propagation (BP) algorithm for LDPC Codes is derived using the knowledge of trapping set and different from standard BP algorithm, whose performance outperforms that of the latter over binary symmetric channel (BSC). However, the former is not suitable for additive white Gaussian noise (AWGN) channel. In this paper how to improve bit error rate (BER) performance of Beyond BP Algorithm is investigated over AWGN channel. It is found that this algorithm can be modified through setting appropriate penalty factor and obtains better performance than BP one over AWGN channel. The simulation results show dependently on choosing penalty factor modified Beyond BP Algorithm outperforms BP one over AWGN channel in high signal noise rate (SNR) region or almost whole SNR one and there are some differences for different code rates. Concretely, for medium or low code rate proposed algorithm can obtain more performance gain relative to high one when short frame is used.
The transferable belief model (TBM), developed within Dempster-Shafer theory, represents ambiguity and partial ignorance through set-valued belief masses. Its classical operations, however, can grow combinatorially over the power set. We formulate TBM reasoning on quantum circuits using the mass function quantum state (MFQS). The resulting framework covers belief representation, credal-level fusion and correction, product-space operations, and the generalized Bayesian theorem. For prepared MFQS inputs, CCR and the entire ααα-junction use element-wise gate modules whose logical counts are linear in the number of frame elements. These circuits avoid explicit operation-stage updates over all 2n2^n2n focal-set coordinates. A noisy multi-domain classifier-fusion example further demonstrates interpretable source fusion and improved robustness to gate-control noise. The results establish Dempster-Shafer structures as a semantic layer for quantum information processing beyond singleton-probability representations.
In this concise a polar decoder form propagation based on belief is formulated which employ finite length LDPC systems. Here the belief sum-product Propagation (BP) is designed for LDPC system beyond affecting the binary communication erasure channels. Belief decoding is parallel and iterative in nature, as it own iteratively nature the required idleness and energy dissemination increments straightly. The prompt report stated that unstable node (VNs) is reduced during individual iteration than as BP. Declination of erased VNs reduces decoding process cause a forceful decrease in complexity, compared among polar decoder that is designed based on CSFG. CSFG is implemented with Quarter-way scheduling algorithm, a sub-factor graph reduces valuations of taken by belief decoder but due to different variable nodes used in the process it has large complication during design. To overcome this BPD with LDPC codes is designed. Simulation and synthesis results in the progressive art reveal that LDPC system drawn better in performance in contrast with belief based propagation.