Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes

• URL: http://arxiv.org/abs/2509.14658v2
• Date: Wed, 15 Oct 2025 14:58:15 GMT
• Title: Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes
• Authors: Lukas Brenner, Beatriz Dias, Robert Koenig,
• Abstract summary: We introduce a single scalar quantity we call the (composable) logical gate error.<n>It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space.<n>We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states.
• Score: 0.13764085113103217
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity we call the (composable) logical gate error. It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space. It is subadditive under successive application of gates, providing a simple means for analyzing circuits. We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states. In the continuous-variable context, this sidesteps the need for computing energy-bounded norms. As an example, we study the composable logical gate error for linear optics implementations of Paulis and Cliffords in approximate Gottesman-Kitaev-Preskill (GKP) codes. We find that the logical gate error for implementations of Paulis depends linearly on the squeezing parameter. This implies that their accuracy improves monotonically with the amount of squeezing. For some Cliffords, however, linear optics implementations which are exact for ideal GKP codes fail in the approximate case: they have a constant logical gate error even in the limit of infinite squeezing. This is consistent with previous results about the limitations of certain gate implementations for approximate GKP codes. It shows that findings applicable to ideal GKP codes do not always translate to the realm of physically realizable approximate GKP codes.

Related papers

• Fault-Tolerant Non-Clifford GKP Gates using Polynomial Phase Gates and On-Demand Noise Biasing [0.0]
  We propose a method for on-demand noise biasing based on a standard GKP error correction circuit.<n>We prove that the logical error rate of the $T$ gate can be made arbitrarily small as the quality of the GKP codestates increases.
  arXiv  Detail & Related papers  (2025-11-25T14:34:36Z)
• Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction [0.0]
  We show that logical gates can be expressed as exponential qubits of the electric and magnetic gauge fields.<n>Our results offer new insights into the interplay between quantum error correction, topology, and quantum field theory.
  arXiv  Detail & Related papers  (2025-11-19T08:23:50Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits [0.0]
  In superconducting circuits, all the required two-qubit gates can be implemented with a single piece of hardware. We analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder can reduce the gate infidelity by multiple orders of magnitude.
  arXiv  Detail & Related papers  (2024-03-04T19:00:04Z)
• Toward Constructing a Continuous Logical Operator for Error-Corrected Quantum Sensing [0.0]
  Operations on logical qubits are only performed through universal gate sets consisting of finite-sized gates such as Clifford+T. The Eastin-Knill theorem prevents a continuous signal from being both fault tolerant to local errors and transverse. A protocol to design continuous logical z-rotations is proposed and applied to the Steane Code.
  arXiv  Detail & Related papers  (2023-04-30T18:22:34Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Partitioning qubits in hypergraph product codes to implement logical gates [0.0]
  Transversal gates are the simplest type of fault-tolerant logical gates. We show that gates can be used as the basis for universal quantum computing on LDPC codes.
  arXiv  Detail & Related papers  (2022-04-22T16:45:19Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Experimental Characterization of Fault-Tolerant Circuits in Small-Scale Quantum Processors [67.47400131519277]
  A code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates. Some circuits did not satisfy the fault tolerance criterion. It is most accurate to assess the fault tolerance criterion when the circuits tested are restricted to those that give rise to an output state with a low dimension.
  arXiv  Detail & Related papers  (2021-12-08T01:52:36Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• 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)
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes [0.0]
  Quantum computers should have both universal and fault-tolerant logic gates. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. We present a general framework for universal fault-tolerant logic with stabiliser codes. We show how non-unitary implementations of logic gates provide a general approach to circumvent the no-go theorem.
  arXiv  Detail & Related papers  (2020-12-09T19:01: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.