- Source: Five-qubit error correcting code
The five-qubit error correcting code is the smallest quantum error correcting code that can protect a logical qubit from any arbitrary single qubit error. In this code, 5 physical qubits are used to encode the logical qubit. With
X
{\displaystyle X}
and
Z
{\displaystyle Z}
being Pauli matrices and
I
{\displaystyle I}
the Identity matrix, this code's generators are
⟨
X
Z
Z
X
I
,
I
X
Z
Z
X
,
X
I
X
Z
Z
,
Z
X
I
X
Z
⟩
{\displaystyle \langle XZZXI,IXZZX,XIXZZ,ZXIXZ\rangle }
. Its logical operators are
X
¯
=
X
X
X
X
X
{\displaystyle {\bar {X}}=XXXXX}
and
Z
¯
=
Z
Z
Z
Z
Z
{\displaystyle {\bar {Z}}=ZZZZZ}
. Once the logical qubit is encoded, errors on the physical qubits can be detected via stabilizer measurements. A lookup table that maps the results of the stabilizer measurements to the types and locations of the errors gives the control system of the quantum computer enough information to correct errors.
Measurements
Stabilizer measurements are parity measurements that measure the stabilizers of physical qubits.
For example, to measure the first stabilizer (
X
Z
Z
X
I
{\displaystyle XZZXI}
), a parity measurement of
X
{\displaystyle X}
of the first qubit,
Z
{\displaystyle Z}
on the second,
Z
{\displaystyle Z}
on the third,
X
{\displaystyle X}
on the fourth, and
I
{\displaystyle I}
on the fifth is performed.
Since there are four stabilizers, 4 ancillas will be used to measure them. The first 4 qubits in the image above are the ancillas. The resulting bits from the ancillas is the syndrome; which encodes the type of error that occurred and its location.
A logical qubit can be measured in the computational basis by performing a parity measurement on
Z
¯
{\displaystyle {\bar {Z}}}
. If the measured ancilla is
0
{\displaystyle 0}
, the logical qubit is
|
0
L
⟩
{\displaystyle |0_{\rm {L}}\rangle }
. If the measured ancilla is
1
{\displaystyle 1}
, the logical qubit is
|
1
L
⟩
{\displaystyle |1_{\rm {L}}\rangle }
.
Error correction
It is possible to compute all the single qubit errors that can occur and how to correct them. This is done by calculating what errors commute with the stabilizers. For example, if there is an
X
{\displaystyle X}
error on the first qubit and no errors on the others (
X
1
=
X
I
I
I
I
{\displaystyle X_{1}=XIIII}
), it commutes with the first stabilizer
[
X
I
I
I
I
,
X
Z
Z
X
I
]
=
0
{\displaystyle [XIIII,XZZXI]=0}
. This means that if an X error occurs on the first qubit, the first ancilla qubit will be 0. The second ancilla qubit:
[
X
I
I
I
I
,
I
X
Z
Z
X
]
=
0
{\displaystyle [XIIII,IXZZX]=0}
, the third:
[
X
I
I
I
I
,
X
I
X
Z
Z
]
=
0
{\displaystyle [XIIII,XIXZZ]=0}
and the fourth
[
X
I
I
I
I
,
Z
X
I
X
Z
]
≠
0
{\displaystyle [XIIII,ZXIXZ]\neq 0}
. So if an X error occurs on the first qubit, the syndrome will be
0001
{\displaystyle 0001}
; which is shown in the table below, to the right of
X
1
{\displaystyle X_{1}}
. Similar calculations are realized for all other possible errors to fill out the table.
To correct an error, the same operation is performed on the physical qubit based on its syndrome. If the syndrome is
0001
{\displaystyle 0001}
, an
X
{\displaystyle X}
gate is applied to the first qubit to reverse the error.
Encoding
The first step in executing error corrected quantum computation is to encode the computer's initial state by transforming the physical qubits into logical codewords. The logical codewords for the five qubit code are
|
0
L
⟩
=
1
4
[
|
00000
⟩
+
|
10010
⟩
+
|
01001
⟩
+
|
10100
⟩
+
|
01010
⟩
−
|
11011
⟩
−
|
00110
⟩
−
|
11000
⟩
−
|
11101
⟩
−
|
00011
⟩
−
|
11110
⟩
−
|
01111
⟩
−
|
10001
⟩
−
|
01100
⟩
−
|
10111
⟩
+
|
00101
⟩
]
,
{\displaystyle {\begin{aligned}|0_{\rm {L}}\rangle ={\frac {1}{4}}[&|00000\rangle +|10010\rangle +|01001\rangle +|10100\rangle +|01010\rangle -|11011\rangle -|00110\rangle -|11000\rangle \\-&|11101\rangle -|00011\rangle -|11110\rangle -|01111\rangle -|10001\rangle -|01100\rangle -|10111\rangle +|00101\rangle ],\end{aligned}}}
|
1
L
⟩
=
1
4
[
|
11111
⟩
+
|
01101
⟩
+
|
10110
⟩
+
|
01011
⟩
+
|
10101
⟩
−
|
00100
⟩
−
|
11001
⟩
−
|
00111
⟩
−
|
00010
⟩
−
|
11100
⟩
−
|
00001
⟩
−
|
10000
⟩
−
|
01110
⟩
−
|
10011
⟩
−
|
01000
⟩
+
|
11010
⟩
]
.
{\displaystyle {\begin{aligned}|1_{\rm {L}}\rangle ={\frac {1}{4}}[&|11111\rangle +|01101\rangle +|10110\rangle +|01011\rangle +|10101\rangle -|00100\rangle -|11001\rangle -|00111\rangle \\-&|00010\rangle -|11100\rangle -|00001\rangle -|10000\rangle -|01110\rangle -|10011\rangle -|01000\rangle +|11010\rangle ].\end{aligned}}}
Stabilizer measurements followed by a
Z
¯
{\displaystyle {\bar {Z}}}
measurement can be used to encode a logical qubit into 5 physical qubits. To prepare
|
0
L
⟩
{\displaystyle |0_{\rm {L}}\rangle }
, perform stabilizer measurements and apply error correction. After error correction, the logical state is guaranteed to be a logical codeword. If the result of measuring
Z
¯
{\displaystyle {\bar {Z}}}
is
0
{\displaystyle 0}
, the logical state is
|
0
L
⟩
{\displaystyle |0_{\rm {L}}\rangle }
. If the result is
1
{\displaystyle 1}
, the logical state is
|
1
⟩
{\displaystyle |1\rangle }
and applying
X
¯
{\displaystyle {\bar {X}}}
will transform it into
|
0
L
⟩
{\displaystyle |0_{\rm {L}}\rangle }
.
References
Kata Kunci Pencarian:
- Five-qubit error correcting code
- Glossary of quantum computing
- Magic state distillation
- Bacon–Shor code
- Stabilizer code
- Cat state
- Superdense coding
- Timeline of quantum computing and communication
- Quantum information
- Quantum key distribution
