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

Force Sensing in a Recoverable Bosonic Quantum Memory

Tairong Bai, Wen Zheng, Haoyang Cai, Xianke Li, Yangyang Ge, Kun Zhou, Xiangmin Yu, Yu Zhang, Shaoxiong Li, Xinsheng Tan, Jie Zhao, Yang Yu

quant-phSubmitted Oct 29, 2026• Announced Oct 30, 2026• 0 citations
arXivHTMLPDF

Abstract

In continuous-variable quantum information, sensing and quantum error correction in the same mode face an intrinsic trade-off: sensors must accumulate weak external displacements, whereas bosonic codes typically suppress such shifts as errors. Here, we establish compatibility by constructing finite-energy bosonic codes that enable a single oscillator to sense an external force while actively protecting an unknown logical qubit. By encoding logical amplitudes across discrete wave-packet sites and capturing the force signal in a shared internal coordinate, we achieve an endpoint probe readout that is independent of the logical state under continuous photon loss $γ$. Crucially, binomial site recovery cancels packet-dependent probe distortions alongside logical errors: for a $(2r+2)$-packet code, memory infidelity is suppressed to $O(γ^{r+1})$ while residual memory-probe correlations scale as $O(γ^{r+2})$. Finally, superconducting quantum circuit benchmarks under competing photon-number dephasing and Kerr nonlinearity identify preferred encoding regimes for hardware implementation.

AI Summary

Can a single oscillator sense a displacement while preserving an unknown stored qubit? This paper constructs finite-energy bosonic codes that encode logical amplitudes in binomially weighted, spatially separated wave packets, while a shared within-packet coordinate carries the force signal. Interrogation occurs under continuous photon loss, followed by a probe-qubit readout and endpoint recovery. For a $2r+2$-packet code and loss strength $\gamma=\kappa T$, the recovered joint channel factorizes into logical dephasing and a logical-state-independent probe state, up to $O_\diamond(\gamma^{r+2})$ and exponentially small cell-crossing errors. Memory entanglement infidelity scales as $O(\gamma^{r+1})$; for four packets its leading value is $9L^4\gamma^2/64$, where $L$ is packet spacing. The derivation uses binomial moment matching and cancellations in probe-valued loss kernels. Exact-channel simulations support quadratic through quintic memory-error suppression and cubic memory–probe decorrelation for four packets. The probe coherence and QFI are obtained exactly under photon loss; higher readout harmonics trade sensitivity against phase range and visibility. Cavity-noise simulations include number dephasing and Kerr nonlinearity. Six or more packets suppress first-order number-dephasing memory errors, but larger codes can perform worse because of competing noise. At $20\,\mu\mathrm{s}$, six packets perform best without Kerr compensation and ten with endpoint Kerr reversal among the tested codes. The guarantees assume known loss rate, ideal endpoint controls, smooth compactly supported packets, and displacement within a decoding guard interval. Kerr and dephasing introduce logical-state-dependent readout. Decoder pulse compilation and ancillary faults remain unaddressed experimentally; estimated transmon-jump errors exceed the best idealized benchmark.

Little sign of AI-generated textStrong assumptionsMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
7 pages, 3 figures

Related papers

Fault-Tolerant Heisenberg-Limited Quantum Metrology with Bosonic Probes

Daniel G. Li, Lorcán O Conlon, Yu-Xin Wang +3 more

Quantum sensors have been shown to enable more precise measurements than classical sensors. By using entanglement and coherent evolution, the estimation error can be made to scale better in interrogation time, photon count, and other resources, achieving Heisenberg-limited scaling. However, environmental noise and hardware errors typically destroy the coherence of the sensitive quantum states. This motivates the use of fault-tolerant techniques to create more robust quantum sensing protocols. Such fault-tolerant quantum sensing approaches have been shown to enhance sensitivity for qubit systems, but many practical sensors require bosonic probes. In this paper, we propose a fault-tolerant protocol using bosons to estimate displacements in the presence of dephasing noise. We construct an optimal error-correcting code under a mean photon-number constraint. Controlled displacements couple the probe to a repetition-encoded qubit register, while repeated boson-parity measurements and resets remove probe noise without erasing the stored logical phase. Under circuit-level bit-flip noise, a distance-$d$ code suppresses logical failures to order $p^{(d+1)/2}$. We show that, for a decay rate $γ_A$, a total sensing time $T$ and a mean photon number budget $N$, and for sufficiently small residual signals, the Fisher information scales as $NT^2$ over interrogation times of order $γ_A^{-(d+1)/2}$. This is a significant improvement over the non-fault-tolerant approach that achieves Heisenberg scaling only for a total time $\mathcal O(γ_A^{-1})$.

