9 citations · 9 across the 9 of their papers we have counts for
9 papers
The four-dimensional Chamon code
Zhipeng Liang, Xuan Wang
Fracton models have attracted considerable interest as candidates for quantum memories because of their unconventional ground-state degeneracy (GSD) and restricted-mobility excitat…
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…
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…
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…
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…
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…
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 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…