Bosonic quantum error-correcting codes with finite stellar rank

• URL: http://arxiv.org/abs/2607.06404v1
• Date: Tue, 07 Jul 2026 15:34:20 GMT
• Title: Bosonic quantum error-correcting codes with finite stellar rank
• Abstract summary: We use stellar rank as a resource measure to benchmark bosonic codes under finite non-Gaussian resources.<n>For fixed cat and Gottesman--Kitaev--Preskill (GKP) code families, we show that finite stellar rank creates a trade-off among state approximability, energy, and logical protection under photon loss and photon-number dephasing.
• Score: 37.34241762574075
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Bosonic quantum error correction (QEC) relies on non-Gaussian bosonic encodings whose preparation cost is a central practical constraint. In this work, we use stellar rank as a resource measure to design and benchmark bosonic codes under finite non-Gaussian resources. For fixed cat and Gottesman--Kitaev--Preskill (GKP) code families, we show that finite stellar rank creates a trade-off among state approximability, energy, and logical protection under photon loss and photon-number dephasing, evaluated with optimal recovery. This trade-off implies that codewords with better ideal error-correction properties need not be optimal once finite-rank preparation constraints are imposed. Going beyond fixed-target codewords, we directly optimize bosonic encodings at fixed stellar rank, revealing noise-adapted code structures and concrete resource thresholds. Grid-like encodings emerge under photon loss, whereas approximately rotation-symmetric encodings arise under dephasing. In the optimized search, stellar rank k=2 suffices to surpass break-even for all dephasing strengths considered, while under photon loss the required rank increases with the loss rate. These results establish stellar rank as an operationally meaningful resource measure for bosonic QEC under practical state-preparation constraints.

Related papers

• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes [0.0]
  Bosonic quantum error-correcting codes encode logical information in a harmonic oscillator.<n>It remains unclear under what physical noise conditions (including photon loss and dephasing) one encoding intrinsically outperforms the other.<n>Here we estimate a quantitative performance boundary between GKP and NP codes under general photon loss-dephasing noise.
  arXiv  Detail & Related papers  (2026-02-27T15:42:34Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Discovering autonomous quantum error correction via deep reinforcement learning [10.881124265851327]
  In this work, we utilize curriculum learning enabled deep reinforcement learning to discover Bosonic codes.<n>We find that the two-phase trained agent can discover the optimal set of codewords.<n>We also analyze the robustness of the code against the phase damping and amplitude damping noise.
  arXiv  Detail & Related papers  (2025-11-16T07:31:50Z)
• Quantum Error Correction with Superpositions of Squeezed Fock States [36.94429692322632]
  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.
  arXiv  Detail & Related papers  (2025-10-05T13:52:08Z)
• Neural Network-Based Design of Approximate Gottesman-Kitaev-Preskill Code [2.209911250765614]
  Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. Conventional approximate GKP codewords are superpositions of multiple large-amplitude squeezed coherent states. We utilize a neural network to generate optimal approximate GKP states, allowing effective error correction with just a few squeezed coherent states.
  arXiv  Detail & Related papers  (2024-11-02T14:34:24Z)
• The Near-optimal Performance of Quantum Error Correction Codes [2.670972517608388]
  We derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. Compared to conventional optimization-based approaches, the reduced computational cost enables us to simulate systems with previously inaccessible sizes. We analytically derive the near-optimal performance for the thermodynamic code and the Gottesman-Kitaev-Preskill (GKP) code.
  arXiv  Detail & Related papers  (2024-01-04T01:44:53Z)
• Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation [69.43216268165402]
  We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits. We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
  arXiv  Detail & Related papers  (2023-03-06T16:51:30Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)

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.