Stabilizer code

Short description: Quantum error correction code

In quantum computing and quantum communication, a stabilizer code is a class of quantum codes for performing quantum error correction. The toric code, and surface codes more generally,[1] are types of stabilizer codes considered very important for the practical realization of quantum information processing.

## Contents

* 1 Conceptual background
* 2 Mathematical background
* 3 Definition
* 4 Stabilizer error-correction conditions
* 5 Simple example of a stabilizer code
* 6 Example of a stabilizer code
* 7 Relation between Pauli group and binary vectors
* 8 References

## Conceptual background

Quantum error-correcting codes restore a noisy, decohered quantum state to a pure quantum state. A stabilizer quantum error-correcting code appends ancilla qubits to qubits that we want to protect. A unitary encoding circuit rotates the global state into a subspace of a larger Hilbert space. This highly entangled, encoded state corrects for local noisy errors. A quantum error-correcting code makes quantum computation and quantum communication practical by providing a way for a sender and receiver to simulate a noiseless qubit channel given a noisy qubit channel whose noise conforms to a particular error model. The first quantum error-correcting codes are strikingly similar to classical block codes in their operation and performance.

The stabilizer theory of quantum error correction allows one to import some classical binary or quaternary codes for use as a quantum code. However, when importing the classical code, it must satisfy the dual-containing (or self-orthogonality) constraint. Researchers have found many examples of classical codes satisfying this constraint, but most classical codes do not. Nevertheless, it is still useful to import classical codes in this way (though, see how the entanglement-assisted stabilizer formalism overcomes this difficulty).

## Mathematical background

The stabilizer formalism exploits elements of the Pauli group [math]\displaystyle{ \Pi }[/math] in formulating quantum error-correcting codes. The set [math]\displaystyle{ \Pi=\left\\{ I,X,Y,Z\right\\} }[/math] consists of the Pauli operators:

[math]\displaystyle{ I\equiv \begin{bmatrix} 1 & 0\\\ 0 & 1 \end{bmatrix} ,\ X\equiv \begin{bmatrix} 0 & 1\\\ 1 & 0 \end{bmatrix} ,\ Y\equiv \begin{bmatrix} 0 & -i\\\ i & 0 \end{bmatrix} ,\ Z\equiv \begin{bmatrix} 1 & 0\\\ 0 & -1 \end{bmatrix} . }[/math]

The above operators act on a single qubit – a state represented by a vector in a two-dimensional Hilbert space. Operators in [math]\displaystyle{ \Pi }[/math] have eigenvalues [math]\displaystyle{ \pm1 }[/math] and either commute or anti-commute. The set [math]\displaystyle{ \Pi^{n} }[/math] consists of [math]\displaystyle{ n }[/math]-fold tensor products of Pauli operators:

[math]\displaystyle{ \Pi^{n}=\left\\{ \begin{array} [c]{c} e^{i\phi}A_{1}\otimes\cdots\otimes A_{n}:\forall j\in\left\\{ 1,\ldots ,n\right\\} A_{j}\in\Pi,\ \ \phi\in\left\\{ 0,\pi/2,\pi,3\pi/2\right\\} \end{array} \right\\} . }[/math]

Elements of [math]\displaystyle{ \Pi^{n} }[/math] act on a quantum register of [math]\displaystyle{ n }[/math] qubits. We occasionally omit tensor product symbols in what follows so that

[math]\displaystyle{ A_{1}\cdots A_{n}\equiv A_{1}\otimes\cdots\otimes A_{n}. }[/math]

The [math]\displaystyle{ n }[/math]-fold Pauli group [math]\displaystyle{ \Pi^{n} }[/math] plays an important role for both the encoding circuit and the error-correction procedure of a quantum stabilizer code over [math]\displaystyle{ n }[/math] qubits.

## Definition

Let us define an [math]\displaystyle{ \left[ n,k\right] }[/math] stabilizer quantum error-correcting code to encode [math]\displaystyle{ k }[/math] logical qubits into [math]\displaystyle{ n }[/math] physical qubits. The rate of such a code is [math]\displaystyle{ k/n }[/math]. Its stabilizer [math]\displaystyle{ \mathcal{S} }[/math] is an abelian subgroup of the [math]\displaystyle{ n }[/math]-fold Pauli group [math]\displaystyle{ \Pi^{n} }[/math]. [math]\displaystyle{ \mathcal{S} }[/math] does not contain the operator [math]\displaystyle{ -I^{\otimes n} }[/math]. The simultaneous [math]\displaystyle{ +1 }[/math]-eigenspace of the operators constitutes the codespace. The codespace has dimension [math]\displaystyle{ 2^{k} }[/math] so that we can encode [math]\displaystyle{ k }[/math] qubits into it. The stabilizer [math]\displaystyle{ \mathcal{S} }[/math] has a minimal representation in terms of [math]\displaystyle{ n-k }[/math] independent generators

