METHOD OF PROCEDURAL THRESHOLDS IN QAP-BASED FAULT TOLERANCE QUANTUM COMPUTATION

Abstract

A method of constructing a procedural threshold in quotient algebra partition-based fault tolerance quantum computation, which is based on the framework of quotient algebra partition (QAP) applied in the fault tolerance quantum computation (FTQC), wherein an n-qubit fault tolerant encode of a k-qubit quantum gate M, is feasible to a threshold, wherein the method comprises: preparing a quantum code, with a stabilizer; creating an n-qubit encoding, in the quantum code, and obtaining an n-qubit fault tolerant encode of M; factorizing each encoded component, of this n-qubit fault tolerant encode; and producing a detection-correction operator by placing n-k ancilla qubits with the original system of n qubits, wherein the detection-correction operator comprises a conditional detection operator and a conditional correction operator to remove r-qubit spinor error. In terms of this invention, a fault-tolerant computation is conducted by the following criteria given a threshold 0<δth<1: a qubit keeps unchanged if it has the fidelity >δth and needs an error-correction if it has the fidelity <δth. Based on this concept, a fault tolerant method is constructed to be feasible to practical experiments composed of noisy systems, leading to scalable fault tolerance quantum computation.

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present disclosure generally relates to a method of quotient algebra partition-based fault tolerance quantum computation, particularly, to method of QAP fault tolerance quantum computation combined with procedural threshold.

2. Description of the Related Art

Due to the uncertainty of a quantum system, when the quantum computation is conducted in the quantum system, the qubit is so susceptible to the environment that its quantum coherence would be destroyed, which leads an unreliable computation result attributed to errors occurring with high probabilities.

The primary concept of fault tolerance quantum computation is that the errors in the computation can be precisely detected and corrected under the circumstance that the quantum state is encoded to achieve the exact solution, no matter how long the computation is. Therefore, fault tolerance quantum computation is deemed to be a solution for the errors in the quantum computation.

However, in current scheme of the concept of fault tolerance quantum computation, it has not been considered that in an encoded system, after applications of different numbers of quantum gates are performed for the qubits, the fidelities of qubits change due to the different error rates. The qubit-fidelity reflects whether the qubit remains its coherent state, which means if a qubit fidelity is lower than a certain threshold, it is more likely that an error correction would be performed to prevent from the qubit decoherence. Because of the assumption of the current scheme of the fault tolerance quantum computation, the error rates of all qubits in encoded state are identical, which means different qubit-fidelities among qubits, applied by quantum gates, would not be shown during the computation. Consequently, the choice of the quantum codes would be limited. Meanwhile, the design of the fault tolerance operator must fulfill the requirement of the transversal gate and the qualified fault tolerance operators are so rare, so the methods can implement fault tolerance with significant overheads which makes the achievement of the scalable quantum computation difficult.

Therefore, how to provide a scalable fault tolerance quantum computation becomes an urgent problem to be solved.

SUMMARY OF THE INVENTION

The present inventive concept provides a method of procedural thresholds in QAP-based fault tolerance quantum computation. The methodology of the present invention may implement any fault tolerance operator of any quantum gate in any quantum code. The present invention may conduct a fault tolerance computation of the error detection and the error correction in fully parallelism and factor in the differentiation between the error rate of the qubit.

In light of achieving the foregoing desired result, the present inventive concept provides a method of constructing a procedural threshold in quotient algebra partition-based fault tolerance quantum computation, which is based on the framework of quotient algebra partition (QAP) applied in the fault tolerance quantum computation (FTQC), wherein an n-qubit fault tolerant encode of a k-qubit quantum gate, M, is feasible to a threshold δ_th, and 0<δ_th<1, wherein the method comprises:

S1. preparing a quantum code, [n, k, C], with a stabilizer, C, wherein let n=k+r+l;

S2. creating an n-qubit encoding, Q_en, in the quantum code, letting =I_2n-k⊗M=₁₂ . . . _J; _i=I_2n-k⊗M_i, 1≤i≤J, and obtaining an n-qubit fault tolerant encode U_en;

S3. factorizing each encoded component, , of the n-qubit fault tolerant encode U_en, so that =(_r+1,p(r+1)⁽ⁱ⁾_n,p(n)⁽ⁱ⁾)+₀⁽ⁱ⁾(_r+1,p(r+1)⁽ⁱ⁾_r+2,p(r+2)⁽ⁱ⁾ . . . _n,p(n)⁽ⁱ⁾), where the _g,p(g)⁽ⁱ⁾ is an s-rotation or an identity, the ₀⁽ⁱ⁾ is an elementary generated by the s-rotations factorized from the encoded component , wherein the number of the s-rotation is p(n) and p(g)∈{1, 2, . . . , r}, r+1≤g≤n; and

