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
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.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 7 pages, 3 figures