[math]\displaystyle{ \left\\{ g_{1},\ldots,g_{n-k}\ |\ \forall i\in\left\\{ 1,\ldots,n-k\right\\} ,\ g_{i}\in\mathcal{S}\right\\} . }[/math]

The generators are independent in the sense that none of them is a product of any other two (up to a global phase). The operators [math]\displaystyle{ g_{1},\ldots,g_{n-k} }[/math] function in the same way as a parity check matrix does for a classical linear block code.

## Stabilizer error-correction conditions

One of the fundamental notions in quantum error correction theory is that it suffices to correct a discrete error set with support in the Pauli group [math]\displaystyle{ \Pi^{n} }[/math]. Suppose that the errors affecting an encoded quantum state are a subset [math]\displaystyle{ \mathcal{E} }[/math] of the Pauli group [math]\displaystyle{ \Pi^{n} }[/math]:

[math]\displaystyle{ \mathcal{E}\subset\Pi^{n}. }[/math]

Because [math]\displaystyle{ \mathcal{E} }[/math] and [math]\displaystyle{ \mathcal{S} }[/math] are both subsets of [math]\displaystyle{ \Pi^{n} }[/math], an error [math]\displaystyle{ E\in\mathcal{E} }[/math] that affects an encoded quantum state either commutes or anticommutes with any particular element [math]\displaystyle{ g }[/math] in [math]\displaystyle{ \mathcal{S} }[/math]. The error [math]\displaystyle{ E }[/math] is correctable if it anticommutes with an element [math]\displaystyle{ g }[/math] in [math]\displaystyle{ \mathcal{S} }[/math]. An anticommuting error [math]\displaystyle{ E }[/math] is detectable by measuring each element [math]\displaystyle{ g }[/math] in [math]\displaystyle{ \mathcal{S} }[/math] and computing a syndrome [math]\displaystyle{ \mathbf{r} }[/math] identifying [math]\displaystyle{ E }[/math]. The syndrome is a binary vector [math]\displaystyle{ \mathbf{r} }[/math] with length [math]\displaystyle{ n-k }[/math] whose elements identify whether the error [math]\displaystyle{ E }[/math] commutes or anticommutes with each [math]\displaystyle{ g\in\mathcal{S} }[/math]. An error [math]\displaystyle{ E }[/math] that commutes with every element [math]\displaystyle{ g }[/math] in [math]\displaystyle{ \mathcal{S} }[/math] is correctable if and only if it is in [math]\displaystyle{ \mathcal{S} }[/math]. It corrupts the encoded state if it commutes with every element of [math]\displaystyle{ \mathcal{S} }[/math] but does not lie in [math]\displaystyle{ \mathcal{S} }[/math]. So we compactly summarize the stabilizer error-correcting conditions: a stabilizer code can correct any errors [math]\displaystyle{ E_{1},E_{2} }[/math] in [math]\displaystyle{ \mathcal{E} }[/math] if

[math]\displaystyle{ E_{1}^{\dagger}E_{2}\notin\mathcal{Z}\left( \mathcal{S}\right) }[/math]

[math]\displaystyle{ E_{1}^{\dagger}E_{2}\in\mathcal{S} }[/math]

where [math]\displaystyle{ \mathcal{Z}\left( \mathcal{S} \right) }[/math] is the centralizer of [math]\displaystyle{ \mathcal{S} }[/math] (i.e., the subgroup of elements that commute with all members of [math]\displaystyle{ \mathcal{S} }[/math], also known as the commutant).

## Simple example of a stabilizer code

