Error trapping circuit and decoding method based on asymmetric quantum cyclic burst error code

Abstract

The application discloses an error capturing circuit and decoding method based on an asymmetric quantum cyclic burst error code. The error capturing circuit can quickly locate error positions by cyclically shifting error accompanying formula, and can correct any burst X error and Z error in the range of decoding length of codeword design. The decoding method based on the asymmetric quantum cyclic burst error code and the error capturing circuit can respectively correct Z error and X error, optimizes decoding performance, fully considers degenerate characteristics in decoding to fully exert the decoding limit of quantum coding theory, and realizes correction of more quantum burst errors under the same code rate.

Description

Technical Field

[0001] This invention belongs to the field of quantum error correction code decoding, and particularly relates to an error capture circuit and decoding method based on quantum cyclic burst error codes. Background Technology

[0002] In quantum information processing, interactions inevitably occur between the quantum system and its external environment, causing a severe decay in the coherence of the quantum system. This ultimately leads to the degradation from a coherent superposition state to a mixed state, resulting in quantum decoherence. Quantum noise interference caused by quantum decoherence is a major obstacle in quantum information processing. On the other hand, the imprecision of quantum logic gates causes quantum errors to spread rapidly during quantum computing, ultimately leading to computational failure—another major obstacle. Quantum error correction technology is a necessary means to protect quantum information against quantum decoherence and quantum noise in quantum computing and quantum communication. Well-designed quantum error-correcting codes are a crucial guarantee for the future realization of quantum computing and quantum communication.

[0003] Traditional quantum error-correcting code encoding and decoding research assumes that quantum noise interference has a completely independent impact on errors in quantum channels, based on Shor's discretized independent error model. However, quantum correlated errors are more realistic in their effect on noise interference in quantum memory channels. But both classical and quantum memory channels often lack deterministic probabilistic models to adequately describe them. In classical communication and digital storage, burst error correction codes are frequently used to correct correlated errors, and compared to random error correction codes, burst error correction codes often have higher code rates.

[0004] However, current quantum error correction techniques, especially the construction of quantum error-correcting codes, are mostly aimed at correcting independent and random errors. Research on quantum error-correcting encoding and decoding for correcting correlated errors in quantum memory channels is relatively lacking. The quantum burst error-correcting codes obtained so far are merely direct generalizations of the CSS construction method, which have significant limitations. More importantly, in addition to research on the encoding and construction of quantum codes, effective decoding algorithms are also needed to achieve low-latency, high-reliability quantum communication and fault-tolerant quantum computing. Summary of the Invention

[0005] The purpose of this invention is to provide a fast decoding algorithm for asymmetric quantum cyclic burst error codes, which quickly locates the error position by cyclically shifting the error symptom.

[0006] The technical solution to achieve the objective of this invention is as follows:

[0007] An error capture circuit based on quantum cyclic burst error codes includes a first switch, a second switch, a third switch, and an error-associated shift register;

[0008] The first switch is connected to the error-accompanied shift register, which is connected to the second switch and also connected to the third switch.

[0009] A fast decoding method for asymmetric quantum cyclic burst error codes based on this error capture circuit includes the following steps:

[0010] Step 1: Using a quantum measurement circuit, obtain the required X-error syndrome and Z-error syndrome, and save the results to the X-decode register and Z-decode register respectively.

[0011] Step 2: Circularly shift the X error symptom register in the X decoding register into the error capture circuit for decoding. By continuously circularly shifting the X error symptom register, it is detected whether the entire error sequence has been completely captured. If the X error sequence is detected to be completely captured, the decoding sequence X is output; otherwise, the decoding fails.

[0012] Step 3: Circularly shift the Z error sequence in the Z decoding register into the error capture circuit to decode the Z error. If the Z error sequence is completely captured, output the decoding sequence Z; otherwise, decoding fails.

[0013] Step 4: If both the X-error and Z-error decoders return successful decoding, then the final decoding is successful; otherwise, the decoding fails. At the same time, it is determined whether a degeneracy error has occurred.

