activity
20212025
most citedImproved Belief Propagation Decoding Algorithms for Surface Codes

9 citations · 9 across the 11 of their papers we have counts for

collaborators

11 papers

quant-ph2025

An exploration of the noise sensitivity of the Shor's algorithm

Fusheng Yang, Zhipeng Liang, Zhengzhong Yi +1

Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. Th…

quant-ph2025

Quantum XYZ cyclic codes for biased noise

Zhipeng Liang, Fusheng Yang, Zhengzhong Yi +1

In some quantum computing architectures, Pauli noise is highly biased. Tailoring Quantum error-correcting codes to the biased noise may benefit reducing the physical qubit overhead…

quant-ph2024

High-dimensional quantum XYZ product codes for biased noise

Zhipeng Liang, Zhengzhong Yi, Fusheng Yang +3

Three-dimensional (3D) quantum XYZ product can construct a class of non-CSS quantum codes by using three classical codes. However, there has been limited study on their error-corre…

quant-ph2024★ 9 cited

Improved Belief Propagation Decoding Algorithms for Surface Codes

Jiahan Chen, Zhengzhong Yi, Zhipeng Liang +1

Quantum error correction is crucial for universal fault-tolerant quantum computing. Highly accurate and low-time-complexity decoding algorithms play an indispensable role in ensuri…

quant-ph2024

Hypergraph product code with 0.2 constant coding rate and high code capacity noise threshold

Zhengzhong Yi, Zhipeng Liang, Jiahan Chen +2

The low coding rate of quantum stabilizer codes results in formidable physical qubit overhead when realizing quantum error correcting in engineering. In this letter, we propose a n…

quant-ph2024

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…