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

Particle-loss error correction using $2^l$-step states generated via particle-number-resolving measurement schemes

S. B. Korolev, E. A. Nesterova

Published Nov 4, 2026• 0 citations
arXivHTMLPDF

Abstract

We present an iterative scheme for generating finite superpositions of Fock states whose photon numbers differ by $2^l$ ($2^l$-step states). We derive an upper bound on the probability of generating such states. Based on the proposed class of states, we construct several bosonic encodings and compare their performance in correcting particle-loss errors. Our results identify the most efficient encoding, which achieves a higher channel fidelity than previously studied bosonic encodings.

DOI
10.48550/arxiv.2611.07101

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•4 citations

Generation of multicomponent Schrödinger cat states in schemes with measurement of Gaussian states

E. A. Nesterova, S. B. Korolev

In this work, we propose a scheme for generating superpositions of Fock states whose numbers differ by four or eight. The proposed protocol is based on photon-number-resolving measurements on multimode Gaussian states. We compare of the generated states with multicomponent Schrödinger cat states. We evaluate the fidelity and determine how it scales with the number of detected particles. Furthermore, we derive the optimal configuration for the generation such states.

quant-pharXiv:2609.00343•Sep 2, 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

Optimal two-mode bosonic loss codes from finite group symmetry

Argyris Giannisis Manes, Mahadevan Subramanian, Liang Jiang

Photon loss is a dominant noise process in bosonic quantum hardware, including superconducting cavities. Fixed-total-photon-number qubit encodings in two bosonic modes retain the loss-detection advantage of dual-rail qubits while supporting photon loss correction. Optimizing entanglement fidelity in this setting for $4\leq n\leq25$ over arbitrary encoders and decoders reveals finite-group structure in every best-found code: 11 correspond to two-dimensional irreducible representations and 11 to reducible ones. Motivated by this emergence, we derive the necessary-and-sufficient Knill-Laflamme conditions for arbitrary finite-group-invariant codes, reducing their construction to equations on representation multiplicity spaces. For every finite subgroup of $SU(2)$ and every tensor rank, we explicitly construct the minimum number of operators required to impose all corresponding loss-correction constraints. These results produce analytic counterparts to most numerical codes and predict constructions missed by the initial search. Exact MacWilliams-Farkas certificates show that our codes achieve the maximum possible loss distance in 21 of the 22 sectors, and we prove that the resulting distance bound is monotone in total photon number. Beyond the scan, we identify a binary-polyhedral sequence with photon number $n_d=\lceil(3d^2+1)/4\rceil$ and construct each corresponding code through distance $d=10$. To our knowledge, the constructed $(n,d)=(28,6),(49,8),(76,10)$ codes give the smallest reported $n$ for their respective distances; all members through $d=9$ attain the fixed-$n$ LP distance bound. Together, these constructions, certificates, and a symmetry-reduced constraint count provide evidence for an infinite code family conjectured to attain every distance at the minimum photon number.

quant-pharXiv:2610.00561•Oct 2, 2026•1 citation

Bosonic Loss Codes with Bounded Occupation

Avraham Kreindel, Aryeh Lev Zabokritskiy

We study Fock-state codes on $q$ bosonic modes, with total excitation $N$ and at most $B$ excitations per mode, that exactly correct every pattern of at most $δN$ photon losses, for $q$ proportional to $N$. For every fixed cap $B$ and every ratio $q/N>1/B$, we prove explicit achievable rates, positive for all sufficiently small $δ>0$, in logical qubits per excitation. At $B=2$ and $q=N$, the rate is positive for every $δ<0.1355$ and is about $0.281$ at $δ=0.1$, compared with the previously established exact-code qutrit rate of about $0.275$. We also give an explicit upper bound on the dimension of every such exact code, including degenerate codes. For the pure-loss channel truncated to at most $δN$ losses and renormalized, we obtain approximate codes with exponentially small worst-case error. When the loss probability is positive and at most $1/(B+1)$, they improve our positive exact-code rate bounds; at $B=2$, $q=N$, and loss probability $0.1$, they remain positive up to $δ\approx0.158$.