A simple example of a stabilizer code is a three qubit [math]\displaystyle{ \left3,1,3\right }[/math] stabilizer code. It encodes [math]\displaystyle{ k=1 }[/math] logical qubit into [math]\displaystyle{ n=3 }[/math] physical qubits and protects against a single-bit flip error in the set [math]\displaystyle{ \left\\{ X_{i}\right\\} }[/math]. This does not protect against other Pauli errors such as phase flip errors in the set [math]\displaystyle{ \left\\{ Y_{i}\right\\} }[/math].or [math]\displaystyle{ \left\\{ Z_{i}\right\\} }[/math]. This has code distance [math]\displaystyle{ d=3 }[/math]. Its stabilizer consists of [math]\displaystyle{ n-k=2 }[/math] Pauli operators:

[math]\displaystyle{ \begin{array} [c]{ccc} g_{1} & = & Z & Z & I\\\ g_{2} & = & I & Z & Z\\\ \end{array} }[/math]

If there are no bit-flip errors, both operators [math]\displaystyle{ g_{1} }[/math] and [math]\displaystyle{ g_{2} }[/math] commute, the syndrome is +1,+1, and no errors are detected.

If there is a bit-flip error on the first encoded qubit, operator [math]\displaystyle{ g_{1} }[/math] will anti-commute and [math]\displaystyle{ g_{2} }[/math] commute, the syndrome is -1,+1, and the error is detected. If there is a bit-flip error on the second encoded qubit, operator [math]\displaystyle{ g_{1} }[/math] will anti-commute and [math]\displaystyle{ g_{2} }[/math] anti-commute, the syndrome is -1,-1, and the error is detected. If there is a bit-flip error on the third encoded qubit, operator [math]\displaystyle{ g_{1} }[/math] will commute and [math]\displaystyle{ g_{2} }[/math] anti-commute, the syndrome is +1,-1, and the error is detected.

## Example of a stabilizer code

Main page: Five-qubit error correcting code

An example of a stabilizer code is the five qubit [math]\displaystyle{ \left5,1,3\right }[/math] stabilizer code. It encodes [math]\displaystyle{ k=1 }[/math] logical qubit into [math]\displaystyle{ n=5 }[/math] physical qubits and protects against an arbitrary single-qubit error. It has code distance [math]\displaystyle{ d=3 }[/math]. Its stabilizer consists of [math]\displaystyle{ n-k=4 }[/math] Pauli operators:

[math]\displaystyle{ \begin{array} [c]{ccccccc} g_{1} & = & X & Z & Z & X & I\\\ g_{2} & = & I & X & Z & Z & X\\\ g_{3} & = & X & I & X & Z & Z\\\ g_{4} & = & Z & X & I & X & Z \end{array} }[/math]

The above operators commute. Therefore, the codespace is the simultaneous +1-eigenspace of the above operators. Suppose a single-qubit error occurs on the encoded quantum register. A single-qubit error is in the set [math]\displaystyle{ \left\\{ X_{i},Y_{i},Z_{i}\right\\} }[/math] where [math]\displaystyle{ A_{i} }[/math] denotes a Pauli error on qubit [math]\displaystyle{ i }[/math]. It is straightforward to verify that any arbitrary single-qubit error has a unique syndrome. The receiver corrects any single-qubit error by identifying the syndrome via a parity measurement and applying a corrective operation.

## Relation between Pauli group and binary vectors

A simple but useful mapping exists between elements of [math]\displaystyle{ \Pi }[/math] and the binary vector space [math]\displaystyle{ \left( \mathbb{Z}_{2}\right) ^{2} }[/math]. This mapping gives a simplification of quantum error correction theory. It represents quantum codes with binary vectors and binary operations rather than with Pauli operators and matrix operations respectively.

We first give the mapping for the one-qubit case. Suppose [math]\displaystyle{ \left[ A\right] }[/math] is a set of equivalence classes of an operator [math]\displaystyle{ A }[/math] that have the same phase:

[math]\displaystyle{ \left[ A\right] =\left\\{ \beta A\ |\ \beta\in\mathbb{C},\ \left\vert \beta\right\vert =1\right\\} . }[/math]

Let [math]\displaystyle{ \left[ \Pi\right] }[/math] be the set of phase-free Pauli operators where [math]\displaystyle{ \left[ \Pi\right] =\left\\{ \left[ A\right] \ |\ A\in\Pi\right\\} }[/math]. Define the map [math]\displaystyle{ N:\left( \mathbb{Z}_{2}\right) ^{2}\rightarrow\Pi }[/math] as

[math]\displaystyle{ 00 \to I, \,\, 01 \to X, \,\, 11 \to Y, \,\, 10 \to Z }[/math]

