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:2508.12354 · Nature Communications

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

Dong-Long Hu, Weizhou Cai, Chang‐Ling Zou, Ze-Liang Xiang

Published Aug 16, 2025• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41467-025-62898-1

Related papers

Bosonic Cyclic Codes: Trading Stabilizers for Gaussian Non-Clifford Phase Gates

Owen C. Wetherbee, Yijia Xu, Victor V. Albert +2 more

Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle quantum information against loss and dephasing - particularly rotation-symmetric codes, which include the cat and binomial code families. However, rotation-symmetric codes are only naturally endowed with a single logical Pauli gate, while other logical gates require the use of non-linear operations, obstructing the utility of these codes for realizing quantum algorithms. Here, we balance error protection with controllability by introducing bosonic cyclic codes: a generalization of rotation-symmetric codes that enable the measured tradeoff of error protection properties for fault-tolerant logical phase gates. Through our general construction, we find that sacrificing the detectability of a single photon loss relative to a rotation-symmetric code can yield a number of logical phase gates commensurate with the original rotation symmetry order of the code, all achievable via passive Gaussian rotations. Giving the corresponding generalizations of cat and binomial codes - which we dub cyclic cat and Vandermonde codes, respectively - we further find that many of the desirable properties of these codes transfer to the bosonic cyclic code setting. We go on to discuss the larger $SU(2)$ symmetry and rotation gates of the codes, which yield additional stabilizers and logical Pauli gates, as well as new non-Clifford gates for the smallest `kitten' binomial code, and provide a new error detection protocol. Finally, we introduce a general paradigm for converting higher-order stabilizers to logical gates, as in our generalization of rotation-symmetric codes, and apply it to several multimode bosonic codes.

quant-pharXiv:2606.11010•Jun 10, 2026•0 citations

Quantum Computing With Rotation-Symmetric Bosonic Codes

Arne L. Grimsmo, Joshua Combes, Ben Q. Baragiola

Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class-number-phase codes-which includes the well-known cat and binomial codes, among many others. The entangling gate in our scheme is code agnostic and can be used to interface different rotation-symmetric encodings. In addition to a universal set of operations, we propose a teleportation-based error-correction scheme that allows recoveries to be tracked entirely in software. Focusing on cat and binomial codes as examples, we compute average gate fidelities for error correction under simultaneous loss and dephasing noise and show numerically that the error-correction scheme is close to optimal for error-free ancillae and ideal measurements. Finally, we present a scheme for fault-tolerant, universal quantum computing based on the concatenation of number-phase codes and Bacon-Shor subsystem codes.

•Nov 2, 2024•120 citations

The performance of random bosonic rotation codes

Saurabh Totey, Akira Kyle, Liu, Steven +3 more

Bosonic error correcting codes utilize the infinite dimensional Hilbert space of a harmonic oscillator to encode a qubit. Bosonic rotation codes are characterized by a discrete rotation symmetry in their Wigner functions and include codes such as the cat and binomial codes.We define two different notions of random bosonic rotation codes and numerically explore their performance against loss and dephasing. We find that the best random rotation codes can outperform cat and binomial codes in a certain parameter regime where loss is large and dephasing errors are small.

arXiv:2311.16089•Nov 27, 2023•0 citations

High-rate extended binomial codes for multiqubit encoding

En-Jui Chang

We introduce a class of bosonic quantum error-correcting codes, termed extended binomial codes, which generalize the structure of one-mode binomial codes by incorporating ideas from high-rate qubit stabilizer codes. These codes are constructed in close analogy to $[[n,k,d]]$ qubit codes, where the parameter $n$ corresponds to the total excitation budget rather than the number of physical qubits. Our construction achieves a significant reduction in average excitation per mode while preserving error-correcting capabilities, offering improved compatibility with hardware constraints in the strong-dispersive regime. We demonstrate that extended binomial codes not only reduce the mean excitation required for encoding but also simplify syndrome extraction and logical gate implementation, particularly the logical $\overline{X}$ operation. These advantages suggest that extended binomial codes offer a scalable and resource-efficient approach for bosonic quantum error correction.

arXiv:2501.07093•Physical Review A•Sep 9, 2025•2 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•0 citations

Trade-Offs on Number and Phase Shift Resilience in Bosonic Quantum Codes

Yingkai Ouyang, Earl T. Campbell

Quantum codes typically rely on large numbers of degrees of freedom to achieve low error rates. However each additional degree of freedom introduces a new set of error mechanisms. Hence minimizing the degrees of freedom that a quantum code utilizes is helpful. One quantum error correction solution is to encode quantum information into one or more bosonic modes. We revisit rotation-invariant bosonic codes, which are supported on Fock states that are gapped by an integer g apart, and the gap g imparts number shift resilience to these codes. Intuitively, since phase operators and number shift operators do not commute, one expects a trade-off between resilience to number-shift and rotation errors. Here, we obtain results pertaining to the non-existence of approximate quantum error correcting g-gapped single-mode bosonic codes with respect to Gaussian dephasing errors. We show that by using arbitrarily many modes, g-gapped multi-mode codes can yield good approximate quantum error correction codes for any finite magnitude of Gaussian dephasing and amplitude damping errors.

arXiv:2008.12576•IEEE Transactions on Information Theory•Aug 6, 2021•8 citations
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.
Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle quantum information against loss and dephasing - particularly rotation-symmetric codes, which include the cat and binomial code families. However, rotation-symmetric codes are only naturally endowed with a single logical Pauli gate, while other logical gates require the use of non-linear operations, obstructing the utility of these codes for realizing quantum algorithms. Here, we balance error protection with controllability by introducing bosonic cyclic codes: a generalization of rotation-symmetric codes that enable the measured tradeoff of error protection properties for fault-tolerant logical phase gates. Through our general construction, we find that sacrificing the detectability of a single photon loss relative to a rotation-symmetric code can yield a number of logical phase gates commensurate with the original rotation symmetry order of the code, all achievable via passive Gaussian rotations. Giving the corresponding generalizations of cat and binomial codes - which we dub cyclic cat and Vandermonde codes, respectively - we further find that many of the desirable properties of these codes transfer to the bosonic cyclic code setting. We go on to discuss the larger SU(2)SU(2)SU(2) symmetry and rotation gates of the codes, which yield additional stabilizers and logical Pauli gates, as well as new non-Clifford gates for the smallest `kitten' binomial code, and provide a new error detection protocol. Finally, we introduce a general paradigm for converting higher-order stabilizers to logical gates, as in our generalization of rotation-symmetric codes, and apply it to several multimode bosonic codes.
Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class-number-phase codes-which includes the well-known cat and binomial codes, among many others. The entangling gate in our scheme is code agnostic and can be used to interface different rotation-symmetric encodings. In addition to a universal set of operations, we propose a teleportation-based error-correction scheme that allows recoveries to be tracked entirely in software. Focusing on cat and binomial codes as examples, we compute average gate fidelities for error correction under simultaneous loss and dephasing noise and show numerically that the error-correction scheme is close to optimal for error-free ancillae and ideal measurements. Finally, we present a scheme for fault-tolerant, universal quantum computing based on the concatenation of number-phase codes and Bacon-Shor subsystem codes.
Bosonic error correcting codes utilize the infinite dimensional Hilbert space of a harmonic oscillator to encode a qubit. Bosonic rotation codes are characterized by a discrete rotation symmetry in their Wigner functions and include codes such as the cat and binomial codes.We define two different notions of random bosonic rotation codes and numerically explore their performance against loss and dephasing. We find that the best random rotation codes can outperform cat and binomial codes in a certain parameter regime where loss is large and dephasing errors are small.
We introduce a class of bosonic quantum error-correcting codes, termed extended binomial codes, which generalize the structure of one-mode binomial codes by incorporating ideas from high-rate qubit stabilizer codes. These codes are constructed in close analogy to [[n,k,d]][[n,k,d]][[n,k,d]] qubit codes, where the parameter nnn corresponds to the total excitation budget rather than the number of physical qubits. Our construction achieves a significant reduction in average excitation per mode while preserving error-correcting capabilities, offering improved compatibility with hardware constraints in the strong-dispersive regime. We demonstrate that extended binomial codes not only reduce the mean excitation required for encoding but also simplify syndrome extraction and logical gate implementation, particularly the logical X‾\overline{X}X operation. These advantages suggest that extended binomial codes offer a scalable and resource-efficient approach for bosonic quantum error correction.
(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.
Quantum codes typically rely on large numbers of degrees of freedom to achieve low error rates. However each additional degree of freedom introduces a new set of error mechanisms. Hence minimizing the degrees of freedom that a quantum code utilizes is helpful. One quantum error correction solution is to encode quantum information into one or more bosonic modes. We revisit rotation-invariant bosonic codes, which are supported on Fock states that are gapped by an integer g apart, and the gap g imparts number shift resilience to these codes. Intuitively, since phase operators and number shift operators do not commute, one expects a trade-off between resilience to number-shift and rotation errors. Here, we obtain results pertaining to the non-existence of approximate quantum error correcting g-gapped single-mode bosonic codes with respect to Gaussian dephasing errors. We show that by using arbitrarily many modes, g-gapped multi-mode codes can yield good approximate quantum error correction codes for any finite magnitude of Gaussian dephasing and amplitude damping errors.