S4. producing a detection-correction operator, DC_h, by placing n-k ancilla qubits in front of the n-qubits, wherein the detection-correction operator comprises a conditional detection operator and a conditional correction operator with r-qubit spinor error.

In an embodiment of the present inventive concept, the method further comprises 1≤r≤k and r≤l≤k in the step of S1.

In an embodiment of the present inventive concept, the stabilizer is defined as C={S_αu^ζu⊗I_2I⊗I_2k, S_α′v^ζ′v⊗S_βv^ηv∈su(2^r)⊗su(2^l)⊗su(2^k):u=1, 2, . . . , r; v=1, 2, . . . , l; ζ′_v·α_u+ζ_u·α′_v=0}, and r≤l≤Jk.

In an embodiment of the present inventive concept, the fault tolerant encode is defined as U_en=Q_enQ_en^†= . . . .

In an embodiment of the present inventive concept, in the step of S2, the encoded component is defined as =Q_eniQ_en^†.

In an embodiment of the present inventive concept, the detection-correction operator

${\mathrm{DC}}_h=\prod _{u=1}^r{\wedge }^{\left(n-k\right)}\left(S_u\right)·\prod _{q=1}^{N_E}{\wedge }^{\left(n-k\right)}\left(E_q\right).$

In an embodiment of the present inventive concept, the conditional detection operator is defined as ∧^(n-k)(S_u), and S_u=S_αu^ζu⊗I_2l⊗I_2k.

In an embodiment of the present inventive concept, in the step of S4, the number of the r-qubit spinor error is

$N_E=\sum _{u=1}^{r}3\left(\begin{array}{c}r\\ u\end{array}\right).$

In an embodiment of the present inventive concept, in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δ_th, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δ_th, then an error correction is not conducted.

The present inventive concept provides a method of procedural thresholds in QAP-based fault tolerance quantum computation. It can be determined by the method that whether the error detection and the error correction should be conducted in the computation process in the encoded system based on the criterion that whether the qubit fidelity is lower than the threshold. the method of the present inventive concept is able to perform the fault tolerance operators in any quantum and detect the errors exactly and reduce the computation depth and optimize the cost for the optimization of the error detection and error correction to achieve the scalable quantum computation.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart of an embodiment of the method provided by the present inventive concept;

FIG. 2 is a schematic diagram of a quantum circuit for computing a fault tolerant encode of the method provided by the present inventive concept;

FIG. 3 is a schematic diagram of a circuit for a fault tolerance computation of the present inventive concept;

FIG. 4 is a schematic diagram of a circuit of s-rotation

$R_{\alpha }^{\zeta }\left(\frac{\pi }{4}\right)\in \mathrm{SU}\left(2^n\right)$

of the present inventive concept;

FIG. 5 is a schematic diagram of a circuit of three scenarios of a component of Q_p of the encoded operation Q_en=Π_p=1^n-kQ_p of the present inventive concept;

FIG. 6 is a schematic diagram of a circuit of B_β of the present inventive concept;

FIG. 7 is a schematic diagram of a circuit of of the present inventive concept; and

FIG. 8 is a schematic diagram of a circuit for error detection and error correction of the method provided by the present inventive concept.

DETAILED DESCRIPTION

The present inventive concept is described by the following specific embodiments. Those with ordinary skills in the arts can readily understand other advantages and functions of the present inventive concept after reading the disclosure of this specification. Any changes or adjustments made to their relative relationships, without modifying the substantial technical contents, are also to be construed as within the range implementable by the present inventive concept.

Moreover, the word “exemplary” or “embodiment” is used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as exemplary or an embodiment is not necessarily to be construed as preferred or advantageous over other aspects or designs. Rather, use of the word “exemplary” or “embodiment” is intended to present concepts and techniques in a concrete fashion.

As used in this application, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise or clear from context, “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then “X employs A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more,” unless specified otherwise or clear from context to be directed to a singular form.

