Tiger code[1]
Description
A CSS-like multi-mode bosonic non-stabilizer code that generalizes the pair-cat code and whose syndromes are linear combinations of occupation-number operators.
A tiger code is defined for a pair of integer matrices, \(G\) and \(H\), satisfying a homological constraint \(GH^{\text{T}} = 0\). Stabilizer-like operators of the code are either linear combinations of occupation-number operators defined by rows of \(H\), or products of annihilation/creation operators whose powers are defined by rows of \(G\).
The structure of the logical space is determined from the homology of the integer chain complex defined by \(G\) and \(H\). The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension.
Codewords are coherent states projected into the subspace defined by the \(H\)-induced constraint, and their corresponding normalizations are Gelfand-Kapranov-Zelevinsky hypergeometric functions [2,3]. Codewords can be finitely or infinitely supported in Fock space, depending on the \(H\)-induced constraint. When written in terms of coherent states, codewords are orbits of a set of fiducial coherent states (determined by the aforementioned homology calculation) under a group of tensor-product rotations generated by \(H\). Therefore, codewords consist of continuous but compact coherent-state constellations.
Using multi-index notation, a projected coherent state can be written in two ways, \begin{align} |\boldsymbol{\alpha}\rangle_{\boldsymbol{\Delta}}^{H}&\propto\int \textnormal{d}\boldsymbol{\phi}e^{i\boldsymbol{\phi}(H\hat{\mathbf{n}}-\boldsymbol{\Delta})}|\boldsymbol{\alpha}\rangle\tag*{(1)}\\&\propto\sum_{H\mathbf{n}=\boldsymbol{\Delta}}\frac{\boldsymbol{\alpha}^{\mathbf{n}}}{\sqrt{\mathbf{n}!}}|\mathbf{n}\rangle~, \tag*{(2)}\end{align} where \(\boldsymbol{\alpha}\) is a complex vector, \(\boldsymbol{\Delta}\) is an integer vector, and \(\boldsymbol{\phi}\) is a vector of phases iterating over the elements of the group generated by \(H\). Tiger codewords are of the above form, and their phase-space values \(\boldsymbol{\alpha}\) lie on a torus embedded in the complex sphere of fixed-energy coherent coherent states, satisfying \(|\alpha_j|^2 = 1\).
Protection
Parent
- Bosonic code — Tiger codewords are superpositions of coherent states with the same energy, but coherent states are not eigenstates of the energy Hamiltonian. The AD Kraus operator \(E_{0}^{\otimes n}\) acts identically on each coherent state by shrinking the radius of the QSC's sphere.
Children
- Pair-cat code — The pair-cat code is a tiger code with \(G = (2,2)\) and \(H = (1,-1)\) [1].
- Coherent-state repetition code — The coherent-state repetition code is a tiger code whose matrix \(G\) is a generator matrix of the repetition code (over the integers), and whose matrix \(H\) is zero [1].
- Tiger surface code — The tiger surface code is constructed from a hypergraph product of two repetition codes over the integers.
Cousins
- Fock-state bosonic code — Tiger codes encoding logical qudits are Fock-state codes.
- Coherent-state constellation code — Tiger codewords consist of continuous and compact coherent-state constellations [1].
- Quantum spherical code (QSC) — Tiger (quantum spherical) codewords consist of continuous and compact (discrete and finite) coherent-state constellations. Both codes protect against losses and gains of occupation numbers along with rotation noise stemming from modal dephasing. Protection against the latter type of noise is characterized by the minimum Euclidean distance between coherent states in different logical constellations.
- Generalized homological-product CSS code — Tiger codes are CSS-like multi-mode bosonic non-stabilizer codes constructed from chain complexes over the integers [1]. The homology group of the logical operators has a torsion component because the chain complexes are defined over the ring of integers, which yields codes with finite logical dimension.
- Homological number-phase code — Tiger codes of infinite Fock-state support can be thought of as appropriately regularized homological number-phase codes [1].
- \(\chi^{(2)}\) code — Certain chi-squared codes are supported on the same Fock states as particular tiger codes [1].
- Two-mode binomial code — The two-mode binomial code for \(S=0\) is a tiger code with \(G = (2,-2)\) and \(H = (1,1)\) [1]. It can be generalized [1] to an \(n\)-mode code encoding a qu\(n\)it in generalized \(SU(n)\) coherent states [4].
References
- [1]
- Y. Xu, Y. Wang, C. Vuillot, and V. V. Albert, “Letting the tiger out of its cage: bosonic coding without concatenation”, (2024) arXiv:2411.09668
- [2]
- I. M. Gel’fand, A. V. Zelevinskii, and M. M. Kapranov, “Hypergeometric functions and toral manifolds”, Functional Analysis and Its Applications 23, 94 (1989) DOI
- [3]
- A. Adolphson, “Hypergeometric functions and rings generated by monomials”, Duke Mathematical Journal 73, (1994) DOI
- [4]
- D. M. Gitman and A. L. Shelepin, “Coherent states of SU(N) groups”, Journal of Physics A: Mathematical and General 26, 313 (1993) DOI
Page edit log
- Victor V. Albert (2024-12-06) — most recent
Cite as:
“Tiger code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/tiger
Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/oscillators/tiger/tiger.yml.