Binomial code[1]
Description
Bosonic rotation codes designed to approximately protect against errors consisting of powers of raising and lowering operators up to some maximum power. Binomial codes can be thought of as spin-coherent states embedded into an oscillator [2].
A simple example of a binomial code is the "0-2-4" qubit code with codewords \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{\sqrt{2}}\left(|0\rangle+|4\rangle\right)\\ |\overline{1}\rangle&=|2\rangle~, \end{split} \tag*{(1)}\end{align} constructed out of binomial states [3].
General \(q\)-dimensional qudit \((N, S)\) binomial codeword states are \(\{|\overline{i}\rangle\mid i\in \mathbb Z_q \}\), where \begin{align} |\overline{i}\rangle = \frac{1}{\sqrt{q^N}} \sum_{\substack{p=0\\p\equiv i \pmod{q}}}^{(q-1)(N+1)} \sqrt{\binom{N+1}{p}_q} \ket{p(S+1)}. \tag*{(2)}\end{align} The set \( \ket{i} \mid i \in \mathbb{N}\) is the set of Fock states. Also, \(\binom{N+1}{p}_q\) are extended binomial coefficients, or polynomial coeffiients, defined recursively as \begin{align} \binom{n}{m}_1 \equiv 1,\quad \binom{n}{m}_q \equiv \sum_{k=0}^n \binom{n}{k}\binom{k}{m-k}_{q-1}. \tag*{(3)}\end{align} The extended binomial coefficients \( \binom{n}{m}_q \) are also the coefficients of \( x^m \) in the polynomial \( (1 + x + \cdots + x^{q-1})^n \).
Protection
An \((N, S)\) binomial code protects against \(L\) boson losses, \(G\) boson gains, and dephasing up to \(\hat{n}^{D}\), where \(S=L+G\) and \(N = \mathrm{max}(L,G,2D)\). Binomial codes approximately protect against continuous-time AD, boson loss and gain, and dephasing.
Gates
Error-detecting \(CCZ\) and \(cSWAP\) gates for "0-2-4" code using three-level ancilla [4].Single logical-qubit rotations [5].
Decoding
Photon loss and dephasing errors can be detected by measuring the phase-space rotation \(\exp\left(2\pi\mathrm{i} \hat{n} / (S+1)\right)\) and the check operator \(J_x/J\) in the spin-coherent state language, where \(J\) is the total angular momentum and \(J_x\) is the angular momentum in the \(x\) direction [2]. This type of error correction fails for errors that are products of photon loss/gain and dephasing errors. However, for certain \((N,S)\) instances of the binomial code, detection of these types of errors can be done.Recovery can be done via projective measurements and unitary operations in a version of the Cafaro recovery map [1,2].Fault-tolerant scheme that converts the required POVM into binary measurements whose redundancy is guaranteed by a classical code [6].
Realizations
Microwave cavities coupled to superconducting circuits: state transfer between a binomial codeword to another system [7], error-correction protocol nearly reaching break-even [8], and a teleported CNOT gate [9]. A realization of the "0-2-4" encoding is the first to go beyond break-even error-correction and yields a logical lifetime that exceeds the cavity lifetime by \(16\%\) [10] (see also [11]). See Ref. [12] for another experiment.Motional degree of freedom of a trapped ion: binomial state preparation for \(S=2\) realized by Tan group [13].
Notes
The mean occupation number, or average Fock-state number in maximally-mixed state of the code, is \((N+1)(S+1)(q-1)/2 \), where \(q\) is the qudit dimension.
Parent
- Bosonic rotation code — One can verify by direct calculation that the logical states are eigenstates of the discrete rotation operator. One has freedom in the exact form of the primitive state to choose; see Appendix B.2 of Ref. [14].
Cousins
- Cat code — For a fixed \(S\), binomial codes with \(N \to \infty\) coincide with cat codes as \(\alpha \to \infty\) [1].
- Number-phase code — In the limit as \(N,S \to \infty\), phase measurement in the binomial code has vanishing variance, just like in a number-phase code [14].
- Two-mode binomial code
- Chebyshev code — Chebyshev codes resemble binomial codes, and a class of binomial codes have similar error-correcting properties [15].
- Asymmetric quantum code — Binomial code parameters against loss/gain errors and dephasing can be tuned.
- Four-qubit single-deletion code — The four-qubit single-deletion code can be obtained from the "0-2-4" single-mode binomial code by substituting Fock states with Dicke states.
- GNU PI code — Binomial codes and GNU codes related via the Holstein-Primakoff mapping [16] (see also [17]). A qudit generalization of GNU codes can be obtained from qudit binomial codes [2; Appx. C].
- \([[4,2,2]]\) Four-qubit code — \([[4,1,2]]\) subcode consisting of \(|\overline{00}\rangle\) and any other codeword reduces to the \(0,2,4\) binomial code when the basis labels in each codeword are written as in base-ten. Such a mapping can be generalized [18].
- Æ code — Many well-performing Æ codes can be mapped into shifted versions of binomial codes via the Holstein-Primakoff mapping.
References
- [1]
- M. H. Michael et al., “New Class of Quantum Error-Correcting Codes for a Bosonic Mode”, Physical Review X 6, (2016) arXiv:1602.00008 DOI
- [2]
- V. V. Albert et al., “Performance and structure of single-mode bosonic codes”, Physical Review A 97, (2018) arXiv:1708.05010 DOI
- [3]
- D. Stoler, B. E. A. Saleh, and M. C. Teich, “Binomial States of the Quantized Radiation Field”, Optica Acta: International Journal of Optics 32, 345 (1985) DOI
- [4]
- T. Tsunoda et al., “Error-detectable bosonic entangling gates with a noisy ancilla”, (2022) arXiv:2212.11196
- [5]
- Y. Tanaka et al., “Single-qubit rotations on a binomial code without ancillary qubits”, (2024) arXiv:2408.12968
- [6]
- Y. Ouyang, “Robust projective measurements through measuring code-inspired observables”, npj Quantum Information 10, (2024) arXiv:2402.04093 DOI
- [7]
- C. J. Axline et al., “On-demand quantum state transfer and entanglement between remote microwave cavity memories”, Nature Physics 14, 705 (2018) arXiv:1712.05832 DOI
- [8]
- L. Hu et al., “Quantum error correction and universal gate set operation on a binomial bosonic logical qubit”, Nature Physics 15, 503 (2019) arXiv:1805.09072 DOI
- [9]
- Y. Xu et al., “Demonstration of Controlled-Phase Gates between Two Error-Correctable Photonic Qubits”, Physical Review Letters 124, (2020) arXiv:1810.04690 DOI
- [10]
- Z. Ni et al., “Beating the break-even point with a discrete-variable-encoded logical qubit”, Nature 616, 56 (2023) arXiv:2211.09319 DOI
- [11]
- V. V. Sivak et al., “Real-time quantum error correction beyond break-even”, Nature 616, 50 (2023) arXiv:2211.09116 DOI
- [12]
- M. Kudra et al., “Robust Preparation of Wigner-Negative States with Optimized SNAP-Displacement Sequences”, PRX Quantum 3, (2022) arXiv:2111.07965 DOI
- [13]
- V. G. Matsos et al., “Robust and Deterministic Preparation of Bosonic Logical States in a Trapped Ion”, Physical Review Letters 133, (2024) arXiv:2310.15546 DOI
- [14]
- A. L. Grimsmo, J. Combes, and B. Q. Baragiola, “Quantum Computing with Rotation-Symmetric Bosonic Codes”, Physical Review X 10, (2020) arXiv:1901.08071 DOI
- [15]
- D. Layden et al., “Ancilla-Free Quantum Error Correction Codes for Quantum Metrology”, Physical Review Letters 122, (2019) arXiv:1811.01450 DOI
- [16]
- T. Holstein and H. Primakoff, “Field Dependence of the Intrinsic Domain Magnetization of a Ferromagnet”, Physical Review 58, 1098 (1940) DOI
- [17]
- C. D. Cushen and R. L. Hudson, “A quantum-mechanical central limit theorem”, Journal of Applied Probability 8, 454 (1971) DOI
- [18]
- Linshu Li, private communication, 2018
Page edit log
- Victor V. Albert (2022-07-03) — most recent
- Thomas Wrona (2022-05-18)
- Victor V. Albert (2021-12-30)
- Joseph T. Iosue (2021-12-19)
Cite as:
“Binomial code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/binomial