Please refer to FIGS. 1 and 2. FIG. 1 is a flowchart of an embodiment of the method provided by the present inventive concept and FIG. 2 is a schematic diagram of a quantum circuit for computing a fault tolerant encode of the method provided by the present inventive concept. The present inventive concept provides a method of constructing a procedural threshold in quotient algebra partition-based fault tolerance quantum computation, which is based on the framework of quotient algebra partition (QAP) applied in the fault tolerance quantum computation (FTQC), wherein an n-qubit fault tolerant encode of a k-qubit quantum gate, M, is feasible to a threshold δ_th, and 0<δ_th<1, wherein the method comprises:

S1. preparing a quantum code, [n, k, C], with a stabilizer, C, wherein let n=k+r+l;

S2. creating an n-qubit encoding, Q_en, in the quantum code, letting =I_2n-k⊗M=₁₂ . . . _J; _i=I_2n-k⊗M_i, 1≤i≤J, and obtaining an n-qubit fault tolerant encode U_en;

S3. factorizing each encoded component, , of the n-qubit fault tolerant encode U_en, so that =(_r+1,p(r+1)⁽ⁱ⁾_r+2,p(r+2)⁽ⁱ⁾ . . . _n,p(n)⁽ⁱ⁾)+₀⁽ⁱ⁾(_r+1,p(r+1)⁽ⁱ⁾_r+2,p(r+2)⁽ⁱ⁾ . . . _n,p(n)⁽ⁱ⁾), where the _g,p(g)⁽ⁱ⁾ is an s-rotation or an identity, the ₀⁽ⁱ⁾ is an elementary generated by the s-rotations factorized from the encoded component , wherein the number of the s-rotation is p(n) and p(g)∈{1, 2, . . . , r}, r+1≤g≤n; and

S4. producing a detection-correction operator, DC_h, by placing n-k ancilla qubits in front of the n-qubits, wherein the detection-correction operator comprises a conditional detection operator and a conditional correction operator with r-qubit spinor error.

In an embodiment of the present inventive concept, the method may further comprise 1≤r≤k and r≤l≤k in the step of S1.

In an embodiment of the present inventive concept, the stabilizer may be defined as C={S_αu^ζu⊗I_2l⊗I_2k, S_α′v^ζ′v⊗S_βv^ηv⊗S_γv^ξv∈su(2^r)⊗su(2^l)⊗su(2^k):u=1, 2, . . . , r; v=1, 2, . . . , l; ζ′_v·α_u+ζ_u·α′_v=0}, and r≤l≤Jk.

In an embodiment of the present inventive concept, the fault tolerant encode may be defined as U_en=Q_enQ_en^†= . . . .

In an embodiment of the present inventive concept, in the step of S2, the encoded component may be defined as =Q_enQ_en^†.

In an embodiment of the present inventive concept, the detection-correction operator

${\mathrm{DC}}_h=\prod _{u=1}^r{\wedge }^{\left(n-k\right)}\left(S_u\right)·\prod _{q=1}^{N_E}{\wedge }^{\left(n-k\right)}\left(E_q\right).$

In an embodiment of the present inventive concept, the conditional detection operator may be defined as ∧^(n-k)(S_u), and S_u=S_αu^ζu⊗I_2l⊗I_2k.

In an embodiment of the present inventive concept, in the step of S4, the number of the r-qubit spinor error may be

$N_E=\sum _{u=1}^{r}3\left(\begin{array}{c}r\\ u\end{array}\right).$

In an embodiment of the present inventive concept, in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δ_th, then an error correction may be conducted; and if the encoded fidelity is higher than or equals to δ_th, then an error correction may not be conducted.

According to the present inventive concept, in a scheme of QAP, a partition structure [k+r+l, k, C] composed of a stabilizer C and its cosets is prepared. The partition structure is a quantum code required for the present inventive concept to conduct the fault tolerance computation. A k-qubit quantum state and a k-qubit quantum gate are encoded as an encoded state with n=k+r+l qubits and a fault tolerance operator, respectively. Considering the error rates between the qubits are quite differentiated, the qubit fidelities are lower than the threshold and the error detection may occur in the first r encoded qubits. The fidelities of the last n-r qubits are far away higher than the threshold, so the error detection is required to be conducted for the first r qubits.

According to the present inventive concept, the quantum codes applied in the current schemes of the design of the fault tolerance mainly is Steane code and Reed-Muller code. The former one provides fault tolerance operators for Hadamard gate and controlled-not gate; and the latter one provides fault tolerance operator for

$\frac{\pi }{8}$

