Here is a list of codes related to constant-excitation (CE) quantum codes.
| Code | Description |
|---|---|
| Chuang-Leung-Yamamoto (CLY) code | Bosonic Fock-state code that encodes \(k\) qubits into \(n\) oscillators, with each oscillator restricted to having at most \(N\) excitations. Codewords are superpositions of oscillator Fock states which have exactly \(N\) total excitations, and are either uniform (i.e., balanced) superpositions or unbalanced superpositions. |
| Constant-excitation (CE) code | Code whose codewords lie in an excited-state eigenspace of a Hamiltonian governing the total energy or total number of excitations of the underlying quantum system. For qubit codes, such a Hamiltonian is often the total spin Hamiltonian, \(H=\sum_i Z_i\). For spin-\(S\) codes, this generalizes to \(H=\sum_i J_z^{(i)}\), where \(J_z\) is the spin-\(S\) \(Z\)-operator. For bosonic codes, such as Fock-state codes, codewords are often in an eigenspace with eigenvalue \(N>0\) of the total excitation or energy Hamiltonian, \(H=\sum_i \hat{n}_i\). |
| Constant-weight code | A block code over a field or a ring whose codewords all have the same Hamming weight \(w\). The complement of a binary constant-weight code is a constant-weight code obtained by interchanging zeroes and ones in the codewords. The set of all binary codewords of length \(n\) forms the Johnson space \(J(n,w)\) [1–4]. |
| Dual-rail quantum code | Two-mode bosonic code encoding a logical qubit in Fock states with one excitation. The logical-zero state is represented by \(|10\rangle\), while the logical-one state is represented by \(|01\rangle\). This encoding is often realized in temporal or spatial modes, corresponding to a time-bin or frequency-bin encoding. Two different types of photon polarization can also be used. |
| Jump code | A CE code designed to detect and correct AD errors. An \(((n,K))\) jump code is denoted as \(((n,K,t))_w\) (which conflicts with modular-qudit notation), where \(t\) is the maximum number of qubits that can be corrected after each one has undergone a jump error \(|0\rangle\langle 1|\), and where each codeword is a uniform superposition of qubit basis states with Hamming weight \(w\). |
| One-hot quantum code | Encoding of a \(q\)-dimensional qudit into the single-excitation subspace of \(q\) modes. The \(j\)th logical state is the multi-mode Fock state with one photon in mode \(j\) and zero photons in the other modes. This code is useful for encoding and performing operations on qudits in multiple qubits [5–9]. |
| Ouyang-Chao constant-excitation PI code | A constant-excitation PI Fock-state code whose construction is based on integer partitions. |
| Quantum parity code (QPC) | A \([[m_1 m_2,1,\min(m_1,m_2)]]\) CSS code family obtained from concatenating an \(m_1\)-qubit phase-flip repetition code with an \(m_2\)-qubit bit-flip repetition code. |
| Qubit CSS code | An \([[n,k,d]]\) stabilizer code admitting a set of stabilizer generators that are either \(Z\)-type or \(X\)-type Pauli strings. Codes can be defined from two classical codes and/or chain complexes over \(\mathbb{Z}_2\) per the qubit CSS-to-homology correspondence below. Strong CSS codes are codes for which there exists a set of \(X\) and \(Z\) stabilizer generators of equal weight. |
| Qubit stabilizer code | An \(((n,2^k,d))\) qubit stabilizer code is denoted as \([[n,k]]\) or \([[n,k,d]]\), where \(d\) is the code's distance. Logical subspace is the joint eigenspace of commuting Pauli operators forming the code's stabilizer group \(\mathsf{S}\). Traditionally, the logical subspace is the joint \(+1\) eigenspace of a set of \(2^{n-k}\) commuting Pauli operators which do not contain \(-I\). The distance is the minimum weight of a Pauli string that implements a nontrivial logical operation in the code. |
| Two-mode binomial code | Two-mode constant-energy CLY code whose coefficients are square-roots of binomial coefficients. |
| Very small logical qubit (VSLQ) code | The two logical codewords are \(|\pm\rangle \propto (|0\rangle\pm|2\rangle)(|0\rangle\pm|2\rangle)\), where the total Hilbert space is the tensor product of two transmon qudits (whose ground states \(|0\rangle\) and second excited states \(|2\rangle\) are used in the codewords). Since the code is intended to protect against losses, the qutrits can equivalently be thought of as oscillator Fock-state subspaces. |
| Wasilewski-Banaszek code | Three-oscillator constant-excitation Fock-state code encoding a single logical qubit. |
References
- [1]
- Delsarte, Philippe. "An algebraic approach to the association schemes of coding theory." Philips Res. Rep. Suppl. 10 (1973): vi+-97.
- [2]
- P. Delsarte, “Association schemes and t-designs in regular semilattices”, Journal of Combinatorial Theory, Series A 20, 230 (1976) DOI
- [3]
- Ph. Delsarte, “Hahn Polynomials, Discrete Harmonics, andt-Designs”, SIAM Journal on Applied Mathematics 34, 157 (1978) DOI
- [4]
- V. I. Levenshtein, “Designs as maximum codes in polynomial metric spaces”, Acta Applicandae Mathematicae 29, 1 (1992) DOI
- [5]
- R. D. Somma, “Quantum Computation, Complexity, and Many-Body Physics”, (2005) arXiv:quant-ph/0512209
- [6]
- M. R. Geller et al., “Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method”, (2015) arXiv:1505.04990
- [7]
- S. McArdle et al., “Digital quantum simulation of molecular vibrations”, Chemical Science 10, 5725 (2019) arXiv:1811.04069 DOI
- [8]
- N. P. D. Sawaya and J. Huh, “Quantum Algorithm for Calculating Molecular Vibronic Spectra”, The Journal of Physical Chemistry Letters 10, 3586 (2019) arXiv:1812.10495 DOI
- [9]
- N. P. D. Sawaya et al., “Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians”, npj Quantum Information 6, (2020) arXiv:1909.12847 DOI