quant-pharXiv:2610.40405•Oct 30, 2026•0 citations

Protecting bosonic codes from ancilla-induced errors with continuous-variable flags

Thomas Décultot, Ronan Gautier, Mazyar Mirrahimi

Bosonic quantum error correction represents a route towards significant hardware overhead reduction for fault-tolerant quantum computation. However, controlling quantum harmonic oscillators that encode the quantum information comes with its own challenges. In many platforms such as superconducting circuits and trapped ions, the bosonic degree of freedom is controlled by an ancillary qubit whose decay during a qubit-oscillator gate propagates to the oscillator as a continuous error. Such errors generally lie beyond the scope of errors that the bosonic code is capable of correcting. We introduce the continuous-variable flag: an auxiliary oscillator coupled to the ancilla whose phase-space position encodes the continuous error corrupting the storage mode. After the gate, a heterodyne measurement of the flag estimates this continuous-variable error and a subsequent feedback control undoes it up to a bosonic code stabilizer. The scheme requires no new ingredients, as the flag is driven by the same dispersive coupling, displacements and rotations that implement the gates it is supposed to protect. We construct sequences protecting conditional rotations to all orders in ancilla decay with one flag, and conditional displacements to first order with one flag and to all orders with two. Simulations with realistic circuit-QED parameters predict more than three orders of magnitude fewer logical errors for the parity measurement of a four-component cat code, and a finite-energy GKP logical lifetime near its noiseless-ancilla bound. By discretizing continuous-variable errors, the flags introduced in this work are a useful tool for any hybrid oscillator-qubit processor, and open the route towards fault-tolerant simulation and computation with bosonic modes.

quant-pharXiv:2610.07139•Oct 7, 2026•0 citations

Error semitransparent universal control of a bosonic logical qubit

Saswata Roy, Owen C. Wetherbee, Valla Fatemi

Bosonic codes offer hardware-efficient approaches to logical qubit construction and hosted the first demonstration of beyond-break even logical quantum memory. However, such accomplishments were done for idling information, and realization of fault-tolerant logical operations remains a critical bottleneck for universal quantum computation in scaled systems. Error-transparent (ET) gates offer an avenue to resolve this issue, but experimental demonstrations have been limited to phase gates. Here, we introduce a framework based on dynamic encoding subspaces that enables simple linear drives to accomplish universal gates that are error semi-transparent (EsT) to oscillator photon loss. With an EsT logical gate set of {X, H, T}, we observe a five-fold reduction in infidelity conditioned on photon loss, demonstrate extended active-manipulation lifetimes with quantum error correction, and construct a composite EsT non-Clifford operation using a sequence of eight gates from the set. Our approach is compatible with methods for detectable ancilla errors, offering an approach to error-mitigated universal control of bosonic logical qubits with the standard quantum control toolkit.

quant-pharXiv:2603.15356•Nature Communications•Mar 17, 2026•0 citations

Hardware-efficient quantum error correction via concatenated bosonic qubits

Harald Putterman, Kyungjoo Noh, Connor T. Hann +97 more

To solve problems of practical importance1,2, quantum computers probably need to incorporate quantum error correction, in which a logical qubit is redundantly encoded in many noisy physical qubits3–5. The large physical-qubit overhead associated with error correction motivates the search for more hardware-efficient approaches6–18. Here, using a superconducting quantum circuit19, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance d = 5 (ref. 10). A stabilizing circuit passively protects cat qubits against bit flips20–24. The repetition code, using ancilla transmons for syndrome measurement, corrects cat qubit phase flips. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below the threshold. The logical bit-flip error is suppressed with increasing cat qubit mean photon number, enabled by our realization of a cat-transmon noise-biased CX gate. The minimum measured logical error per cycle is on average 1.75(2)% for the distance-3 code sections, and 1.65(3)% for the distance-5 code. Despite the increased number of fault locations of the distance-5 code, the high degree of noise bias preserved during error correction enables comparable performance. These results, where the intrinsic error suppression of the bosonic encodings enables us to use a hardware-efficient outer error-correcting code, indicate that concatenated bosonic codes can be a compelling model for reaching fault-tolerant quantum computation. Bosonic qubits can be engineered to feature intrinsic protection against certain kinds of errors, which makes quantum error correction across many bosonic qubits possible with less overhead.

