A $\boldsymbol{2d \times d \times d}$ Spacetime Volume Implementation of a Logical S Gate in the Surface Code

• URL: http://arxiv.org/abs/2604.13632v1
• Date: Wed, 15 Apr 2026 09:00:52 GMT
• Title: A $\boldsymbol{2d \times d \times d}$ Spacetime Volume Implementation of a Logical S Gate in the Surface Code
• Abstract summary: A logical S-gate correction is required in every logical T-gate teleportation.<n>Existing S-gate implementations require spacetime volumes of (2d times 2d times d) or (2d times 1.5d times d), where $d$ is the code distance of the surface code.<n>We propose a novel twist defect braiding protocol that reduces the spacetime volume to (2d times d times d)
• Score: 0.1679937788852768
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The logical S gate implemented via twist defect braiding in the surface code is one of the major sources of overhead in fault-tolerant quantum computing, since an S-gate correction is required in every logical T-gate teleportation. Existing logical S-gate implementations require spacetime volumes of \(2d \times 2d \times d\) or \(2d \times 1.5d \times d\), where $d$ is the code distance of the surface code. To the best of our knowledge, their circuit-level implementations have not yet been shown, hindering quantitative comparisons of fault distances and logical error rates. In this work, we provide these missing circuit-level implementations. Additionally, we propose a novel twist defect braiding protocol that reduces the spacetime volume to \(2d \times d \times d\). First, we construct an implementation of the proposed method using constant-length non-local gates, and then refine it to utilize only nearest-neighbor two-qubit gates on a square grid, without requiring additional two-qubit gate depth beyond that of standard syndrome extraction circuits. Through numerical simulations, we evaluate the fault distances and logical error rates for both existing and proposed methods. Our results show that, although the proposed method reduces the fault distance by one or three, its logical error rates remain comparable to those of existing methods at large code distances (\(d \ge 5\)) and at physical error rates near \(p = 10^{-3}\). This demonstrates that the proposed method is promising for near-term fault-tolerant quantum computing.

Related papers

• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth [0.1679937788852768]
  Hook errors are a major challenge in implementing logical operations with the surface code.<n>We propose the ZX interleaving syndrome extraction, which preserves the full fault distance $d$ for any surface-code layout.<n>The proposed method may serve as an indispensable technique for practical fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2026-03-02T09:05:21Z)
• Efficient circuit compression by multi-qudit entangling gates in linear optical quantum computation [1.9157770789584179]
  We show the existence of multi-level control ent-Z gates for qudits encoded in multiple modes in LOQC.<n>We present explicit linear optical schemes that realize such operations.<n>Our results improve upon a key scalability limitation and significantly improve the efficiency of LOQC architectures.
  arXiv  Detail & Related papers  (2026-02-09T08:52:41Z)
• Low-depth quantum error correction via three-qubit gates in Rydberg atom arrays [0.0]
  Quantum error correction (QEC) requires the execution of deep quantum circuits with large numbers of physical qubits to protect information against errors.<n>We show how to realize fast and efficient surface code stabilizer using only two $CZ$ gates -- instead of four $CZ$ -- while preserving fault tolerance.
  arXiv  Detail & Related papers  (2025-07-08T15:37:48Z)
• Optimizing Superconducting Three-Qubit Gates for Surface-Code Error Correction [1.1323522905584675]
  We design a 3-qubit CZZ gate for superconducting transmon qubits that maps the parity of two data qubits onto one measurement qubit in a single step.<n>We use an error model obtained from the microscopic gate simulation to systematically suppress Pauli errors that are particularly harmful to the QEC protocol.<n>We find that for the rotated surface code, the implementation of CZZ gates increases the error threshold by nearly 50% to $approx 1.2,%$ and decreases the logical error rate, in the experimental relevant regime, by up to one order of magnitude.
  arXiv  Detail & Related papers  (2025-06-10T17:54:22Z)
• Universal fault tolerant quantum computation in 2D without getting tied in knots [1.796950496605906]
  We show how to perform fault-tolerant non-Clifford gates in two dimensions.<n>We formulate a path framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits.
  arXiv  Detail & Related papers  (2025-03-19T23:59:46Z)
• 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)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [41.94295877935867]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers.<n>The square-lattice surface code has become the workhorse to address this challenge.<n>In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• 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)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)

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.