Quantum codes from classical graphical models
arXiv:1804.07653 · doi:10.1109/TIT.2019.2938751
Abstract
We introduce a new graphical framework for designing quantum error correction codes based on classical principles. A key feature of this graphical language, over previous approaches, is that it is closely related to that of factor graphs or graphical models in classical information theory and machine learning. It enables us to formulate the description of the recently-introduced `coherent parity check' quantum error correction codes entirely within the language of classical information theory. This makes our construction accessible without requiring background in quantum error correction or even quantum mechanics in general. More importantly, this allows for a collaborative interplay where one can design new quantum error correction codes derived from classical codes.
arXiv commentAccepted for publication (20/08/2019) in IEEE Transactions on Information Theory
References in corpus (15)
- Quantum Computing in the NISQ era and beyond
- Surface codes: Towards practical large-scale quantum computation
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Good Quantum Error-Correcting Codes Exist
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Surface code quantum computing by lattice surgery
- Correcting Quantum Errors with Entanglement
- Codes for the Quantum Erasure Channel
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Experimental demonstration of fault-tolerant state preparation with superconducting qubits
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Quantum Graphical Models and Belief Propagation
- Error Prevention Scheme with Four Particles
- Protecting quantum memories using coherent parity check codes
- Belief propagation decoding of quantum channels by passing quantum messages