gate. The ratio of physical to logical qubits can approach 105:1. Furthermore, at least 100 multiqubit operators whose parallelism rates are quite different to each other, are required to conduct the error, which results a pretty high cost for the fault tolerance computation. The quantum code, [k+r+l, k, C], provided by the present inventive concept may implement any fault tolerance operator of any quantum gate and the ratio of physical to logical qubits is close to one. Specifically, in the current schemes, one logic qubit of fault tolerance computation takes about 105 to 1000 physical qubits to conduct. However, the fault tolerance computation of one logic qubit can be conducted by one or two physical qubits which makes the achievement of the scalable quantum computation possible. For example, it is estimated that about 23 million physical qubits are required to decrypt 2048-bit RSA QFT (Quantum Fourier Transform). This is almost impossible to implement by the current methods. However, it is estimated that less than five thousand physical qubits are required to decrypt 2048-bit RSA QFT by the present inventive concept.

Circuit Design of Fault Tolerant Encode

Any fault tolerant encode of an arbitrary k-qubit action M∈SU(2^k) in a quantum code [n, k, C] may be in a form of U_en=Q_enQ_en^†, where is a tensor product which may be written as =I_2n-k⊗M, Q_en is a encoding. The realization of the fault tolerant computation of M is accomplished in a certain number of rounds, where M=Π_h=1^PM_h=M_h . . . M₂M₁, and M is factorized into a product of P components, M_h. Each M_h is either a composition of basic operations or a single basic operation. As essential elements to build an arbitrary unitary action, the basic operations are selected from a so-called universal set of gates, such as Hadamard gate H,

$\frac{\pi }{8}-\mathrm{gate}T$

and controlled-not gate CNOT from a universal set adopted in current design of fault tolerance computation. The methodology of fault tolerance computation, as well as the framework of QAP provide a recursive procedure to acquire all admissible factorization of M algorithmically and exhaustively. Based on s-rotation, the action M can be factorized into a composition of basic operations and can be further reduced to rotations of lower qubits, e.g., 1-qubit and 2-qubit S-rotation. In fact, the infinite universal sets of basic operations admit building a s-rotation construction in a framework of QAP implies optimal quantum circuits of M under various constraints.

Please refer to FIG. 3 which is a schematic diagram of a circuit for a fault tolerance computation of the present inventive concept. In the QAP-based design, the fault tolerance computation of M is realized by performing the P-th encode U_ed,h=Q_enI_2n-k⊗M_hQ_en^† of basic operations M_h in order. In consideration of a k-qubit encoded state |ψ and the h-th basic operation M_h∈SU(2^k) in M, the circuit shown in FIG. 3 represents the fault tolerance computation of the h-th round U_ed,h in the code [n, k, C]. In this circuit, |ψ_ed^(h-1)=Q_en|0⊗M_h-1 . . . M₂M₁|ψ is the input state; the correction operation () =Π_q=1^l is composed of operators B_βq with syndrome β_q∈Z₂^n-k and each of B_βq is a component of one input coset; the correction operation =Π_v=1^sA_αv is composed of operators A_αu with syndrome α_u∈Z₂^n-k and each of A_αu is a component of one output coset); the transfer amplitude is a unitary operation; the operator V_d is for error detection; and the operator V_c is for error correction.

Please refer to FIGS. 4 and 5. FIG. 4 is a schematic diagram of a circuit of s-rotation

$R_{\alpha }^{\zeta }\left(\frac{\pi }{4}\right)\in \mathrm{SU}\left(2^n\right)$

of the present inventive concept and each component of Q_p of the encode Q_en=Q₁Q₂ . . . Q_n-k is illustrated by the circuit of three scenarios shown in FIG. 5, where 1≤p≤n−k. In FIG. 4, a controlled gate ∧₁(ωS_α^ζ) fulfills ∧₁(ωS_α^ζ)|0⊗|ψ and ∧₁(ωS_α^ζ)|1⊗|ψ=|1⊗(ωS_α^ζ)|ψ with the measurement of an ancilla qubit on the axis |0. Specifically, in the circuits shown in FIG. 5(a), Q_p=S_{α=a1a2. . . an}^{ζ=ε1ε2. . . εn}; in the circuits shown in FIG. 5(b),

$Q_p=R_{\alpha }^{\zeta }\left(\pm \frac{\pi }{4}\right);$

and in the circuits shown in FIG. 5(c),

$Q_p=R_{\alpha }^{\zeta }\left(\frac{\pi }{4}\right)R_{\beta }^{\eta }\left(\pm \frac{\pi }{4}\right),$

where η·α+ζ·β=1.

