[Jump to code hierarchy]

Kitaev chain code[1]

Alternative names: Majorana repetition code.

Description

A Majorana stabilizer code obtained from the ground-state subspace of the Kitaev Majorana chain in its fermionic topological phase [1]. Its codespace is stabilized by nearest-neighbor Majorana bilinears, while two unpaired edge Majoranas furnish one logical fermionic mode. Under parity-preserving noise, it behaves as the Majorana analogue of the repetition code [2].

At the fixed-point limit, the code Hamiltonian is proportional to \(-\sum_{j=1}^{n-1} i \gamma_{2j}\gamma_{2j+1}\), so the codespace is the common \(+1\) eigenspace of the stabilizers \(S_j=i\gamma_{2j}\gamma_{2j+1}\). The two unpaired edge operators \(\gamma_{1}\) and \(\gamma_{2n}\) are the Majorana zero modes (MZMs) or Majorana edge modes (MEMs); they commute with all stabilizers and define a logical fermionic mode \(f_{\mathrm{L}}=(\gamma_{1}+i\gamma_{2n})/2\). Via the Jordan-Wigner transformation, the model maps to the 1D quantum Ising chain in its symmetry-breaking phase. The code can be thought of as the Majorana stabilizer analogue of the quantum repetition code: parity-preserving dephasing operators \(Z_j=i\gamma_{2j-1}\gamma_{2j}\) play the role of repetition-code bit flips, while the logical Majorana operators have odd weight and therefore encode a logical fermion [2].

The two basis states of a single chain have opposite fermionic parity. Therefore, a single chain does not by itself furnish a fixed-parity qubit encoding; coherent superpositions between the two basis states are not directly accessible in an isolated fermionic system with parity superselection. One can combine two such code blocks to form a Majorana box qubit, which is the fixed-parity subspace of the combined codespace. Odd numbers of code blocks also contain fixed-parity logical subspaces in their codespace.

Protection

In the fixed-point limit, local parity-preserving bilinears such as \(Z_j=i\gamma_{2j-1}\gamma_{2j}\) anticommute with nearby stabilizers, so the chain behaves as a repetition code against dephasing or phase errors [2]. For a finite chain, the splitting between the two code states is exponentially small in the separation between the edge modes [1]. As a Majorana stabilizer code, however, its distance is \(1\) because a single MZM is already a logical operator. The code therefore does not protect against single-Majorana, parity-violating errors such as quasiparticle poisoning. Disorder may help with protection [3].

Gates

Braiding, \(S\), and \(T\) phase gates, fermion \(CZ_f\), and mixed qubit-fermion \(CZ_{qf}\) gates are described for logical fermions encoded in this repetition code [2].

Decoding

Local automaton decoder based on self-dual cellular automaton [4].Syndrome extraction of the stabilizers \(S_j=i\gamma_{2j}\gamma_{2j+1}\) can be performed by interfacing with a qubit ancilla and mixed qubit-fermion gates [2].

Realizations

Photonic systems: braiding of topological Majorana modes has been simulated in a device that has a different notion of locality than a bona fide fermionic system [5].Superconducting circuits: preparation [6], braiding [7], and detection of Majorana edge modes [7,8] have been simulated in devices that have a different notion of locality than a bona fide fermionic system.

Notes

See notes [9] for a description of this code.

Cousins

  • Quantum repetition code— The Kitaev chain code can be thought of as the Majorana stabilizer analogue of the quantum repetition code [2] and is related to that code via the Jordan-Wigner transformation [9].
  • Jordan-Wigner transformation code— The Kitaev chain code can be thought of as the Majorana stabilizer analogue of the quantum repetition code [2] and is related to that code via the Jordan-Wigner transformation [9].
  • 3D fermionic surface code— The 3D fermionic surface code is the result of applying the 3D bosonization mapping to a trivial fermionic theory [10]. Twist defects in the 3D fermionic surface code take the form of Kitaev chains after the mapping [10,11].

Primary Hierarchy

Parents
Majorana box qubit codes are defined to be positive-parity logical subspaces of two or more Kitaev-chain code blocks. The parameter \(n\) in the MBQ code definition corresponds to the number of Kitaev chains used in the construction, and not the total number of physical Majorana modes of the chains.
The Kitaev chain is a 1D fermionic SPT (more precisely, a 1D topological superconductor) protected by fermion parity symmetry.
Kitaev chain code

References

[1]
A. Y. Kitaev, “Unpaired Majorana fermions in quantum wires”, Physics-Uspekhi 44, 131 (2001) arXiv:cond-mat/0010440 DOI
[2]
A. Schuckert, E. Crane, A. V. Gorshkov, M. Hafezi, and M. J. Gullans, “Fault-tolerant fermionic quantum computing”, (2025) arXiv:2411.08955
[3]
S. Bravyi and R. König, “Disorder-Assisted Error Correction in Majorana Chains”, Communications in Mathematical Physics 316, 641 (2012) arXiv:1108.3845 DOI
[4]
N. Lang and H. P. Büchler, “Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata”, SciPost Physics 4, (2018) arXiv:1711.08196 DOI
[5]
J.-S. Xu, K. Sun, Y.-J. Han, C.-F. Li, J. K. Pachos, and G.-C. Guo, “Simulating the exchange of Majorana zero modes with a photonic system”, Nature Communications 7, (2016) arXiv:1411.7751 DOI
[6]
K. J. Sung, M. J. Rančić, O. T. Lanes, and N. T. Bronn, “Simulating Majorana zero modes on a noisy quantum processor”, Quantum Science and Technology 8, 025010 (2023) arXiv:2206.00563 DOI
[7]
N. Harle, O. Shtanko, and R. Movassagh, “Observing and braiding topological Majorana modes on programmable quantum simulators”, Nature Communications 14, (2023) arXiv:2203.15083 DOI
[8]
X. Mi et al., “Noise-resilient edge modes on a chain of superconducting qubits”, Science 378, 785 (2022) arXiv:2204.11372 DOI
[9]
A. Kitaev and C. Laumann, “Topological phases and quantum computation”, (2009) arXiv:0904.2771
[10]
M. Barkeshli, Y.-A. Chen, S.-J. Huang, R. Kobayashi, N. Tantivasadakarn, and G. Zhu, “Codimension-2 defects and higher symmetries in (3+1)D topological phases”, SciPost Physics 14, (2023) arXiv:2208.07367 DOI
[11]
P. Webster and S. D. Bartlett, “Fault-tolerant quantum gates with defects in topological stabilizer codes”, Physical Review A 102, (2020) arXiv:1906.01045 DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: kitaev_chain

Cite as:
“Kitaev chain code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/kitaev_chain
BibTeX:
@incollection{eczoo_kitaev_chain, title={Kitaev chain code}, booktitle={The Error Correction Zoo}, year={2023}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/kitaev_chain} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/kitaev_chain

Cite as:

“Kitaev chain code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/kitaev_chain

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/majorana/mbq/kitaev_chain.yml.