Photonic circuits for iterative decoding of a class of low-density parity-check codes

DOI10.1088/1367-2630/16/10/105017zbMath1451.81196arXiv1306.0583OpenAlexW3104622368MaRDI QIDQ3387054

Dmitri S. Pavlichin, Hideo Mabuchi

Publication date: 12 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0583

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum gates (81P65) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum Ito's formula and stochastic evolutions
• Approximation and limit theorems for quantum stochastic models with unbounded coefficients
• Specification of photonic circuits using quantum hardware description language
• Expander codes
• A recursive approach to low complexity codes
• Improved low-density parity-check codes using irregular graphs
• The capacity of low-density parity-check codes under message-passing decoding
• Expander graph arguments for message-passing algorithms
• Good error-correcting codes based on very sparse matrices
• The Series Product and Its Application to Quantum Feedforward and Feedback Networks
• Design of nanophotonic circuits for autonomous subsystem quantum error correction
• Quantum feedback networks: Hamiltonian formulation

This page was built for publication: Photonic circuits for iterative decoding of a class of low-density parity-check codes