Please refer to FIGS. 6 and 7. In terms of s-rotations, each component B_β of with a corrector () β and a coset error _β∈su(2^k), costs a number 2^n-k of operations. Whereas, if B_β=P_n-k(_β) is rephrased into a controlled gate shown in FIG. 6 with the first n−k qubits as control bits and the last k qubits as target bits, then the complexity is effectively reduced. If the first n−k qubits are in the state of |β=|b₁b₂ . . . b_n-k, the last k qubits is applied by the spinor _β∈su(2^k) of coset error. In this embodiment, the controlled gate B_β can be factorized into a composition of O((n−k)²) Toffoli gates through the recursive application of the circuit reductions. Besides, in addition to a number n−k−2 of ancilla qubits, the complexity of B_β reduces to a linear cost. As shown in FIG. 7, B_β is composed of O(n) Toffoli gates and a single controlled-controlled gate ∧₂(_β). Here, the gate ∧₂(_β) obeys ∧₂(_β)|x₁x₂⊗|ϕ=(−1)^x1·x2=1|x₁x₂⊗_β|ϕ and ∧₂(_β)|x₁x₂⊗|ϕ=(−1)^x1·x2=0|x₁x₂⊗_β|ϕ, where ∈su(2^k) is a coset error of corrector and a k-qubit encoded state |ϕ, x₁, x₂∈Z₂. Each of the Toffoli gates are represented by five 2-qubit controlled gates and the same numbers of 2-qubit s-rotations, which allows B_β to be factorized into a linear cost of s-rotations. A similar circuit is used to illustrate each component A_α of the operation of the output coset =Π_α∈Z2n-kA_α.

Please refer to FIG. 8 which is a schematic diagram of a circuit for error detection and error correction of the method provided by the present inventive concept. there are n−k ancilla qubits, and the error-correction V_c follows behind the detection-correction operator V_d which is constituted by 2(n−k) parallel Hadamard gates and n−k multi-target controlled gates ∧₁(S_r) with detection operators, S_r=S_ar1^ϵr1⊗S_ar2^ϵr2⊗ ⊗S_arn^ϵrn∈su(2ⁿ), from an independent set S_c={S_r: 1≤r≤n−k⊂C}. The error-correction V_c is accomplished by performing a measurement to obtain a corrector α∈Z₂^n-k first and then applying a correction spinor S_α,v∈W_a,μ⊂Γ_α of the same corrector to obtain an uncorrupted state, U_ed,h|ψ_ed^(h-1).

The forementioned circuits demonstrate the ideal implementation of a QAP-based fault tolerance computation. The schemes of the circuit designs are flexible and customizable in various realizable quantum computing hardware. A practical design of a circuit being subject to physical constraints, such as coherence time, qubit configuration and qubit embedding, is achievable by adding structural gates, e.g., SWAP gates, properly.

Threshold Fault Tolerance

A scheme of scalable fault tolerance toward a practical quantum computer is demonstrated as follows.

For a k-qubit action M∈SU(2^k), the concept of the threshold fidelity 0<δ_th<1 indicates that there exists at least one qubit with fidelity <δ_th in the computation of M. In the encoded computation of M by a partition structure [n, k, C], each encoded qubit with its fidelity <δ_th must be error correctable.

In a partition structure [n, k, C], the fault tolerant encode of a k-qubit action M may be expressed as U_en=Q_enQ_en^†, where encoding Q_en∈SU(2ⁿ) and =I_2n-k⊗M. The operator of the output coset and the transfer amplitude are selected to be identity I_2n, thereby obtaining a simplified code () U_en=Q_enQ_en^†. In terms of basic operations, the operator of input coset =Σ_β∈Z2n-k|ββ|⊗_β is the main cost of U_ed, wherein a block-diagonal matrix contains all cosets of errors, _β=(−i)^ηβ·βS_β^ηβ∈su(2^k). If embraces more cosets equaling the identity I_2k, it is obvious that the cost of U_ed reduced, and furthermore, it could induce the condition =I_2n for an optimal cost of the encode. Note that the condition =I_2n is not employed in a partition to correct spinor errors of weight ≥1.

A k-qubit action M with a threshold fidelity δ_th, 0<δ_th<1, is given. A partition structure [n, k, C] exists, where M admits a fault tolerant encode feasible to δ_th.

Provided a k-qubit action M with a threshold fidelity δ_th, 0<δ_th<1, which is composed of J elementary s-rotations. A partition structure [n, k, C] exists, where M admits a fault tolerant encode feasible to δ_th which has a computation depth ≤2J(n−r) and the cost of error-correction ≤Jr.