[0014] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0015] (1) The technical solution of the present invention uses an error capture circuit based on quantum cyclic burst error code to quickly locate the error position by cyclically shifting the error accompaniment, which can correct any burst X error and Z error such as the codeword design decoding length range.

[0016] (2) In most channels, the occurrence of errors is highly asymmetric, and the probability of Z error is much higher than that of X error. Asymmetric quantum error correction codes can better adapt to the asymmetry of the channel. This invention corrects Z error and X error respectively for asymmetric quantum cyclic burst error codes, thus optimizing the decoding performance.

[0017] (3) The technical solution of the present invention takes into account that quantum coding theory is a new coding system. Its degeneracy is a special phenomenon that does not exist in the previous classical coding. The present invention fully considers the degeneracy in the decoding process to give full play to the decoding limit of quantum coding theory and achieves the correction of more quantum burst errors at the same code rate.

[0018] The present invention will be further described below with reference to the accompanying drawings and specific embodiments. Attached Figure Description

[0019] Figure 1 This is a flowchart illustrating the steps of the fast decoding method for asymmetric quantum cyclic burst error codes in this invention.

[0020] Figure 2 This is a circuit diagram of the X-quantum error capture circuit in an embodiment of the present invention.

[0021] Figure 3 This is a circuit diagram of the Z-quantum error capture system in an embodiment of the present invention.

[0022] Figures 4-6 This is a schematic diagram of the error-associated cyclic shift in the fast decoding method for asymmetric quantum cyclic burst error codes of the present invention. Detailed Implementation

[0023] An error capture circuit based on quantum cyclic burst error codes includes a first switch 1, a second switch 2, a third switch 3, and an error-accompanied shift register;

[0024] The first switch 1 is connected to the error-accompanied shift register, which is connected to the second switch 2 and also connected to the third switch 3.

[0025] A fast decoding method for asymmetric quantum cyclic burst error codes based on this error capture circuit includes the following steps:

[0026] Step 1: Using a quantum measurement circuit, obtain the required X-error syndrome and Z-error syndrome, and save the results to the X-decoding register and Z-decoding register respectively. Specifically:

[0027] Step 1-1: Construct an asymmetric quantum cyclic burst error code Q based on two classical linear cyclic codes C1 = [n, k1, l1] and C2 = [n, k2, l2] that satisfy the dual inclusion condition. B =[n,k1+k2-n,l Z / l X ], where n represents the code length, k represents the code rate, and l represents the burst error correction capability. X Represents the ability to correct sudden errors in X, l Z This represents the ability to correct Z-burst errors, and l Z ≥l X , l X ≥l1 and l Z ≥l2;

[0028] Step 1-2: Obtain the X and Z error synods required for decoding based on the cyclic codes C1 and C2:

[0029]

[0030]

[0031] Where H1 and H2 are the parity-check matrices of cyclic codes C1 and C2, respectively, e X For the X error that occurred in the channel, e Z Z-errors occurring in the channel;

[0032] Steps 1-3, f X with f Z They are respectively denoted as and Express the X-error and Z-error syndromes obtained in steps 1-2 in polynomial form:

[0033]

[0034]

[0035] Where r1 = n - k1 is the number of C1 check bits, and r2 = n - k2 is the number of C2 check bits;

[0036] The results are saved to the X decoder register and the Z decoder register respectively.

[0037] Step 2: The X error sequence in the X decoding register is cyclically shifted into the error capture circuit for decoding. By continuously shifting the X error sequence register, it is detected whether the entire error sequence has been completely captured. If the X error sequence is detected to be completely captured, the decoded sequence X is output; otherwise, decoding fails. Specifically:

[0038] Step 2-1: Circularly shift the X error symptom from the X decoding register into the error capture circuit for decoding. Perform a circular shift on the error symptom to determine if the error has been completely captured. Specifically:

[0039] Step 2-1-1, after 0≤i≤r1-l X After the shift, if X is incorrect, the subsequent l in the equation will be incorrect. X The bit check position is not all 0, and the preceding r1-l X If all check bits are 0, then the X error is successfully captured in the first l bits of the X error's syndrome. X If the code stops decoding, output the decoding result; otherwise, proceed to step 2-1-2.