arXiv:2409.13025•Nature•Feb 26, 2025•155 citations

Arbitrary high-fidelity binomial codes from multiphoton spin-boson interactions

Pradip Laha, Peter van Loock

Encoding a qubit in the continuous degrees of freedom of a quantum system, such as bosonic modes, is a powerful alternative to modern quantum error correction (QEC). Among the most prominent bosonic QEC codes, binomial codes provide protection against loss and dephasing errors by encoding logical states in finite superpositions of Fock states with binomially weighted coefficients. While much attention has been given to their error-correcting capabilities and integration into fault-tolerant architectures, efficient methods for generating arbitrary binomial codewords remain scarce. In this work, we propose a scheme for generating these codewords by exploiting nonlinear multiphoton interactions between a continuous-variable bosonic mode (oscillator) and a two-level system (spin/qubit). Our proposed scheme assumes the ability to prepare the oscillator in an arbitrary Fock state and the qubit in an arbitrary superposition of its basis states and access to arbitrarily high multiphoton interactions. To enhance the experimental feasibility of our scheme, we further demonstrate how to reduce the required order parameter of multiphoton interactions by a factor of two for a special class of code states.

arXiv:2507.08585•Physical Review Research•Feb 2, 2026•2 citations

Code-agnostic bosonic noise suppression with hybrid rotations

Saurabh U. Shringarpure, Siheon Park, Sungjoo Cho +4 more

Physical-level noise on traveling bosonic modes remains a critical bottleneck for scalable quantum information processing. We show that for any single-mode bosonic code (qumode) corrupted by thermal or Gaussian displacement noise at loss rate $μ$ and amplification $G$, a hybrid continuous-discrete-variable (CV-DV) interferometer using a single qubit ancilla and two controlled-Fourier (CF) gates sandwiching the noise channel suppresses its effects from linear to quadratic scaling. This is achieved without active error correction or destructive measurements of the encoded state, maintaining high success probabilities $\geq 0.5$ when $μG \leq 0.5$. When supplemented with multiple ancillas, the protocol converts photon loss into coherent Fock-damping, and thermal or displacement noise into a mixture of Fock-diagonal noise. The protocol is entirely code-agnostic. For the special case of $2^K$-fold rotation-symmetric bosonic codes, it simplifies to conventional error detection and projection with $K$ ancillas. Suppression with simple gates and few ancillas demonstrates a clear hardware-efficient advantage over previously proposed ``bypass'' schemes, where quantum information transferred to the DV ancillas is readily corrupted by ancilla noise. Finally, we extend the protocol to a qutrit DV ancilla. This demonstrates resilience to both CV noise and composite DV damping noise, achieving a truly hybrid noise suppression scheme that operates effectively even on CV encodings lacking a well-defined photon-number parity syndrome.

