activity
20212026
collaborators

11 papers

quant-ph2026

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…

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

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…

quant-ph2024

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…

quant-ph2023

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…

cs.CR2022

Privacy-Preserving Distributed Machine Learning Made Faster

Zoe L. Jiang, Jiajing Gu, Hongxiao Wang +5

With the development of machine learning, it is difficult for a single server to process all the data. So machine learning tasks need to be spread across multiple servers, turning…

quant-ph2022

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…

quant-ph2021

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…

quant-ph2021

Channel Polarization of Two-dimensional-input Quantum Symmetric Channels

Zhengzhong Yi, Zhipeng Liang, Xuan Wang

Being attracted by the property of classical polar code, researchers are trying to find its analogue in quantum fields, which is called quantum polar code. The first step and the k…