5 papers · 1 filter
Determining the upper bound of code distance of quantum stabilizer codes through Monte Carlo method based on fully decoupled belief propagation
Zhipeng Liang, Zicheng Wang, Zhengzhong Yi +3
Code distance is an important parameter for quantum stabilizer codes (QSCs). Directly precisely computing it is an NP-complete problem. However, the upper bound of code distance ca…
Recursive expansion of Tanner graph: a method to construct stabilizer codes with high coding rate
Zhengzhong Yi, Zhipeng Liang, Zicheng Wang +4
Quantum stabilizer codes face the problem of low coding rate. In this article, following the idea of recursively expanding Tanner graph proposed in our previous work, we try to con…
Improved belief propagation decoding algorithm based on decoupling representation of Pauli operators for quantum LDPC codes
Zhengzhong Yi, Zhipeng Liang, Kaixin Zhong +3
We propose a new method called decoupling representation to represent Pauli operators as vectors over , based on which we propose partially decoupled belief propagation and…
Quantum polar stabilizer codes based on polarization of pure quantum channel don't work for quantum computing
Zhengzhong Yi, Zhipeng Liang, Yulin Wu +1
Inspired by classical polar codes, whose coding rate can asymptotically achieve the Shannon capacity, researchers are trying to find its analogue in quantum information field, whic…
Improved Polar-code-based Efficient Post-processing Algorithm for Quantum Key Distribution
Junbing Fang, Zhengzhong Yi, Jin Li +5
Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy ampli…