Enlarging the GKP stabilizer group for enhanced noise protection

• URL: http://arxiv.org/abs/2509.12502v2
• Date: Wed, 24 Sep 2025 13:49:59 GMT
• Title: Enlarging the GKP stabilizer group for enhanced noise protection
• Authors: Jonathan Pelletier, Baptiste Royer,
• Abstract summary: We investigate how the stabilizer group of the Gottesman-Kitaev-Preskill codes can contribute to the search for an optimal implementation of a logical circuit when it is affected by noise.<n>We propose an algorithm that finds the optimal implementation of a given logical Clifford circuit on GKP codes, such that the state is less affected by loss errors during the numerically.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Encoding a qubit in a larger Hilbert space of an oscillator is an efficient way to protect its quantum information against decoherence. Promising examples of such bosonic encodings are the Gottesman-Kitaev-Preskill (GKP) codes. In this work, we investigate how redefining the stabilizer group of the GKP codes to include all operations with trivial action on the code space can contribute to the search for an optimal implementation of a logical circuit when it is affected by noise. We find the generators of the Gaussian stabilizer group, allowing us to search for different physical implementations of a Clifford operation. We then propose an algorithm that finds the optimal implementation of a given logical Clifford circuit on GKP codes, such that the state is less affected by loss errors during the computation. Finally, we demonstrate numerically, with logical randomized benchmarking, that such a compiler can increase the lifetime of square-GKP qubits while running Clifford circuits, compared to a random walk compiler.

Related papers

• 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)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40: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)
• Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla [0.6802401545890963]
  Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement error in phase space. If noise in phase space is biased, square-lattice GKP code can be ancillaryd with XZZX surface code or repetition code. We study the performance of GKP repetition codes with physical ancillary GKP qubits in correcting biased noise.
  arXiv  Detail & Related papers  (2023-08-03T06:14:43Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Robust suppression of noise propagation in GKP error-correction [0.0]
  Recently reported generation and error-correction of GKP qubits holds great promise for the future of quantum computing. We develop efficient numerical methods to optimize our protocol parameters. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.
  arXiv  Detail & Related papers  (2023-02-23T15:21:50Z)
• Optimal encoding of oscillators into more oscillators [5.717368673366845]
  We show that an arbitrary GKP-stabilizer code can be reduced to a generalized GKP two-mode-squeezing code. For single-mode data and ancilla, this optimal code design problem can be efficiently solved. We identify the D4 lattice -- a 4-dimensional dense-packing lattice -- to be superior to a product of lower dimensional lattices.
  arXiv  Detail & Related papers  (2022-12-22T18:54:57Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits [118.22458816174144]
  We propose a novel robust elimination-type algorithm that runs in epochs, combines exploration with infrequent switching to select a small subset of actions, and plays each action for multiple time instants. Our algorithm, GP Robust Phased Elimination (RGP-PE), successfully balances robustness to corruptions with exploration and exploitation. We perform the first empirical study of robustness in the corrupted GP bandit setting, and show that our algorithm is robust against a variety of adversarial attacks.
  arXiv  Detail & Related papers  (2022-02-03T21:19:36Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• 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)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.