[0040] Step 2-1-2, after r1-l X After +1≤i≤r1 shifts, if the shifted X is incorrect, the latter l in the formula will be incorrect. XThe bit check position is not all 0, and the first r1-l X If all check bits are 0, then the X error is successfully captured in the first l of the X error syndrome in the shifted codeword sequence. X If the decoding is complete, output the decoding result; otherwise, proceed to step 2-1-3.

[0041] Step 2-1-3: Continue shifting the X error syndrome until the entire cyclic shift process is completed. If the latter l in the shifted X error syndrome... X The bit check position is not all 0, and the first r1-l X If all values ​​are 0, then the X error is successfully captured in the first l of the X error syndrome in the shifted codeword sequence. X If the code stops decoding, output the decoding result; otherwise, proceed to step 2-1-4.

[0042] Step 2-1-4: After the entire cyclic shift process, if the shifted X is incorrect, it is accompanied by the first r1-l in the formula. X If all check bits are not all zero, return an X error indicating decoding failure.

[0043] Step 2-2: If the error is completely captured, output the decoding sequence X; otherwise, determine that the decoding has failed.

[0044] Step 3: The Z-error sequence in the Z-decoding register is cyclically shifted into the error capture circuit for Z-error decoding. If the Z-error sequence is completely captured, the decoded sequence Z is output; otherwise, decoding fails. Specifically:

[0045] Step 3-1: Circularly shift the Z error symptom from the Z decoder register into the error capture circuit for decoding. Perform a circular shift on the error symptom to determine if the error has been completely captured. Specifically:

[0046] Step 3-1-1, after 0≤i≤r²-l Z After the shift, if the Z error is accompanied by the last l in the formula Z The bit check position is not all 0, and the preceding r2-l Z If all check bits are 0, then the Z-error is successfully captured in the first l bits of the Z-error syndrome. Z If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-2.

[0047] Step 3-1-2, after r2-l Z After +1≤i≤r² shifts, if the Z error after the shift is accompanied by the latter l in the formula Z The bit check position is not all 0, and the first r2-l Z If all check bits are 0, then the Z-error is successfully captured in the first l of the Z-error syndrome in the shifted codeword sequence.Z If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-3.

[0048] Step 3-1-3: Continue shifting the Z-error syndrome until the entire cyclic shift process is completed. If the latter l in the shifted Z-error syndrome... Z The bit check position is not all 0, and the first r2-l Z If all values ​​are 0, then the Z-error is successfully captured in the first l of the Z-error syndrome in the shifted codeword sequence. Z If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-4.

[0049] Step 3-1-4: After the entire cyclic shift process, if the Z error after the shift is accompanied by the first r2-l in the formula... Z If all check bits are not all zero, a Z error is returned indicating decoding failure.

[0050] Step 3-2: If the error is completely captured, output the decoding sequence Z; otherwise, the decoding is considered to have failed.

[0051] Step 4: If both the X-error and Z-error decoders return successful decoding, then the final decoding is successful; otherwise, the decoding fails. At the same time, it is determined whether a degeneracy error has occurred.

[0052] The determination of whether a degeneracy error has occurred specifically refers to:

[0053] If l X =l1 and l Z If the value is l2, then the quantum cyclic burst error code is a non-degenerate code; otherwise, it is a degenerate code. Compared to non-degenerate codes, degenerate codes have stronger error correction capabilities and can correct more burst errors. The quantum capture decoder in step 3 can correct not only non-degenerate X errors with a burst error length less than or equal to l1, but also errors with a length greater than l1 but less than or equal to l2. X It can correct degenerate X errors. Furthermore, it can correct not only non-degenerate Z errors with a burst error length less than or equal to l², but also those with a length greater than l² but less than or equal to l. Z The degeneracy of Z is incorrect.

[0054] If both the X-error and Z-error decoders return successful decoding, then the decoding is successful; otherwise, the decoding fails. Additionally, if the length of the decoded X-error is greater than l1, it indicates that the X-error is a degeneracy error; if the length of the decoded Z-error is greater than l2, it indicates that the Z-error is a degeneracy error.

