Quantum Error Correction with Superpositions of Squeezed Fock States

• URL: http://arxiv.org/abs/2510.04209v1
• Date: Sun, 05 Oct 2025 13:52:08 GMT
• Title: Quantum Error Correction with Superpositions of Squeezed Fock States
• Authors: Yexiong Zeng, Fernando Quijandría, Clemens Gneiting, Franco Nori,
• Abstract summary: We propose a code based on the superposition of squeezed Fock states with an error-correcting capability that scales as $proptoexp(-7r)$.<n>This code achieves high-precision error correction for both single-photon loss and dephasing, even at moderate squeezing levels.
• Score: 36.94429692322632
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bosonic codes, leveraging infinite-dimensional Hilbert spaces for redundancy, offer great potential for encoding quantum information. However, the realization of a practical continuous-variable bosonic code that can simultaneously correct both single-photon loss and dephasing errors remains elusive, primarily due to the absence of exactly orthogonal codewords and the lack of an experiment-friendly state preparation scheme. Here, we propose a code based on the superposition of squeezed Fock states with an error-correcting capability that scales as $\propto\exp(-7r)$, where $r$ is the squeezing level. The codewords remain orthogonal at all squeezing levels. The Pauli-X operator acts as a rotation in phase space is an error-transparent gate, preventing correctable errors from propagating outside the code space during logical operations. 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 break-even threshold, 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.

Related papers

• A Mathematical Structure for Amplitude-Mixing Error-Transparent Gates for Binomial Codes [0.562479170374811]
  Error-transparent operations are one way to preserve error rates during operations.<n>Only phase gates have so far been given an explicitly error-transparent formulation for binomial encodings.<n>We show that error-transparency to all the correctable photon jumps, but not the no-jump errors, can be achieved with just a single order of squeezing.
  arXiv  Detail & Related papers  (2024-12-12T02:06:48Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Experimental realization of deterministic and selective photon addition in a bosonic mode assisted by an ancillary qubit [33.7054351451505]
  Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss.<n>Error correction requires a recovery operation that maps the error states -- which have opposite parity -- back onto the code states.<n>Here, we realize a collection of photon-number-selective, simultaneous photon addition operations on a bosonic mode.
  arXiv  Detail & Related papers  (2022-12-22T23:32:21Z)
• Finite-round quantum error correction on symmetric quantum sensors [7.059472280274009]
  Heisenberg limit provides a quadratic improvement over the standard quantum limit.<n>This limit remains elusive because of the inevitable presence of noise decohering quantum sensors.<n>We side-step this no-go result by using an optimal finite number of rounds of quantum error correction.
  arXiv  Detail & Related papers  (2022-12-12T23:41:51Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Construction of Bias-preserving Operations for Pair-cat Code [17.34207569961146]
  Multi-level systems can achieve a desirable set of bias-preserving quantum operations. Cat codes are not compatible with continuous quantum error correction against excitation loss error. We generalize the bias-preserving operations to pair-cat codes to be compatible with continuous quantum error correction against both bosonic loss and dephasing errors.
  arXiv  Detail & Related papers  (2022-08-14T20:45:26Z)
• Effectiveness of Variable Distance Quantum Error Correcting Codes [1.0203602318836442]
  We show that quantum programs can tolerate non-trivial errors and still produce usable output. In addition, we propose using variable strength (distance) error correction, where overhead can be reduced by only protecting more sensitive parts of the quantum program with high distance codes.
  arXiv  Detail & Related papers  (2021-12-19T02:45:18Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Trade-offs on number and phase shift resilience in bosonic quantum codes [10.66048003460524]
  One quantum error correction solution is to encode quantum information into one or more bosonic modes. We show that by using arbitrarily many modes, $g$-gapped multi-mode codes can yield good approximate quantum error correction codes.
  arXiv  Detail & Related papers  (2020-08-28T10:44:34Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.