quant-pharXiv:2610.34411•Oct 27, 2026•0 citations

Bosonic quantum error correction using squeezed Fock states

E. N. Bashmakova, S. B. Korolev, T. Yu. Golubeva

In the paper, we develop a bosonic quantum error correction code based on squeezed Fock states. We compare our proposed code with one based on squeezed Schrodinger's cat states using the Knill-Laflamme cost function and the Petz map fidelity. We demonstrate that squeezed Fock states are competitive in protecting information in a channel with particle loss and dephasing.

arXiv:2506.00300•Physical Review A•Sep 5, 2025•8 citations
Particle-loss error correction using 2l2^l2l-step states generated via particle-number-resolving measurement schemes
We present an iterative scheme for generating finite superpositions of Fock states whose photon numbers differ by 2l2^l2l (2l2^l2l-step states). We derive an upper bound on the probability of generating such states. Based on the proposed class of states, we construct several bosonic encodings and compare their performance in correcting particle-loss errors. Our results identify the most efficient encoding, which achieves a higher channel fidelity than previously studied bosonic encodings.
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.
Photon loss is a dominant noise process in bosonic quantum hardware, including superconducting cavities. Fixed-total-photon-number qubit encodings in two bosonic modes retain the loss-detection advantage of dual-rail qubits while supporting photon loss correction. Optimizing entanglement fidelity in this setting for 4≤n≤254\leq n\leq254≤n≤25 over arbitrary encoders and decoders reveals finite-group structure in every best-found code: 11 correspond to two-dimensional irreducible representations and 11 to reducible ones. Motivated by this emergence, we derive the necessary-and-sufficient Knill-Laflamme conditions for arbitrary finite-group-invariant codes, reducing their construction to equations on representation multiplicity spaces. For every finite subgroup of SU(2)SU(2)SU(2) and every tensor rank, we explicitly construct the minimum number of operators required to impose all corresponding loss-correction constraints. These results produce analytic counterparts to most numerical codes and predict constructions missed by the initial search. Exact MacWilliams-Farkas certificates show that our codes achieve the maximum possible loss distance in 21 of the 22 sectors, and we prove that the resulting distance bound is monotone in total photon number. Beyond the scan, we identify a binary-polyhedral sequence with photon number nd=⌈(3d2+1)/4⌉n_d=\lceil(3d^2+1)/4\rceilnd​=⌈(3d2+1)/4⌉ and construct each corresponding code through distance d=10d=10d=10. To our knowledge, the constructed (n,d)=(28,6),(49,8),(76,10)(n,d)=(28,6),(49,8),(76,10)(n,d)=(28,6),(49,8),(76,10) codes give the smallest reported nnn for their respective distances; all members through d=9d=9d=9 attain the fixed-nnn LP distance bound. Together, these constructions, certificates, and a symmetry-reduced constraint count provide evidence for an infinite code family conjectured to attain every distance at the minimum photon number.
We study Fock-state codes on qqq bosonic modes, with total excitation NNN and at most BBB excitations per mode, that exactly correct every pattern of at most δNδNδN photon losses, for qqq proportional to NNN. For every fixed cap BBB and every ratio q/N>1/Bq/N>1/Bq/N>1/B, we prove explicit achievable rates, positive for all sufficiently small δ>0δ>0δ>0, in logical qubits per excitation. At B=2B=2B=2 and q=Nq=Nq=N, the rate is positive for every δ<0.1355δ<0.1355δ<0.1355 and is about 0.2810.2810.281 at δ=0.1δ=0.1δ=0.1, compared with the previously established exact-code qutrit rate of about 0.2750.2750.275. We also give an explicit upper bound on the dimension of every such exact code, including degenerate codes. For the pure-loss channel truncated to at most δNδNδN losses and renormalized, we obtain approximate codes with exponentially small worst-case error. When the loss probability is positive and at most 1/(B+1)1/(B+1)1/(B+1), they improve our positive exact-code rate bounds; at B=2B=2B=2, q=Nq=Nq=N, and loss probability 0.10.10.1, they remain positive up to δ≈0.158δ\approx0.158δ≈0.158.