As mentioned above, the present inventive concept provides a method of procedural thresholds in QAP-based fault tolerance quantum computation. It is a general methodology of fault tolerance quantum computation, FTQC, in the framework Quotient Algebra Partition, QAP, combined with the concept called procedural thresholds. When an operator M is acting on a quantum system, the qubit fidelity of at least one qubit would be lower than the threshold. The operator and the system are encoded simultaneously and the encoded operator is performed in the encoded system. The fidelity of error-correctable qubit must be lower than the same threshold.

It can be determined by the method provided by the present inventive concept that whether the error detection and the error correction should be conducted in the computation process in the encoded system based on the criterion that whether the qubit fidelity is lower than the threshold. The inventive concept may perform the fault tolerance operators in any quantum and detect the errors exactly and may reduce the computation depth and optimize the cost for the optimization of the error detection and error correction, which brings many benefits to the achievement of the scalable quantum computation. In terms of this invention, a fault-tolerant computation is conducted by the following criteria given a threshold 0<δ_th<1: a qubit keeps unchanged if it has the fidelity >δ_th and needs an error-correction if it has the fidelity <δ_th. Based on this concept, a fault tolerant method is constructed to be feasible to practical experiments composed of noisy systems, leading to scalable fault tolerance quantum computation.

The foregoing descriptions of the detailed embodiments are only illustrated to disclose the features and functions of the present inventive concept and not restrictive of the scope of the present inventive concept. It should be understood to those in the art that all modifications and variations according to the spirit and principle in the disclosure of the present inventive concept should fall within the scope of the appended claims.

Claims

1. A method of constructing a procedural threshold in quotient algebra partition-based fault tolerance quantum computation, which is based on the framework of quotient algebra partition (QAP) applied in the fault tolerance quantum computation (FTQC), wherein an n-qubit fault tolerant encode of a k-qubit quantum gate, M, is feasible to a threshold δth, and 0<δth<1, wherein the method comprises: S1. preparing a quantum code, [n, k, C], with a stabilizer, C, wherein let n=k+r+l;S2. creating an n-qubit encoding, Qen, in the quantum code, letting =I2n-k⊗M=12 . . . J; i=I2n-k⊗Mi, 1≤i≤J, and obtaining an n-qubit fault tolerant encode Uen;S3. factorizing each encoded component, , of the n-qubit fault tolerant encode Uen, so that =(r+1,p(r+1)(i)r+2,p(r+2)(i) . . . n,p(n)(i))+0(i)(r+1,p(r+1)(i)r+2,p(r+2)(i) . . . n,p(n)(i)), where the g,p(g)(i) is an s-rotation or an identity, the 0(i) is an elementary generated by the s-rotations factorized from the encoded component , wherein the number of the s-rotation is p(n) and p(g)∈{1, 2, . . . , r}, r+1≤g≤n; andS4. producing a detection-correction operator, DCh, by placing n-k ancilla qubits in front of the n-qubits, wherein the detection-correction operator comprises a conditional detection operator and a conditional correction operator with r-qubit spinor error.

2. The method of claim 1, further comprising 1≤r≤k and r≤l≤k in the step of S1.

3. The method of claim 1, wherein the stabilizer is defined as C={Sαuζu⊗I2l⊗I2k, Sα′vζ′v⊗Sβvηv⊗Sγvξv∈su(2r)⊗su(2l)⊗su(2k):u=1, 2, . . . , r; v=1, 2, . . . , l; ζ′v·αu+ζu·α′v=0}, and r≤l≤Jk.

4. The method of claim 1, wherein the fault tolerant encode is defined as Uen=QenQen†= . . . .

5. The method of claim 1, wherein in the step of S2, the encoded component is defined as =QenQen†.

6. The method of claim 1, wherein the detection-correction operator DCh=

7. The method of claim 1, wherein the conditional detection operator is defined as ∧(n-k)(Su), and Su=Sαuζu⊗I2l⊗I2k.

8. The method of claim 1, wherein in the step of S4, the number of the r-qubit spinor error is

9. The method of claim 1, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

10. The method of claim 2, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

11. The method of claim 3, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

12. The method of claim 4, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

13. The method of claim 5, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

14. The method of claim 6, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

15. The method of claim 7, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.

16. The method of claim 8, wherein in the r qubits in the quantum code, if the encoded fidelity is lower than the threshold δth, then an error correction is conducted; and if the encoded fidelity is higher than or equals to δth, then an error correction is not conducted.