Topology-Aware Exploration of Energy-Based Models Equilibrium: Toric
QC-LDPC Codes and Hyperbolic MET QC-LDPC Codes
- URL: http://arxiv.org/abs/2401.14749v1
- Date: Fri, 26 Jan 2024 10:14:10 GMT
- Title: Topology-Aware Exploration of Energy-Based Models Equilibrium: Toric
QC-LDPC Codes and Hyperbolic MET QC-LDPC Codes
- Authors: Vasiliy Usatyuk, Denis Sapozhnikov, Sergey Egorov
- Abstract summary: We present a method for achieving equilibrium in the ISING Hamiltonian when confronted with unevenly distributed charges on an irregular grid.
Our approach involves dimensionally expanding the system, substituting charges with circulants, and representing distances through circulant shifts.
This results in a systematic mapping of the charge system onto a space, transforming the irregular grid into a uniform configuration.
- Score: 0.11805137592431453
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper presents a method for achieving equilibrium in the ISING
Hamiltonian when confronted with unevenly distributed charges on an irregular
grid. Employing (Multi-Edge) QC-LDPC codes and the Boltzmann machine, our
approach involves dimensionally expanding the system, substituting charges with
circulants, and representing distances through circulant shifts. This results
in a systematic mapping of the charge system onto a space, transforming the
irregular grid into a uniform configuration, applicable to Torical and Circular
Hyperboloid Topologies. The paper covers fundamental definitions and notations
related to QC-LDPC Codes, Multi-Edge QC-LDPC codes, and the Boltzmann machine.
It explores the marginalization problem in code on the graph probabilistic
models for evaluating the partition function, encompassing exact and
approximate estimation techniques. Rigorous proof is provided for the
attainability of equilibrium states for the Boltzmann machine under Torical and
Circular Hyperboloid, paving the way for the application of our methodology.
Practical applications of our approach are investigated in Finite Geometry
QC-LDPC Codes, specifically in Material Science. The paper further explores its
effectiveness in the realm of Natural Language Processing Transformer Deep
Neural Networks, examining Generalized Repeat Accumulate Codes,
Spatially-Coupled and Cage-Graph QC-LDPC Codes. The versatile and impactful
nature of our topology-aware hardware-efficient quasi-cycle codes equilibrium
method is showcased across diverse scientific domains without the use of
specific section delineations.
Related papers
- The Physics of (good) LDPC Codes I. Gauging and dualities [0.03922370499388702]
Low-depth parity check (LDPC) codes are a paradigm of error correction that allow for spatially non-local interactions between (qu)bits.
These codes can give rise to good codes'' that combine a finite encoding rate with an optimal scaling of the code distance.
We show that all known examples of good quantum LDPC codes are obtained by gauging locally testable classical codes.
arXiv Detail & Related papers (2023-10-24T17:47:06Z) - Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding
for Ising MRF Models: Classical and Quantum Topology Machine Learning [0.11805137592431453]
The paper introduces the application of information geometry to describe the ground states of Ising models.
The approach establishes a connection between machine learning and error-correcting coding.
arXiv Detail & Related papers (2023-07-28T19:38:13Z) - A Unified Algebraic Perspective on Lipschitz Neural Networks [88.14073994459586]
This paper introduces a novel perspective unifying various types of 1-Lipschitz neural networks.
We show that many existing techniques can be derived and generalized via finding analytical solutions of a common semidefinite programming (SDP) condition.
Our approach, called SDP-based Lipschitz Layers (SLL), allows us to design non-trivial yet efficient generalization of convex potential layers.
arXiv Detail & Related papers (2023-03-06T14:31:09Z) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Formal Controller Synthesis for Markov Jump Linear Systems with
Uncertain Dynamics [64.72260320446158]
We propose a method for synthesising controllers for Markov jump linear systems.
Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS.
We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
arXiv Detail & Related papers (2022-12-01T17:36:30Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - An Embedded Iris Recognition System Optimization using Dynamically
ReconfigurableDecoder with LDPC Codes [0.0]
The proposed design includes a minimal set of computer vision modules and multi-mode QC-LDPC decoder.
We show that we can apply Dynamic Partial Reconfiguration technology to implement the multi-mode QC-LDPC decoder for the iris recognition system.
arXiv Detail & Related papers (2021-07-08T09:04:11Z) - Tensor Learning-based Precoder Codebooks for FD-MIMO Systems [47.562560779723334]
This paper develops an efficient procedure for designing low-complexity codebooks for precoding in a full-dimension (FD) multiple-input multiple-output (MIMO) system.
We utilize a model-free data-driven approach with foundations in machine learning to generate codebooks that adapt to the surrounding propagation conditions.
arXiv Detail & Related papers (2021-06-21T19:18:39Z) - Deep Autoencoding Topic Model with Scalable Hybrid Bayesian Inference [55.35176938713946]
We develop deep autoencoding topic model (DATM) that uses a hierarchy of gamma distributions to construct its multi-stochastic-layer generative network.
We propose a Weibull upward-downward variational encoder that deterministically propagates information upward via a deep neural network, followed by a downward generative model.
The efficacy and scalability of our models are demonstrated on both unsupervised and supervised learning tasks on big corpora.
arXiv Detail & Related papers (2020-06-15T22:22:56Z) - Learning on a Grassmann Manifold: CSI Quantization for Massive MIMO
Systems [37.499485219254545]
This paper focuses on the design of beamforming codebooks that maximize the average normalized beamforming gain for any underlying channel distribution.
We utilize a model-free data-driven approach with foundations in machine learning to generate beamforming codebooks that adapt to the surrounding propagation conditions.
arXiv Detail & Related papers (2020-05-18T01:01:36Z)
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.