[0055] A computer device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, performs the following steps:

[0056] Step 1: Using a quantum measurement circuit, obtain the required X-error syndrome and Z-error syndrome, and save the results to the X-decode register and Z-decode register respectively.

[0057] Step 2: Circularly shift the X error symptom register in the X decoding register into the error capture circuit for decoding. By continuously circularly shifting the X error symptom register, it is detected whether the entire error sequence has been completely captured. If the X error sequence is detected to be completely captured, the decoding sequence X is output; otherwise, the decoding fails.

[0058] Step 3: Circularly shift the Z error sequence in the Z decoding register into the error capture circuit to decode the Z error. If the Z error sequence is completely captured, output the decoding sequence Z; otherwise, decoding fails.

[0059] Step 4: If both the X-error and Z-error decoders return successful decoding, then the final decoding is successful; otherwise, the decoding fails. At the same time, it is determined whether a degeneracy error has occurred.

[0060] A computer-storable medium having a computer program stored thereon, the computer program performing the following steps when executed by a processor:

[0061] Step 1: Using a quantum measurement circuit, obtain the required X-error syndrome and Z-error syndrome, and save the results to the X-decode register and Z-decode register respectively.

[0062] Step 2: Circularly shift the X error symptom register in the X decoding register into the error capture circuit for decoding. By continuously circularly shifting the X error symptom register, it is detected whether the entire error sequence has been completely captured. If the X error sequence is detected to be completely captured, the decoding sequence X is output; otherwise, the decoding fails.

[0063] Step 3: Circularly shift the Z error sequence in the Z decoding register into the error capture circuit to decode the Z error. If the Z error sequence is completely captured, output the decoding sequence Z; otherwise, decoding fails.

[0064] Step 4: If both the X-error and Z-error decoders return successful decoding, then the final decoding is successful; otherwise, the decoding fails. At the same time, it is determined whether a degeneracy error has occurred.

[0065] The present invention will be further described below with reference to embodiments.

[0066] Example

[0067] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0068] An error capture circuit based on quantum cyclic burst error codes includes a first switch 1, a second switch 2, a third switch 3, and an error-accompanied shift register;

[0069] The first switch 1 is connected to the error-accompanied shift register, which is connected to the second switch 2 and also connected to the third switch 3.

[0070] Reference Figure 2 and Figure 3 The circuits for capturing X and Z errors are presented.

[0071] by Figure 2 For example, firstly, switch 1 is turned on, and the X error complication in the X error register is sequentially shifted into the r1-bit X error complication shift register. The shift of the register is controlled by switch 2. After each shift, the first r1-1 bits of the register are checked. X If all bits are 0, the third switch 3 is turned on and the X error sequence is output; otherwise, the third switch 3 remains closed.

[0072] The principle for capturing Z errors is similar to that for X errors; please refer to [link / reference]. Figure 3 implement.

[0073] Combination Figure 1 A fast decoding method for asymmetric quantum cyclic burst error codes based on this error capture circuit includes the following steps:

[0074] Step 1: Using a quantum measurement circuit, obtain the required X-error syndrome and Z-error syndrome, and save the results to the X-decoding register and Z-decoding register respectively. Specifically:

[0075] Step 1-1: Construct an asymmetric quantum cyclic burst error code Q based on two classical linear cyclic codes C1 = [n, k1, l1] and C2 = [n, k2, l2] that satisfy the dual inclusion condition. B =[n,k1+k2-n,l Z / l X ], where n represents the code length, k represents the code rate, and l represents the burst error correction capability. X Represents the ability to correct sudden errors in X, l Z This represents the ability to correct Z-burst errors, and l Z ≥l X , l X≥l1 and l Z ≥l2;

[0076] Step 1-2: Obtain the X and Z error synods required for decoding based on the cyclic codes C1 and C2:

[0077]

[0078]

