
The five-qubit error correcting code or the
5,1,3">5,1,3 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
and
being
Pauli matrices
In mathematical physics and mathematics, the Pauli matrices are a set of three complex matrices that are traceless, Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma (), they are occasionally denoted by tau () ...
and
the
Identity matrix
In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. It has unique properties, for example when the identity matrix represents a geometric transformation, the obje ...
, this code's
generators are
. Its logical operators are
and
. Once the logical qubit is encoded, errors on the physical qubits can be detected via stabilizer measurements. A
lookup table
In computer science, a lookup table (LUT) is an array data structure, array that replaces runtime (program lifecycle phase), runtime computation of a mathematical function (mathematics), function with a simpler array indexing operation, in a proc ...
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.
[
]
History
Peter Shor
Peter Williston Shor (born August 14, 1959) is an American theoretical computer scientist known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the ...
original quantum error correcting code of 1995, used 9 qubits. The five-qubit error correcting code was published independently by two groups in 1996: by
Raymond Laflamme
Raymond Laflamme (born 1960), OC, FRSC is a Canadian theoretical physicist and founder and until mid 2017, was the director of the Institute for Quantum Computing at the University of Waterloo. He is also a professor in the Department of Physi ...
, Cesar Miquel,
Juan Pablo Paz
Juan Pablo Paz (born 1959) is an Argentinian physicist who works in the field of quantum computing. A research scientist currently working at the University of Buenos Aires, he has also worked at the Los Alamos National Laboratory in the United ...
,
Wojciech H. Zurek
Wojciech Hubert Zurek (; born 1951) is a Polish and American theoretical physicist and a leading authority on quantum theory, especially decoherence and non-equilibrium dynamics of symmetry breaking and resulting defect generation (known as the K ...
. and by
Charles H. Bennett,
David DiVincenzo
David P. DiVincenzo (born 1959) is an American theoretical physicist. He is the director of the Institute of Theoretical Nanoelectronics at the Peter Grünberg Institute at the Forschungszentrum Jülich and professor at the Institute for Quantum ...
,
John A. Smolin and
William Wootters
William "Bill" Kent Wootters is an American theoretical physicist, and one of the founders of the field of quantum information theory. In a 1982 joint paper with Wojciech H. Zurek, Wootters proved the no-cloning theorem, at the same time as De ...
.
Measurements

Stabilizer measurements are
parity measurement Parity measurement (also referred to as Operator measurement) is a procedure in quantum information science used for error detection in quantum qubits. A parity measurement checks the equality of two qubits to return a true or false answer, which ca ...
s that measure the stabilizers of physical qubits.
For example, to measure the first stabilizer (
), a parity measurement of
of the first qubit,
on the second,
on the third,
on the fourth, and
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
. If the measured ancilla is
, the logical qubit is
. If the measured ancilla is
, the logical qubit is
.
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
Commute, commutation or commutative may refer to:
* Commuting, the process of travelling between a place of residence and a place of work
Mathematics
* Commutative property, a property of a mathematical operation whose result is insensitive to th ...
with the stabilizers.
For example, if there is an
error on the first qubit and no errors on the others (
), it commutes with the first stabilizer
. This means that if an X error occurs on the first qubit, the first ancilla qubit will be 0. The second ancilla qubit:
, the third:
and the fourth
. So if an X error occurs on the first qubit, the syndrome will be
; which is shown in the table below, to the right of
. 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
, an
gate
A gate or gateway is a point of entry to or from a space enclosed by walls. The word is derived from Proto-Germanic language, Proto-Germanic ''*gatan'', meaning an opening or passageway. Synonyms include yett (which comes from the same root w ...
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
:
:
Stabilizer measurements followed by a
measurement can be used to encode a logical qubit into 5 physical qubits.
To prepare
, 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
is
, the logical state is
. If the result is
, the logical state is
and applying
will transform it into
.
References
{{Quantum computing, state=collapsed
Quantum computing