Suppose [math]\displaystyle{ u,v\in\left( \mathbb{Z}_{2}\right) ^{2} }[/math]. Let us employ the shorthand [math]\displaystyle{ u=\left( z|x\right) }[/math] and [math]\displaystyle{ v=\left( z^{\prime}|x^{\prime }\right) }[/math] where [math]\displaystyle{ z }[/math], [math]\displaystyle{ x }[/math], [math]\displaystyle{ z^{\prime} }[/math], [math]\displaystyle{ x^{\prime}\in\mathbb{Z}_{2} }[/math]. For example, suppose [math]\displaystyle{ u=\left( 0|1\right) }[/math]. Then [math]\displaystyle{ N\left( u\right) =X }[/math]. The map [math]\displaystyle{ N }[/math] induces an isomorphism [math]\displaystyle{ \left[ N\right]  :\left( \mathbb{Z} _{2}\right) ^{2}\rightarrow\left[ \Pi\right] }[/math] because addition of vectors in [math]\displaystyle{ \left( \mathbb{Z}_{2}\right) ^{2} }[/math] is equivalent to multiplication of Pauli operators up to a global phase:

[math]\displaystyle{ \left[ N\left( u+v\right) \right] =\left[ N\left( u\right) \right] \left[ N\left( v\right) \right] . }[/math]

Let [math]\displaystyle{ \odot }[/math] denote the symplectic product between two elements [math]\displaystyle{ u,v\in\left( \mathbb{Z}_{2}\right) ^{2} }[/math]:

[math]\displaystyle{ u\odot v\equiv zx^{\prime}-xz^{\prime}. }[/math]

The symplectic product [math]\displaystyle{ \odot }[/math] gives the commutation relations of elements of [math]\displaystyle{ \Pi }[/math]:

[math]\displaystyle{ N\left( u\right) N\left( v\right) =\left( -1\right) ^{\left( u\odot v\right) }N\left( v\right) N\left( u\right) . }[/math]

The symplectic product and the mapping [math]\displaystyle{ N }[/math] thus give a useful way to phrase Pauli relations in terms of binary algebra. The extension of the above definitions and mapping [math]\displaystyle{ N }[/math] to multiple qubits is straightforward. Let [math]\displaystyle{ \mathbf{A}=A_{1}\otimes\cdots\otimes A_{n} }[/math] denote an arbitrary element of [math]\displaystyle{ \Pi^{n} }[/math]. We can similarly define the phase-free [math]\displaystyle{ n }[/math]-qubit Pauli group [math]\displaystyle{ \left[ \Pi^{n}\right] =\left\\{ \left[ \mathbf{A}\right] \ |\ \mathbf{A}\in\Pi^{n}\right\\} }[/math] where

[math]\displaystyle{ \left[ \mathbf{A}\right] =\left\\{ \beta\mathbf{A}\ |\ \beta\in \mathbb{C},\ \left\vert \beta\right\vert =1\right\\} . }[/math]

The group operation [math]\displaystyle{ \ast }[/math] for the above equivalence class is as follows:

[math]\displaystyle{ \left[ \mathbf{A}\right] \ast\left[ \mathbf{B}\right] \equiv\left[ A_{1}\right] \ast\left[ B_{1}\right] \otimes\cdots\otimes\left[ A_{n}\right] \ast\left[ B_{n}\right] =\left[ A_{1}B_{1}\right] \otimes\cdots\otimes\left[ A_{n}B_{n}\right] =\left[ \mathbf{AB}\right] . }[/math]

The equivalence class [math]\displaystyle{ \left[ \Pi^{n}\right] }[/math] forms a commutative group under operation [math]\displaystyle{ \ast }[/math]. Consider the [math]\displaystyle{ 2n }[/math]-dimensional vector space

[math]\displaystyle{ \left( \mathbb{Z}_{2}\right) ^{2n}=\left\\{ \left( \mathbf{z,x}\right) :\mathbf{z},\mathbf{x}\in\left( \mathbb{Z}_{2}\right) ^{n}\right\\} . }[/math]

