Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes

• URL: http://arxiv.org/abs/2602.24102v1
• Date: Fri, 27 Feb 2026 15:42:34 GMT
• Title: Estimating the performance boundary of Gottesman-Kitaev-Preskill codes and number-phase codes
• Authors: Kai-Xuan Wen, Dong-Long Hu, Shengyong Li, Ze-Liang Xiang,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bosonic quantum error-correcting codes encode logical information in a harmonic oscillator, with the Gottesman-Kitaev-Preskill (GKP) and number-phase (NP) codes representing two fundamentally different encoding paradigms. Although both have been extensively studied, it remains unclear under what physical noise conditions (including photon loss and dephasing) one encoding intrinsically outperforms the other. Here we estimate a quantitative performance boundary between GKP and NP codes under general photon loss-dephasing noise. By optimizing code parameters within each encoding family, we identify the noise regimes in which each code exhibits a fundamental advantage. In particular, we find that the crossover occurs when the dephasing strength is approximately two orders of magnitude smaller than the loss strength, revealing a sharp separation between operational regimes. Beyond this specific comparison, our work establishes a practical and extensible methodology for benchmarking bosonic codes and optimizing their parameters, providing concrete guidance for the experimental selection and deployment of bosonic encodings in realistic noise environments.

Related papers

• Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes [1.9265037496741413]
  The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure loss channels.<n>These results highlight the capability of concatenation-based GKP codes and provides new methods for constructing good GKP lattices.
  arXiv  Detail & Related papers  (2025-05-15T17:01:51Z)
• Logical channels in approximate Gottesman-Kitaev-Preskill error correction [0.0]
  The GKP encoding is a top contender among bosonic codes for fault-tolerant quantum computation.<n>We analyze a variant of the GKP stabilizer measurement circuit using damped, approximate GKP states.<n>We show that SB decoding is suboptimal for finite-energy GKP states.
  arXiv  Detail & Related papers  (2025-04-18T00:13:42Z)
• Performance and achievable rates of the Gottesman-Kitaev-Preskill code for pure-loss and amplification channels [2.955647071443854]
  We analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill code under pure loss and pure amplification.<n>Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.
  arXiv  Detail & Related papers  (2024-12-09T18:03:31Z)
• A Theoretical Perspective for Speculative Decoding Algorithm [60.79447486066416]
  One effective way to accelerate inference is emphSpeculative Decoding, which employs a small model to sample a sequence of draft tokens and a large model to validate. This paper tackles this gap by conceptualizing the decoding problem via markov chain abstraction and studying the key properties, emphoutput quality and inference acceleration, from a theoretical perspective.
  arXiv  Detail & Related papers  (2024-10-30T01:53:04Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• 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)
• Performance of surface codes in realistic quantum hardware [0.24466725954625884]
  Surface codes are generally studied based on the assumption that each of the qubits that make up the surface code lattice suffers noise that is independent and identically distributed (i.i.d.) We introduce independent non-identically distributed (i.ni.d.) noise model, a decoherence model that accounts for the non-uniform behaviour of the docoherence parameters of qubits. We consider and describe two methods which enhance the performance of planar codes under i.ni.d. noise.
  arXiv  Detail & Related papers  (2022-03-29T15:57:23Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

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.