[0079] Where H1 and H2 are the parity-check matrices of cyclic codes C1 and C2, respectively, e X For the X error that occurred in the channel, e Z Z-errors occurring in the channel;

[0080] Steps 1-3, f X with f Z They are respectively denoted as and Express the X-error and Z-error syndromes obtained in steps 1-2 in polynomial form:

[0081]

[0082]

[0083] Where r1 = n - k1 is the number of C1 check bits, and r2 = n - k2 is the number of C2 check bits;

[0084] The results are saved to the X decoder register and the Z decoder register respectively.

[0085] Step 2, Combining Figure 4 The X error symptom register is cyclically shifted into the error capture circuit (error capture decoder) for decoding. By continuously cyclically shifting the X error symptom register, it is detected whether the entire error sequence has been completely captured. If the X error sequence is detected to be completely captured, the decoded sequence X is output; otherwise, decoding fails. Specifically:

[0086] Step 2-1: Circularly shift the X error symptom in the X decoding register into the error capture circuit (error capture decoder) for decoding. Perform a circular shift on the error symptom to determine if the error has been completely captured. Specifically:

[0087] Step 2-1-1, after 0≤i≤r1-l X After the shift, if X is incorrect, the subsequent l in the equation will be incorrect. X The bit check position is not all 0, and the preceding r1-l X If all check bits are 0, then the X error is successfully captured in the first l bits of the X error's syndrome. XIf the code stops decoding, output the decoding result; otherwise, proceed to step 2-1-2.

[0088] Step 2-1-2, after r1-l X After +1≤i≤r1 shifts, if the shifted X is incorrect, the latter l in the formula will be incorrect. X The bit check position is not all 0, and the first r1-l X If all check bits are 0, then the X error is successfully captured in the first l of the X error syndrome in the shifted codeword sequence. X If the decoding is complete, output the decoding result; otherwise, proceed to step 2-1-3.

[0089] Step 2-1-3: Continue shifting the X error syndrome until the entire cyclic shift process is completed. If the latter l in the shifted X error syndrome... X The bit check position is not all 0, and the first r1-l X If all values ​​are 0, then the X error is successfully captured in the first l of the X error syndrome in the shifted codeword sequence. X If the code stops decoding, output the decoding result; otherwise, proceed to step 2-1-4.

[0090] Step 2-1-4: After the entire cyclic shift process, if the shifted X is incorrect, it is accompanied by the first r1-l in the formula. X If all check bits are not all zero, return an X error indicating decoding failure.

[0091] Step 2-2: If the error is completely captured, output the decoding sequence X; otherwise, determine that the decoding has failed.

[0092] Step 3: The Z-error sequence in the Z-decoding register is cyclically shifted into the error capture circuit (error capture decoder) for Z-error decoding. If the Z-error sequence is completely captured, the decoded sequence Z is output; otherwise, decoding fails. Specifically:

[0093] Step 3-1: Circularly shift the Z error symptom from the Z decoder register into the error capture circuit (error capture decoder) for decoding. Perform a circular shift on the error symptom to determine if the error has been completely captured. Specifically:

[0094] Step 3-1-1, after 0≤i≤r²-l Z After the shift, if the Z error is accompanied by the last l in the formula Z The bit check position is not all 0, and the preceding r2-l Z If all check bits are 0, then the Z-error is successfully captured in the first l bits of the Z-error syndrome. Z If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-2.

[0095] Step 3-1-2, after r2-l Z After +1≤i≤r² shifts, if the Z error after the shift is accompanied by the latter l in the formula Z The bit check position is not all 0, and the first r2-l Z If all check bits are 0, then the Z-error is successfully captured in the first l of the Z-error syndrome in the shifted codeword sequence. Z If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-3.

[0096] Step 3-1-3: Continue shifting the Z-error syndrome until the entire cyclic shift process is completed. If the latter l in the shifted Z-error syndrome... Z The bit check position is not all 0, and the first r2-l Z If all values ​​are 0, then the Z-error is successfully captured in the first l of the Z-error syndrome in the shifted codeword sequence. Z If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-4.

