Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1602.00008 · Physical Review X

New Class of Quantum Error-Correcting Codes for a Bosonic Mode

Marios H. Michael, Matti Silveri, Richard Brierley, Victor V. Albert, Juha Salmilehto, Liang Jiang, S. M. Girvin

Published Jul 14, 2016• 430 citations
arXivHTMLPDF

Abstract

Optimal quantum error-correction codes are necessary to extend the lifetime of quantum memories. A new error-correction code to rectify photon loss, gain, and dephasing errors in electromagnetic cavities is presented.
DOI
10.1103/physrevx.6.031006

Related papers

Bosonic error correction codes based on states generated via particle-number-resolving measurements

S. B. Korolev, T. Yu. Golubeva

We introduce bosonic error correction codes for particle loss and dephasing errors, constructed from states generated by particle number measurements on two-mode Gaussian states. We analyze these states for their suitability in correcting such errors and identify the features most conducive to error mitigation.

arXiv:2509.16993•Physical Review A•Jan 28, 2026•1 citation

Hardware-efficient bosonic quantum error-correcting codes based on symmetry operators

Murphy Yuezhen Niu, Isaac L. Chuang, Jeffrey H. Shapiro

A family of bosonic quantum error-correcting codes is introduced to boost the reliability of quantum computation schemes against photon loss. These codes, which are based on symmetry properties of three-wave-mixing interactions, are hardware efficient for architectures involving microwave photons stored in superconducting resonators.

arXiv:1709.05302•Physical Review A•Mar 27, 2018•36 citations

Numerically optimized quantum error-correcting codes for a bosonic mode

Matti Silveri, Kari Mäkinen

APS•Jan 1, 2019•0 citations

BARC codes: general polynomial framework for coherent-state superposition codes

Praneel Gore, Davit Aghamalyan, Varun Narasimhachar +1 more

We introduce an algebraic framework for constructing a new class of quantum error-correcting codes, bosonic algebraically-restricted constellation (BARC) codes. The code states are finite superpositions of coherent-state constellations constrained by symmetries of solution sets to multivariate complex polynomial systems. The constraints are associated with photon-gain and photon-loss errors, thereby imposing approximate Knill--Laflamme conditions for such errors. For equally-weighted constellation points, we derive upper bounds on the minimum geometric separation between points, indicating how noise-resilient the code is. In the single-mode case, we characterize degree-two polynomial solution sets using an orthogonal group symmetry to obtain explicit ellipsoidal and hexagonal BARC codes. We benchmark representative instances of these families against spherical and cubature codes using the entanglement fidelity with optimal recovery under pure-loss noise.

quant-pharXiv:2610.03663•Oct 5, 2026•0 citations

Perfect coding for dephased quantum state transfer

Alastair Kay

We develop a family of perfect quantum error correcting codes that correct for phase errors that arise on any qubit, at any time, during a perfect state transfer experiment. These ensure that we find the optimal operating regime for corrected state transfer. For a specific class of system, we further show that while dephasing noise can be corrected depolarizing noise cannot.

arXiv:1711.02314•Physical Review A•Mar 15, 2018•8 citations

Bosonic quantum codes for amplitude damping

Isaac L. Chuang, Debbie Leung, Y. Yamamoto

Traditional quantum error correction involves the redundant encoding of $k$ quantum bits using $n$ quantum bits to allow the detection and correction of any $t$ bit error. The smallest general $t=1$ code requires $n=5$ for $k=1$. However, the dominant error process in a physical system is often well known, thus inviting the following question: Given a specific error model, can more efficient codes be devised? We demonstrate alternative codes that correct just amplitude damping errors that allow, for example, a $t=1$, $k=1$ code using effectively $n=4.6$. Our scheme is based on using bosonic states of photons in a finite number of optical modes. We present necessary and sufficient conditions for the codes and describe construction algorithms, physical implementation, and performance bounds.

arXiv:quant-ph/9610043•Physical Review A•Aug 1, 1997•214 citations
We introduce an algebraic framework for constructing a new class of quantum error-correcting codes, bosonic algebraically-restricted constellation (BARC) codes. The code states are finite superpositions of coherent-state constellations constrained by symmetries of solution sets to multivariate complex polynomial systems. The constraints are associated with photon-gain and photon-loss errors, thereby imposing approximate Knill--Laflamme conditions for such errors. For equally-weighted constellation points, we derive upper bounds on the minimum geometric separation between points, indicating how noise-resilient the code is. In the single-mode case, we characterize degree-two polynomial solution sets using an orthogonal group symmetry to obtain explicit ellipsoidal and hexagonal BARC codes. We benchmark representative instances of these families against spherical and cubature codes using the entanglement fidelity with optimal recovery under pure-loss noise.
Traditional quantum error correction involves the redundant encoding of kkk quantum bits using nnn quantum bits to allow the detection and correction of any ttt bit error. The smallest general t=1t=1t=1 code requires n=5n=5n=5 for k=1k=1k=1. However, the dominant error process in a physical system is often well known, thus inviting the following question: Given a specific error model, can more efficient codes be devised? We demonstrate alternative codes that correct just amplitude damping errors that allow, for example, a t=1t=1t=1, k=1k=1k=1 code using effectively n=4.6n=4.6n=4.6. Our scheme is based on using bosonic states of photons in a finite number of optical modes. We present necessary and sufficient conditions for the codes and describe construction algorithms, physical implementation, and performance bounds.