Multistage Rewinding Decoder for QLDPC Codes

Case ID:
UA26-240
Invention:

This invention proposes a multistage decoding framework that leverages internal information from an underlying message-passing decoder. The decoder performs guided rewinds by selectively forcing the initial log likelihood ratio values of the most suspicious variable nodes and restarting the message-passing decoder under the corresponding forced configuration. 

Background: 
The successful iterative decoding methods for Quantum Low-Density Parity Check codes (QLDPC), such as belief propagation (BP) and min-sum (MS), are limited by failure mechanisms caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers. Several approaches have been proposed to improve iterative decoding performance on QLDPC codes, but they are designed primarily to improve the BP dynamics itself.

Applications: 

  • Quantum computing
    • Communication systems
    • Cryptography
    • Metrology & sensing
  • Drug discovery
  • Simulation
  • Business
    • Financial modeling
    • Risk analysis
    • Optimization
  • Climate and weather forecasting


Advantages: 

  • Significantly outperforms the normalized MS decoder and achieves competitive performance with BP decoders
  • Leverages internal information for improved performance
Patent Information:
Contact For More Information:
Scott Zentack
Licensing Manager, College of Engr
The University of Arizona
zentack@arizona.edu
Lead Inventor(s):
Milad Taghipour
Dimitris Chytas
Bane Vasic
Keywords: