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:2511.23316

Quantum Cubature Codes

Yaoling Yang, Andrew Tanggara, Tobias Haug, Kishor Bharti

quant-phSubmitted Nov 28, 2025• Announced Dec 1, 2025• 1 citation
arXivHTMLPDF

Abstract

Bosonic codes utilize the infinite-dimensional Hilbert space of harmonic oscillators to encode quantum information, offering a hardware-efficient approach to quantum error correction. Designing these codes requires precise geometric arrangements of quantum states in the phase space. Here, we introduce Quantum Cubature Codes (QCCs), a powerful and generalized framework for constructing bosonic codes based on superpositions of coherent states. This formalism utilizes cubature formulas from multivariate approximation theory, which connect the continuous geometry of the phase space to discrete, weighted point sets, ensuring the conditions for error correction are met. We demonstrate that this framework provides a unifying perspective, revealing that well-established codes, such as cat codes and the recently proposed quantum spherical codes (QSCs), are specific instances of QCCs corresponding to uniform weights on a single energy shell. The QCC formalism unlocks a vast new design space, encompassing non-uniform superpositions and multi-shell configurations. We leverage this framework to discover several new families of codes derived from Euclidean designs, allowing for greater geometric separation between logical states, which correlates with improved performance under photon loss. Numerical simulations under a pure-loss channel show that our multi-shell QCCs can outperform their single-shell counterparts by maximizing geometric separation with optimal energy at fixed pure-loss rate.

Comments
9 pages, 2 figures; comments are welcome!

Related papers

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

Generalized Kerr-Cat Qubit Codes

Alonso Viladomat, Shahram Dehdashti, Amin Kargarian +2 more

We present a systematic study of Schrödinger cat codes constructed from Kerr-type coherent states, including displaced Kerr coherent states and Barut--Girardello Kerr coherent states, each admitting two distinct families determined by the sign of the Kerr nonlinearity. By tuning the Kerr parameter and coherent-state amplitude, these states interpolate between $\mathfrak{su}(2)$, $\mathfrak{su}(1,1)$ coherent states, providing a unified and versatile foundation for this type of bosonic quantum error correction. Unlike standard two-component Schrödinger cat codes, where a single photon-loss event induces an uncorrectable bit-flip, the nonlinear phase-space structure of Kerr cat states enables simultaneous detection and correction of both photon-loss and dephasing errors within a unified recovery framework, with optimal recovery operations determined via convex optimization. We demonstrate that Kerr cat encodings significantly outperform conventional cat codes under combined loss and dephasing noise, and that judicious parameter optimization can suppress both error channels to a level that reduces the overhead of additional error correction layers. We further show that Kerr-deformed coherent-state manifolds under engineered two-photon driving emerge as effective steady states of driven-dissipative dynamics, with single-photon decoherence strongly suppressed and leakage outside the protected manifold appearing only as higher-order corrections in the deformation strength. Our extended formalism identifies generalized Kerr Schrödinger cat codes as promising candidates for fault-tolerant bosonic quantum computation in experimental platforms such as nonlinear photonics.

quant-pharXiv:2606.14901•Jun 16, 2026•0 citations

Quantum Error Correction with Superpositions of Squeezed Fock States

Ye‐Xiong Zeng, Fernando Quijandría, Clemens Gneiting +1 more

Bosonic codes, leveraging infinite-dimensional Hilbert spaces for redundancy, offer great potential for encoding quantum information. However, a practical continuous-variable bosonic code that can simultaneously correct both photon loss and dephasing errors, while achieving a high level of compliance with the Knill-Laflamme conditions within an experimentally friendly structure, remains elusive. Here, we propose a code based on the superposition of squeezed Fock states with an error-correcting capability that scales as ∝exp(-7r), where r is the squeezing level. The codewords remain orthogonal at all squeezing levels. In particular, this code achieves high-precision error correction for both single-photon loss and dephasing, even at moderate squeezing levels. Building on this code, we develop quantum error correction schemes that exceed the breakeven point, supported by analytical derivations of all necessary quantum gates. Our code offers a competitive alternative to previous encodings for quantum computation using continuous bosonic qubits.

arXiv:2510.04209•Physical Review Letters•Apr 20, 2026•6 citations

Squeezed-vacuum bosonic codes

Nir Gutman, Eliya Blumenthal, Shay Hacohen-Gourgy +2 more

We introduce a family of bosonic quantum error-correcting codes built as a rotation-symmetric superposition of squeezed vacuum states, which promise protection against both loss and dephasing noise channels. The robustness of these "squeezed-vacuum codes" arises from being arranged at evenly spaced angles in phase-space, and simultaneously in evenly spaced photon-number support $n \equiv {2k} \! \pmod {2m}$. We present simple preparation circuits: a two-legged code using a Hadamard-conditional-squeezing-Hadamard sequence on an ancilla qubit, and for general "$m$-legged" codewords using sequences of conditional rotations. The performance of these codes is evaluated against loss and dephasing noises using the Knill-Laflamme violation function and benchmarked against cat codes. As the number $m$ of squeezed-vacuum states in a code increases, the code exhibits improved loss tolerance at the cost of higher dephasing sensitivity. We outline implementations in circuit QED and trapped-ion platforms, where high-fidelity Gaussian operations and conditional controls are available or under active development. These results help establish squeezed-vacuum codes as practical, hardware-ready, members of the bosonic codes class.

quant-pharXiv:2511.06108•Advanced Physics Research•Nov 11, 2025•3 citations

Generalized number-phase lattice encoding of a bosonic mode for quantum error correction

Dong-Long Hu, Weizhou Cai, Chang‐Ling Zou +1 more

Bosonic systems offer unique advantages for quantum error correction, as a single bosonic mode provides a large Hilbert space to redundantly encode quantum information. However, previous studies have been limited to exploiting symmetries in the quadrature phase space. Here we introduce a unified framework for encoding a qubit utilizing the symmetries in the phase space of number and phase variables of a bosonic mode. The logical codewords form lattice structures in the number-phase space, resulting in rectangular, oblique, and diamond-shaped lattice codes. Notably, oblique and diamond codes exhibit a number-phase vortex effect, where number-shift errors induce discrete phase rotations as syndromes, enabling efficient correction via phase measurements. These codes show significant performance advantages over conventional quadrature codes against dephasing noise in the potential one-way quantum communication applications. Our generalized number-phase codes open up new possibilities for fault-tolerant quantum computation and extending the quantum communication range with bosonic systems. Current bosonic quantum error correction codes exploit displacement or rotational symmetries in the quadrature phase space. Here, the authors generalise the concept by looking at potential symmetries and encoding in a broader number-phase space, where the known cat and binomial codes would correspond to rectangular lattices and be completed by other lattice codes like oblique and diamond.

arXiv:2508.12354•Nature Communications•Aug 16, 2025•6 citations

Bosonic quantum computing with near-term devices and beyond

Timo Hillmann

(Abridged.) This thesis investigates scalable fault-tolerant quantum computation through the development of bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction. We investigate superconducting microwave implementations of continuous-variable quantum computing, including the deterministic generation of cubic phase states, and introduce the dissipatively stabilized squeezed cat qubit, a noise-biased bosonic encoding with enhanced error suppression and faster gates. The performance of rotation-symmetric and GKP codes is analyzed under realistic noise and measurement models, revealing key trade-offs in measurement-based schemes. To integrate bosonic codes into larger architectures, we develop decoding methods that exploit analog syndrome information, enabling quasi-single-shot decoding in concatenated systems. On the discrete-variable side, we introduce localized statistics decoding, a highly parallelizable decoder for quantum LDPC codes, and propose quantum radial codes, a new family of single-shot LDPC codes with low overhead and strong circuit-level performance. Finally, we present fault complexes, a homological framework for analyzing faults in dynamic quantum error correction protocols. Extending the role of homology in static CSS codes, fault complexes provide a general language for the design and analysis of fault-tolerant schemes.

quant-pharXiv:2512.15063•Dec 18, 2025•1 citation
Bosonic codes utilize the infinite-dimensional Hilbert space of harmonic oscillators to encode quantum information, offering a hardware-efficient approach to quantum error correction. Designing these codes requires precise geometric arrangements of quantum states in the phase space. Here, we introduce Quantum Cubature Codes (QCCs), a powerful and generalized framework for constructing bosonic codes based on superpositions of coherent states. This formalism utilizes cubature formulas from multivariate approximation theory, which connect the continuous geometry of the phase space to discrete, weighted point sets, ensuring the conditions for error correction are met. We demonstrate that this framework provides a unifying perspective, revealing that well-established codes, such as cat codes and the recently proposed quantum spherical codes (QSCs), are specific instances of QCCs corresponding to uniform weights on a single energy shell. The QCC formalism unlocks a vast new design space, encompassing non-uniform superpositions and multi-shell configurations. We leverage this framework to discover several new families of codes derived from Euclidean designs, allowing for greater geometric separation between logical states, which correlates with improved performance under photon loss. Numerical simulations under a pure-loss channel show that our multi-shell QCCs can outperform their single-shell counterparts by maximizing geometric separation with optimal energy at fixed pure-loss rate.
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.
We present a systematic study of Schrödinger cat codes constructed from Kerr-type coherent states, including displaced Kerr coherent states and Barut--Girardello Kerr coherent states, each admitting two distinct families determined by the sign of the Kerr nonlinearity. By tuning the Kerr parameter and coherent-state amplitude, these states interpolate between su(2)\mathfrak{su}(2)su(2), su(1,1)\mathfrak{su}(1,1)su(1,1) coherent states, providing a unified and versatile foundation for this type of bosonic quantum error correction. Unlike standard two-component Schrödinger cat codes, where a single photon-loss event induces an uncorrectable bit-flip, the nonlinear phase-space structure of Kerr cat states enables simultaneous detection and correction of both photon-loss and dephasing errors within a unified recovery framework, with optimal recovery operations determined via convex optimization. We demonstrate that Kerr cat encodings significantly outperform conventional cat codes under combined loss and dephasing noise, and that judicious parameter optimization can suppress both error channels to a level that reduces the overhead of additional error correction layers. We further show that Kerr-deformed coherent-state manifolds under engineered two-photon driving emerge as effective steady states of driven-dissipative dynamics, with single-photon decoherence strongly suppressed and leakage outside the protected manifold appearing only as higher-order corrections in the deformation strength. Our extended formalism identifies generalized Kerr Schrödinger cat codes as promising candidates for fault-tolerant bosonic quantum computation in experimental platforms such as nonlinear photonics.
Bosonic codes, leveraging infinite-dimensional Hilbert spaces for redundancy, offer great potential for encoding quantum information. However, a practical continuous-variable bosonic code that can simultaneously correct both photon loss and dephasing errors, while achieving a high level of compliance with the Knill-Laflamme conditions within an experimentally friendly structure, remains elusive. Here, we propose a code based on the superposition of squeezed Fock states with an error-correcting capability that scales as ∝exp(-7r), where r is the squeezing level. The codewords remain orthogonal at all squeezing levels. In particular, this code achieves high-precision error correction for both single-photon loss and dephasing, even at moderate squeezing levels. Building on this code, we develop quantum error correction schemes that exceed the breakeven point, supported by analytical derivations of all necessary quantum gates. Our code offers a competitive alternative to previous encodings for quantum computation using continuous bosonic qubits.
We introduce a family of bosonic quantum error-correcting codes built as a rotation-symmetric superposition of squeezed vacuum states, which promise protection against both loss and dephasing noise channels. The robustness of these "squeezed-vacuum codes" arises from being arranged at evenly spaced angles in phase-space, and simultaneously in evenly spaced photon-number support n≡2k ⁣(mod2m)n \equiv {2k} \! \pmod {2m}n≡2k(mod2m). We present simple preparation circuits: a two-legged code using a Hadamard-conditional-squeezing-Hadamard sequence on an ancilla qubit, and for general "mmm-legged" codewords using sequences of conditional rotations. The performance of these codes is evaluated against loss and dephasing noises using the Knill-Laflamme violation function and benchmarked against cat codes. As the number mmm of squeezed-vacuum states in a code increases, the code exhibits improved loss tolerance at the cost of higher dephasing sensitivity. We outline implementations in circuit QED and trapped-ion platforms, where high-fidelity Gaussian operations and conditional controls are available or under active development. These results help establish squeezed-vacuum codes as practical, hardware-ready, members of the bosonic codes class.
Bosonic systems offer unique advantages for quantum error correction, as a single bosonic mode provides a large Hilbert space to redundantly encode quantum information. However, previous studies have been limited to exploiting symmetries in the quadrature phase space. Here we introduce a unified framework for encoding a qubit utilizing the symmetries in the phase space of number and phase variables of a bosonic mode. The logical codewords form lattice structures in the number-phase space, resulting in rectangular, oblique, and diamond-shaped lattice codes. Notably, oblique and diamond codes exhibit a number-phase vortex effect, where number-shift errors induce discrete phase rotations as syndromes, enabling efficient correction via phase measurements. These codes show significant performance advantages over conventional quadrature codes against dephasing noise in the potential one-way quantum communication applications. Our generalized number-phase codes open up new possibilities for fault-tolerant quantum computation and extending the quantum communication range with bosonic systems. Current bosonic quantum error correction codes exploit displacement or rotational symmetries in the quadrature phase space. Here, the authors generalise the concept by looking at potential symmetries and encoding in a broader number-phase space, where the known cat and binomial codes would correspond to rectangular lattices and be completed by other lattice codes like oblique and diamond.
(Abridged.) This thesis investigates scalable fault-tolerant quantum computation through the development of bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction. We investigate superconducting microwave implementations of continuous-variable quantum computing, including the deterministic generation of cubic phase states, and introduce the dissipatively stabilized squeezed cat qubit, a noise-biased bosonic encoding with enhanced error suppression and faster gates. The performance of rotation-symmetric and GKP codes is analyzed under realistic noise and measurement models, revealing key trade-offs in measurement-based schemes. To integrate bosonic codes into larger architectures, we develop decoding methods that exploit analog syndrome information, enabling quasi-single-shot decoding in concatenated systems. On the discrete-variable side, we introduce localized statistics decoding, a highly parallelizable decoder for quantum LDPC codes, and propose quantum radial codes, a new family of single-shot LDPC codes with low overhead and strong circuit-level performance. Finally, we present fault complexes, a homological framework for analyzing faults in dynamic quantum error correction protocols. Extending the role of homology in static CSS codes, fault complexes provide a general language for the design and analysis of fault-tolerant schemes.