quant-pharXiv:2605.24540•May 26, 2026•0 citations
In continuous-variable quantum information, sensing and quantum error correction in the same mode face an intrinsic trade-off: sensors must accumulate weak external displacements, whereas bosonic codes typically suppress such shifts as errors. Here, we establish compatibility by constructing finite-energy bosonic codes that enable a single oscillator to sense an external force while actively protecting an unknown logical qubit. By encoding logical amplitudes across discrete wave-packet sites and capturing the force signal in a shared internal coordinate, we achieve an endpoint probe readout that is independent of the logical state under continuous photon loss γγγ. Crucially, binomial site recovery cancels packet-dependent probe distortions alongside logical errors: for a (2r+2)(2r+2)(2r+2)-packet code, memory infidelity is suppressed to O(γr+1)O(γ^{r+1})O(γr+1) while residual memory-probe correlations scale as O(γr+2)O(γ^{r+2})O(γr+2). Finally, superconducting quantum circuit benchmarks under competing photon-number dephasing and Kerr nonlinearity identify preferred encoding regimes for hardware implementation.
Can a single oscillator sense a displacement while preserving an unknown stored qubit? This paper constructs finite-energy bosonic codes that encode logical amplitudes in binomially weighted, spatially separated wave packets, while a shared within-packet coordinate carries the force signal. Interrogation occurs under continuous photon loss, followed by a probe-qubit readout and endpoint recovery.
For a 2r+22r+22r+2-packet code and loss strength γ=κT\gamma=\kappa Tγ=κT, the recovered joint channel factorizes into logical dephasing and a logical-state-independent probe state, up to O⋄(γr+2)O_\diamond(\gamma^{r+2})O⋄​(γr+2) and exponentially small cell-crossing errors. Memory entanglement infidelity scales as O(γr+1)O(\gamma^{r+1})O(γr+1); for four packets its leading value is 9L4γ2/649L^4\gamma^2/649L4γ2/64, where LLL is packet spacing. The derivation uses binomial moment matching and cancellations in probe-valued loss kernels. Exact-channel simulations support quadratic through quintic memory-error suppression and cubic memory–probe decorrelation for four packets. The probe coherence and QFI are obtained exactly under photon loss; higher readout harmonics trade sensitivity against phase range and visibility.
Cavity-noise simulations include number dephasing and Kerr nonlinearity. Six or more packets suppress first-order number-dephasing memory errors, but larger codes can perform worse because of competing noise. At 20 μs20\,\mu\mathrm{s}20μs, six packets perform best without Kerr compensation and ten with endpoint Kerr reversal among the tested codes.
The guarantees assume known loss rate, ideal endpoint controls, smooth compactly supported packets, and displacement within a decoding guard interval. Kerr and dephasing introduce logical-state-dependent readout. Decoder pulse compilation and ancillary faults remain unaddressed experimentally; estimated transmon-jump errors exceed the best idealized benchmark.
Quantum sensors have been shown to enable more precise measurements than classical sensors. By using entanglement and coherent evolution, the estimation error can be made to scale better in interrogation time, photon count, and other resources, achieving Heisenberg-limited scaling. However, environmental noise and hardware errors typically destroy the coherence of the sensitive quantum states. This motivates the use of fault-tolerant techniques to create more robust quantum sensing protocols. Such fault-tolerant quantum sensing approaches have been shown to enhance sensitivity for qubit systems, but many practical sensors require bosonic probes. In this paper, we propose a fault-tolerant protocol using bosons to estimate displacements in the presence of dephasing noise. We construct an optimal error-correcting code under a mean photon-number constraint. Controlled displacements couple the probe to a repetition-encoded qubit register, while repeated boson-parity measurements and resets remove probe noise without erasing the stored logical phase. Under circuit-level bit-flip noise, a distance-ddd code suppresses logical failures to order p(d+1)/2p^{(d+1)/2}p(d+1)/2. We show that, for a decay rate γAγ_AγA​, a total sensing time TTT and a mean photon number budget NNN, and for sufficiently small residual signals, the Fisher information scales as NT2NT^2NT2 over interrogation times of order γA−(d+1)/2γ_A^{-(d+1)/2}γA−(d+1)/2​. This is a significant improvement over the non-fault-tolerant approach that achieves Heisenberg scaling only for a total time O(γA−1)\mathcal O(γ_A^{-1})O(γA−1​).
Bosonic quantum error correction represents a route towards significant hardware overhead reduction for fault-tolerant quantum computation. However, controlling quantum harmonic oscillators that encode the quantum information comes with its own challenges. In many platforms such as superconducting circuits and trapped ions, the bosonic degree of freedom is controlled by an ancillary qubit whose decay during a qubit-oscillator gate propagates to the oscillator as a continuous error. Such errors generally lie beyond the scope of errors that the bosonic code is capable of correcting. We introduce the continuous-variable flag: an auxiliary oscillator coupled to the ancilla whose phase-space position encodes the continuous error corrupting the storage mode. After the gate, a heterodyne measurement of the flag estimates this continuous-variable error and a subsequent feedback control undoes it up to a bosonic code stabilizer. The scheme requires no new ingredients, as the flag is driven by the same dispersive coupling, displacements and rotations that implement the gates it is supposed to protect. We construct sequences protecting conditional rotations to all orders in ancilla decay with one flag, and conditional displacements to first order with one flag and to all orders with two. Simulations with realistic circuit-QED parameters predict more than three orders of magnitude fewer logical errors for the parity measurement of a four-component cat code, and a finite-energy GKP logical lifetime near its noiseless-ancilla bound. By discretizing continuous-variable errors, the flags introduced in this work are a useful tool for any hybrid oscillator-qubit processor, and open the route towards fault-tolerant simulation and computation with bosonic modes.
Bosonic codes offer hardware-efficient approaches to logical qubit construction and hosted the first demonstration of beyond-break even logical quantum memory. However, such accomplishments were done for idling information, and realization of fault-tolerant logical operations remains a critical bottleneck for universal quantum computation in scaled systems. Error-transparent (ET) gates offer an avenue to resolve this issue, but experimental demonstrations have been limited to phase gates. Here, we introduce a framework based on dynamic encoding subspaces that enables simple linear drives to accomplish universal gates that are error semi-transparent (EsT) to oscillator photon loss. With an EsT logical gate set of {X, H, T}, we observe a five-fold reduction in infidelity conditioned on photon loss, demonstrate extended active-manipulation lifetimes with quantum error correction, and construct a composite EsT non-Clifford operation using a sequence of eight gates from the set. Our approach is compatible with methods for detectable ancilla errors, offering an approach to error-mitigated universal control of bosonic logical qubits with the standard quantum control toolkit.
To solve problems of practical importance1,2, quantum computers probably need to incorporate quantum error correction, in which a logical qubit is redundantly encoded in many noisy physical qubits3–5. The large physical-qubit overhead associated with error correction motivates the search for more hardware-efficient approaches6–18. Here, using a superconducting quantum circuit19, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits with an outer repetition code of distance d = 5 (ref. 10). A stabilizing circuit passively protects cat qubits against bit flips20–24. The repetition code, using ancilla transmons for syndrome measurement, corrects cat qubit phase flips. We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below the threshold. The logical bit-flip error is suppressed with increasing cat qubit mean photon number, enabled by our realization of a cat-transmon noise-biased CX gate. The minimum measured logical error per cycle is on average 1.75(2)% for the distance-3 code sections, and 1.65(3)% for the distance-5 code. Despite the increased number of fault locations of the distance-5 code, the high degree of noise bias preserved during error correction enables comparable performance. These results, where the intrinsic error suppression of the bosonic encodings enables us to use a hardware-efficient outer error-correcting code, indicate that concatenated bosonic codes can be a compelling model for reaching fault-tolerant quantum computation. Bosonic qubits can be engineered to feature intrinsic protection against certain kinds of errors, which makes quantum error correction across many bosonic qubits possible with less overhead.
Encoding a qubit in the continuous degrees of freedom of a quantum system, such as bosonic modes, is a powerful alternative to modern quantum error correction (QEC). Among the most prominent bosonic QEC codes, binomial codes provide protection against loss and dephasing errors by encoding logical states in finite superpositions of Fock states with binomially weighted coefficients. While much attention has been given to their error-correcting capabilities and integration into fault-tolerant architectures, efficient methods for generating arbitrary binomial codewords remain scarce. In this work, we propose a scheme for generating these codewords by exploiting nonlinear multiphoton interactions between a continuous-variable bosonic mode (oscillator) and a two-level system (spin/qubit). Our proposed scheme assumes the ability to prepare the oscillator in an arbitrary Fock state and the qubit in an arbitrary superposition of its basis states and access to arbitrarily high multiphoton interactions. To enhance the experimental feasibility of our scheme, we further demonstrate how to reduce the required order parameter of multiphoton interactions by a factor of two for a special class of code states.
Physical-level noise on traveling bosonic modes remains a critical bottleneck for scalable quantum information processing. We show that for any single-mode bosonic code (qumode) corrupted by thermal or Gaussian displacement noise at loss rate μμμ and amplification GGG, a hybrid continuous-discrete-variable (CV-DV) interferometer using a single qubit ancilla and two controlled-Fourier (CF) gates sandwiching the noise channel suppresses its effects from linear to quadratic scaling. This is achieved without active error correction or destructive measurements of the encoded state, maintaining high success probabilities ≥0.5\geq 0.5≥0.5 when μG≤0.5μG \leq 0.5μG≤0.5. When supplemented with multiple ancillas, the protocol converts photon loss into coherent Fock-damping, and thermal or displacement noise into a mixture of Fock-diagonal noise. The protocol is entirely code-agnostic. For the special case of 2K2^K2K-fold rotation-symmetric bosonic codes, it simplifies to conventional error detection and projection with KKK ancillas. Suppression with simple gates and few ancillas demonstrates a clear hardware-efficient advantage over previously proposed ``bypass'' schemes, where quantum information transferred to the DV ancillas is readily corrupted by ancilla noise. Finally, we extend the protocol to a qutrit DV ancilla. This demonstrates resilience to both CV noise and composite DV damping noise, achieving a truly hybrid noise suppression scheme that operates effectively even on CV encodings lacking a well-defined photon-number parity syndrome.