Zhengzhong Yi

Dr. Zhengzhong Yi


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 March 2025 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
ZYZhengzhong Yi
Zhengzhong Yi
ZLZhipeng Liang
Zhipeng Liang
JCJiahan Chen
Jiahan Chen
KZKaixin Zhong
Kaixin Zhong
Yulin WuYulin Wu
Yulin Wu
XWXuan Wang
Xuan Wang

9 September 2025 in Entropy
Verified
Journal Article
Open access
PDF file
ZLZhipeng Liang
Zhipeng Liang
ZWZicheng Wang
Zicheng Wang
ZYZhengzhong Yi
Zhengzhong Yi
FYFusheng Yang
Fusheng Yang
XWXuan Wang
Xuan Wang
The code distance is a critical parameter of quantum stabilizer codes (QSCs), and determining it—whether exactly or approximately—is known to be an NP-complete problem. However, its upper bound can be determined efficiently by some methods such as the Monte Carlo method. Leveraging the Monte Carlo method, we propose an algorithm to compute the upper bound on the code distance of a given QSC using fully decoupled belief propagation combined with ordered statistics decoding (FDBP-OSD). Our algorithm demonstrates high precision: for various QSCs with known distances, the computed upper bounds match the actual values. Additionally, we explore upper bounds for the minimum weight of logical X operators in the Z-type Tanner-graph-recursive-expansion (Z-TGRE) code and the Chamon code—an XYZ product code constructed from three repetition codes. The results on Z-TGRE codes align with theoretical analysis, while the results on Chamon codes suggest that XYZ product codes may achieve a code distance of O(N2/3), which supports the conjecture of Leverrier et al.

25 September 2024 in Entropy
Verified
Journal Article
Open access
PDF file
ZYZhengzhong Yi
Zhengzhong Yi
ZLZhipeng Liang
Zhipeng Liang
Yulin WuYulin Wu
Yulin Wu
XWXuan Wang
Xuan Wang
Inspired by classical polar codes, whose coding rate can asymptotically achieve the Shannon capacity, researchers are trying to find their analogs in the quantum information field, which are called quantum polar codes. However, no one has designed a quantum polar coding scheme that applies to quantum computing yet. There are two intuitions in previous research. The first is that directly converting classical polar coding circuits to quantum ones will produce the polarization phenomenon of a pure quantum channel, which has been proved in our previous work. The second is that based on this quantum polarization phenomenon, one can design a quantum polar coding scheme that applies to quantum computing. There are several previous work following the second intuition, none of which has been verified by experiments. In this paper, we follow the second intuition and propose a more reasonable quantum polar stabilizer code construction algorithm than any previous ones by using the theory of stabilizer codes. Unfortunately, simulation experiments show that even the stabilizer codes obtained from this more reasonable construction algorithm do not work, which implies that the second intuition leads to a dead end. Based on the analysis of why the second intuition does not work, we provide a possible future direction for designing quantum stabilizer codes with a high coding rate by borrowing the idea of classical polar codes. Following this direction, we find a class of quantum stabilizer codes with a coding rate of 0.5, which can correct two of the Pauli errors.

11 May 2023 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
ZYZhengzhong Yi
Zhengzhong Yi
ZLZhipeng Liang
Zhipeng Liang
XWXuan Wang
Xuan Wang

24 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
ZYZhengzhong Yi
Zhengzhong Yi
ZLZhipeng Liang
Zhipeng Liang
XWXuan Wang
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 key to design quantum polar code is to find out for the quantity which can measure the quality of quantum channels, whether there is a polarization phenomenon which is similar to classical channel polarization. Coherent information is believed to be the quantum analogue of classical mutual information and the quantity to measure the capacity of quantum channel. In this paper, we define a class of quantum channels called quantum symmetric channels, and prove that for quantum symmetric channels, under the similar channel combining and splitting process as in the classical channel polarization, the maximum single letter coherent information of the coordinate channels will polarize. That is to say, there is a channel polarization phenomenon in quantum symmetric channels.

9 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
ZLZhipeng Liang
Zhipeng Liang
ZWZicheng Wang
Zicheng Wang
ZYZhengzhong Yi
Zhengzhong Yi
YWYulin Wu
Yulin Wu
CQChen Qiu
Chen Qiu
XWXuan Wang
Xuan Wang
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 can be computed by some efficient methods. In this paper, employing the idea of Monte Carlo method, we propose the algorithm of determining the upper bound of code distance of QSCs based on fully decoupled belief propagation. Our algorithm shows high precision - the upper bound of code distance determined by the algorithm of a variety of QSCs whose code distance is known is consistent with actual code distance. Besides, we explore the upper bound of logical X operators of Z-type Tanner-graph-recursive-expansion (Z-TGRE) code and Chamon code, which is a kind of XYZ product code constructed by three repetition codes. The former is consistent with the theoretical analysis, and the latter implies the code distance of XYZ product codes can very likely achieve $O(N^{2/3})$, which supports the conjecture of Leverrier et al..