New class of quantum error-correcting codes for a bosonic mode
Marios H. Michael, Matti Silveri, R. T. Brierley, Victor V. Albert,, Juha Salmilehto, Liang Jiang, S. M. Girvin

TL;DR
This paper introduces binomial quantum codes, a new class of error-correcting codes for bosonic modes, capable of correcting multiple error types and suitable for quantum memories, communication, and scalable quantum computing.
Contribution
The paper presents the design and analysis of binomial quantum codes that can exactly or approximately correct a wide range of bosonic errors using a single mode, with explicit recovery operations.
Findings
Codes can correct polynomial errors up to a certain degree.
They enable approximate correction for continuous dissipative evolution.
They are compatible with current superconducting circuit technology.
Abstract
We construct a new class of quantum error-correcting codes for a bosonic mode which are advantageous for applications in quantum memories, communication, and scalable computation. These 'binomial quantum codes' are formed from a finite superposition of Fock states weighted with binomial coefficients. The binomial codes can exactly correct errors that are polynomial up to a specific degree in bosonic creation and annihilation operators, including amplitude damping and displacement noise as well as boson addition and dephasing errors. For realistic continuous-time dissipative evolution, the codes can perform approximate quantum error correction to any given order in the timestep between error detection measurements. We present an explicit approximate quantum error recovery operation based on projective measurements and unitary operations. The binomial codes are tailored for detecting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