[0097] Step 3-1-4: After the entire cyclic shift process, if the Z error after the shift is accompanied by the first r2-l in the formula... Z If all check bits are not all zero, a Z error is returned indicating decoding failure.

[0098] Step 3-2: If the error is completely captured, output the decoding sequence Z; otherwise, the decoding is considered to have failed.

[0099] Step 4: If both the X-error and Z-error decoders return successful decoding, then the final decoding is successful; otherwise, the decoding fails. At the same time, it is determined whether a degeneracy error has occurred.

[0100] The determination of whether a degeneracy error has occurred specifically refers to:

[0101] If l X =l1 and l Z =l2, then the quantum cyclic burst error code is a non-degenerate code; otherwise, it is a degenerate code. Compared to non-degenerate codes, degenerate codes have stronger error correction capabilities and can correct more burst errors.

[0102] The error capture circuits in steps 2 and 3 can correct not only non-degenerate X errors with a burst error length less than or equal to l1, but also errors with a length greater than l1 but less than or equal to l. X It can correct degenerate X errors. Furthermore, it can correct not only non-degenerate Z errors with a burst error length less than or equal to l², but also those with a length greater than l² but less than or equal to l. Z The degeneracy of Z is incorrect.

[0103] If both the X-error and Z-error decoders return successful decoding, then the decoding is successful; otherwise, the decoding fails. Additionally, if the length of the decoded X-error is greater than l1, it indicates that the X-error is a degeneracy error; if the length of the decoded Z-error is greater than l2, it indicates that the Z-error is a degeneracy error.

[0104] The technical solution of this invention, through an error capture circuit based on quantum cyclic burst error codes, rapidly locates the error position by cyclically shifting the error symptom, and can correct arbitrary burst X and Z errors, such as the codeword design decoding length range. Furthermore, based on asymmetric quantum cyclic burst error codes, it corrects Z and X errors separately, optimizing decoding performance. At the same time, it fully considers degeneracy characteristics in decoding to fully utilize the decoding limit of quantum coding theory, achieving the correction of more quantum burst errors at the same code rate.

Claims

1. A fast decoding method for asymmetric quantum cyclic burst error codes based on an error capture circuit of quantum cyclic burst error codes, characterized in that, The error capture circuit includes a first switch (1), a second switch (2), a third switch (3), and an error-accompanied shift register; The first switch (1) is connected to the error-accompanied shift register, the error-accompanied shift register is connected to the second switch (2), and the error-accompanied shift register is also connected to the third switch (3); The method includes the following steps: Step 1: Using a quantum measurement circuit, obtain the required X-error syndrome and Z-error syndrome, and save the results to the X-decode register and Z-decode register respectively. Step 2: Circularly shift the X error symptom register in the X decoding register into the error capture circuit for decoding. By continuously circularly shifting the X error symptom register, it is detected whether the entire error sequence has been completely captured. If the X error sequence is detected to be completely captured, the decoding sequence X is output; otherwise, the decoding fails. Step 3: Circularly shift the Z error sequence in the Z decoding register into the error capture circuit to decode the Z error. If the Z error sequence is completely captured, output the decoding sequence Z; otherwise, decoding fails. Step 4: If both the X-error and Z-error decoders return successful decoding, then the final decoding is successful; otherwise, the decoding fails. At the same time, it is determined whether a degeneracy error has occurred.

2. The fast decoding method for asymmetric quantum cyclic burst error codes according to claim 1, characterized in that, The specific steps in step 1 for obtaining the required X-error and Z-error syndromes are as follows: Step 1-1: Based on two classical linear cyclic codes that satisfy the dual inclusion condition and Constructing asymmetric quantum cyclic burst error codes ,in Represents code length, Represents bitrate. This represents the ability to correct unexpected errors. It represents the ability to correct sudden errors in X. This represents the ability to correct Z-burst errors, and , as well as ; Steps 1-2: Based on cyclic codes and To obtain the X and Z error syndromes required for decoding: ； ； in, and They are cyclic codes. and The verification matrix, For the X error that occurred in the channel, Z-errors occurring in the channel; Steps 1-3, and They are respectively denoted as and The X-error and Z-error syndromes obtained in steps 1-2 are expressed in polynomial form: ； ； Among them, for Check digits, for Verification bit length.

