Chebyshev code [1]
Description
Single-mode bosonic Fock-state code that can be used for error-corrected sensing of a signal Hamiltonian \({\hat n}^s\), where \({\hat n}\) is the occupation number operator.
Codewords for the \(s\)th-order Chebyshev code are \begin{align}
Protection
The \(s\)th-order code corrects errors from the set \(\{I,a,a^{\dagger},{\hat n},{\hat n}^2,\cdots,{\hat n}^{s-1}\}\).Cousin
- Binomial code— Chebyshev codes resemble binomial codes, and a class of binomial codes have similar error-correcting properties [1].
Member of code lists
Primary Hierarchy
References
- [1]
D. Layden, S. Zhou, P. Cappellaro, and L. Jiang, “Ancilla-Free Quantum Error Correction Codes for Quantum Metrology”, Physical Review Letters 122, (2019) arXiv:1811.01450 DOI
Page edit log
- Victor V. Albert (2026-06-08) — most recent
- Victor V. Albert (2022-07-27)
Cite as:
“Chebyshev code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/chebyshev, arXiv:2606.11484