It forms the commutative group [math]\displaystyle{ (\left( \mathbb{Z}_{2}\right) ^{2n},+) }[/math] with operation [math]\displaystyle{ + }[/math] defined as binary vector addition. We employ the notation [math]\displaystyle{ \mathbf{u}=\left( \mathbf{z}|\mathbf{x}\right) ,\mathbf{v}=\left( \mathbf{z}^{\prime}|\mathbf{x}^{\prime}\right) }[/math] to represent any vectors [math]\displaystyle{ \mathbf{u,v}\in\left( \mathbb{Z}_{2}\right) ^{2n} }[/math] respectively. Each vector [math]\displaystyle{ \mathbf{z} }[/math] and [math]\displaystyle{ \mathbf{x} }[/math] has elements [math]\displaystyle{ \left( z_{1},\ldots ,z_{n}\right) }[/math] and [math]\displaystyle{ \left( x_{1},\ldots,x_{n}\right) }[/math] respectively with similar representations for [math]\displaystyle{ \mathbf{z}^{\prime} }[/math] and [math]\displaystyle{ \mathbf{x}^{\prime} }[/math]. The symplectic product [math]\displaystyle{ \odot }[/math] of [math]\displaystyle{ \mathbf{u} }[/math] and [math]\displaystyle{ \mathbf{v} }[/math] is

[math]\displaystyle{ \mathbf{u}\odot\mathbf{v\equiv}\sum_{i=1}^{n}z_{i}x_{i}^{\prime}-x_{i} z_{i}^{\prime}, }[/math]

[math]\displaystyle{ \mathbf{u}\odot\mathbf{v\equiv}\sum_{i=1}^{n}u_{i}\odot v_{i}, }[/math]

where [math]\displaystyle{ u_{i}=\left( z_{i}|x_{i}\right) }[/math] and [math]\displaystyle{ v_{i}=\left( z_{i}^{\prime }|x_{i}^{\prime}\right) }[/math]. Let us define a map [math]\displaystyle{ \mathbf{N}:\left( \mathbb{Z}_{2}\right) ^{2n}\rightarrow\Pi^{n} }[/math] as follows:

[math]\displaystyle{ \mathbf{N}\left( \mathbf{u}\right) \equiv N\left( u_{1}\right) \otimes\cdots\otimes N\left( u_{n}\right) . }[/math]

Let

[math]\displaystyle{ \mathbf{X}\left( \mathbf{x}\right) \equiv X^{x_{1}}\otimes\cdots\otimes X^{x_{n}}, \,\,\,\,\,\,\, \mathbf{Z}\left( \mathbf{z}\right) \equiv Z^{z_{1}}\otimes\cdots\otimes Z^{z_{n}}, }[/math]

so that [math]\displaystyle{ \mathbf{N}\left( \mathbf{u}\right) }[/math] and [math]\displaystyle{ \mathbf{Z}\left( \mathbf{z}\right) \mathbf{X}\left( \mathbf{x}\right) }[/math] belong to the same equivalence class:

[math]\displaystyle{ \left[ \mathbf{N}\left( \mathbf{u}\right) \right] =\left[ \mathbf{Z} \left( \mathbf{z}\right) \mathbf{X}\left( \mathbf{x}\right) \right] . }[/math]

The map [math]\displaystyle{ \left[ \mathbf{N}\right]  :\left( \mathbb{Z}_{2}\right) ^{2n}\rightarrow\left[ \Pi^{n}\right] }[/math] is an isomorphism for the same reason given as in the previous case:

[math]\displaystyle{ \left[ \mathbf{N}\left( \mathbf{u+v}\right) \right] =\left[ \mathbf{N}\left( \mathbf{u}\right) \right] \left[ \mathbf{N}\left( \mathbf{v}\right) \right] , }[/math]

where [math]\displaystyle{ \mathbf{u,v}\in\left( \mathbb{Z}_{2}\right) ^{2n} }[/math]. The symplectic product captures the commutation relations of any operators [math]\displaystyle{ \mathbf{N}\left( \mathbf{u}\right) }[/math] and [math]\displaystyle{ \mathbf{N}\left( \mathbf{v}\right) }[/math]:

[math]\displaystyle{ \mathbf{N\left( \mathbf{u}\right) N}\left( \mathbf{v}\right) =\left( -1\right) ^{\left( \mathbf{u}\odot\mathbf{v}\right) }\mathbf{N}\left( \mathbf{v}\right) \mathbf{N}\left( \mathbf{u}\right) . }[/math]

The above binary representation and symplectic algebra are useful in making the relation between classical linear error correction and quantum error correction more explicit.