3. The fast decoding method for asymmetric quantum cyclic burst error codes according to claim 1, characterized in that, Decoding the X error syndrome in step 2 specifically involves: Step 2-1: Circularly shift the X error symptom in the X decoding register into the error capture circuit for decoding, circularly shift the error symptom, and determine whether the error has been completely captured. Step 2-2: If the error is completely captured, output the decoding sequence X; otherwise, determine that the decoding has failed.

4. The fast decoding method for asymmetric quantum cyclic burst error codes according to claim 3, characterized in that, The step 2-1, which involves cyclically shifting the error symptom to determine whether the error has been completely captured, specifically involves: Step 2-1-1, after After the shift, if X is incorrect, the following equation will be used. The check bits are not all 0, and the preceding bits are not all 0. If all check bits are 0, then the X error is successfully captured in the preceding part of the X error's syntactic expression. If the code stops decoding, output the decoding result; otherwise, proceed to step 2-1-2. Step 2-1-2, after After the shift, if the shifted X is incorrect, the following will occur in the equation: The check bits are not all 0, and the first bit is not all 0. If all check bits are 0, then the X error is successfully captured in the X error syndrome of the shifted codeword sequence. If the decoding is complete, output the decoding result; otherwise, proceed to step 2-1-3. Step 2-1-3: Continue shifting the X error syndrome until the entire cyclic shift process is completed. If the latter part of the shifted X error syndrome... The check bits are not all 0, and the first bit is not all 0. If all values ​​are 0, then the X error is successfully captured before the X error syndrome in the shifted codeword sequence. If the code stops decoding, output the decoding result; otherwise, proceed to step 2-1-4. Step 2-1-4: After the entire cyclic shift process, if the shifted X is incorrect, it is accompanied by the error in the preceding part of the formula. If all check bits are not all zero, return an X error indicating decoding failure.

5. The fast decoding method for asymmetric quantum cyclic burst error codes according to claim 1, characterized in that, Decoding the Z-error syndrome in step 3 specifically involves: Step 3-1: Circularly shift the Z error symptom in the Z decoder register into the error capture circuit for decoding, circularly shift the error symptom, and determine whether the error has been completely captured. Step 3-2: If the error is completely captured, output the decoding sequence Z; otherwise, the decoding is considered to have failed.

6. The fast decoding method for asymmetric quantum cyclic burst error codes according to claim 5, characterized in that, The step 3-1, which involves cyclically shifting the error symptom to determine whether the error has been completely captured, specifically involves: Step 3-1-1, after After the shift, if the Z error is accompanied by the following in the formula The check bits are not all 0, and the preceding bits are not all 0. If all check bits are 0, then the Z-error is successfully captured in the preceding Z-error syndrome. If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-2. Step 3-1-2, after After the shift, if the Z error after the shift is accompanied by the following in the formula... The check bits are not all 0, and the first bit is not all 0. If all check bits are 0, then the Z-error is successfully captured in the Z-error syndrome of the shifted codeword sequence. If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-3. Step 3-1-3: Continue shifting the Z-error syndrome until the entire cyclic shift process is completed. If the later part of the shifted Z-error syndrome... The check bits are not all 0, and the first bit is not all 0. If all values ​​are 0, then the Z-error is successfully captured in the preceding Z-error syndrome of the shifted codeword sequence. If the code stops decoding, output the decoding result; otherwise, proceed to step 3-1-4. Step 3-1-4: After the entire cyclic shift process, if the shifted Z error is accompanied by the preceding equation... If all check bits are not all zero, a Z error is returned indicating decoding failure.

7. The fast decoding method for asymmetric quantum cyclic burst error codes according to claim 2, characterized in that, The determination of whether a degeneracy error has occurred in step 4 is as follows: if and If so, then the quantum cyclic burst error code is a non-degenerate code; otherwise, it is a degenerate code.

8. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1-7.

9. A computer-storable medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1-7.

Images