By comparing quantum error correcting codes in this language to symplectic vector spaces, we can see the following. A symplectic subspace corresponds to a direct sum of Pauli algebras (i.e., encoded qubits), while an isotropic subspace corresponds to a set of stabilizers.

## References

1. ↑ "What is the "surface code" in the context of quantum error correction?". https://quantumcomputing.stackexchange.com/questions/2106/what-is-the-surface-code-in-the-context-of-quantum-error-correction.

* D. Gottesman, "Stabilizer codes and quantum error correction," quant-ph/9705052, Caltech Ph.D. thesis. https://arxiv.org/abs/quant-ph/9705052
* Shor, Peter W. (1995-10-01). "Scheme for reducing decoherence in quantum computer memory". Physical Review A (American Physical Society (APS)) 52 (4): R2493–R2496. doi:10.1103/physreva.52.r2493. ISSN 1050-2947. PMID 9912632. Bibcode: 1995PhRvA..52.2493S.
* Calderbank, A. R.; Shor, Peter W. (1996-08-01). "Good quantum error-correcting codes exist". Physical Review A (American Physical Society (APS)) 54 (2): 1098–1105. doi:10.1103/physreva.54.1098. ISSN 1050-2947. PMID 9913578. Bibcode: 1996PhRvA..54.1098C.
* Steane, A. M. (1996-07-29). "Error Correcting Codes in Quantum Theory". Physical Review Letters (American Physical Society (APS)) 77 (5): 793–797. doi:10.1103/physrevlett.77.793. ISSN 0031-9007. PMID 10062908. Bibcode: 1996PhRvL..77..793S.
* A. Calderbank, E. Rains, P. Shor, and N. Sloane, “Quantum error correction via codes over GF(4),” IEEE Trans. Inf. Theory, vol. 44, pp. 1369–1387, 1998. Available at https://arxiv.org/abs/quant-ph/9608006

* v
* t
* e

Quantum information science

General|

* Quantum computing
* Qubit
* physical vs. logical
* DiVincenzo's criteria
* Quantum information
* Quantum programming
* Quantum processors
* Cloud-based quantum computing
* Timeline of quantum computing

Theorems|

* Bell's theorem
* Gleason's theorem
* Gottesman–Knill theorem
* Holevo's theorem
* Margolus–Levitin theorem
* No-broadcast theorem
* No-cloning theorem
* No-communication theorem
* No-deleting theorem
* No-hiding theorem
* No-teleportation theorem
* PBR theorem
* Quantum threshold theorem

Quantum
communication|

* Quantum capacity
* Classical capacity
* Entanglement-assisted classical capacity
* Quantum channel
* Quantum network
* Quantum cryptography
* Quantum key distribution
* BB84
* SARG04
* Three-stage quantum cryptography protocol
* Quantum teleportation
* Superdense coding
* LOCC
* Entanglement distillation

Quantum algorithms|

* Universal quantum simulator
* Deutsch–Jozsa algorithm
* Grover's algorithm
* Quantum Fourier transform
* Shor's algorithm
* Simon's problem
* Quantum phase estimation algorithm
* Quantum counting algorithm
* Quantum annealing
* Quantum algorithm for linear systems of equations
* Amplitude amplification

Quantum
complexity theory|

* Quantum Turing machine
* EQP
* BQP
* QMA
* PostBQP
* QIP

Quantum
computing models|

* Quantum circuit
* Quantum logic gate
* One-way quantum computer
* cluster state
* Adiabatic quantum computation
* Topological quantum computer

Quantum
error correction|

* Stabilizer codes
* Entanglement-Assisted Quantum Error Correction
* Shor code
* Steane code
* CSS code
* Quantum convolutional codes
* Toric code

Physical
implementations|

| Quantum optics|

* Cavity QED
* Circuit QED
* Linear optical quantum computing
* KLM protocol
* Boson sampling

|

Ultracold atoms|

* Trapped ion quantum computer
* Optical lattice

Spin-based|

* Nuclear magnetic resonance QC
* Kane QC
* Loss–DiVincenzo QC
* Nitrogen-vacancy center

Superconducting
quantum computing|

* Charge qubit
* Flux qubit
* Phase qubit
* Transmon

Software|

* libquantum
* OpenQASM
* Q#
* Qiskit
* IBM Q Experience

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Stabilizer code. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Stabilizer_code&oldid=3375007"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template