Unitary fault-tolerant encoding of Pauli states in surface codes

• URL: http://arxiv.org/abs/2601.05113v1
• Date: Thu, 08 Jan 2026 17:00:25 GMT
• Title: Unitary fault-tolerant encoding of Pauli states in surface codes
• Authors: Luis Colmenarez, Remmy Zen, Jan Olle, Florian Marquardt, Markus Müller,
• Abstract summary: We present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes.<n>Our work bridges the gap between measurement-based and unitary encodings of surface-code states.
• Score: 0.8314040122511801
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable, distance-preserving encoding scheme for preparing Pauli eigenstates in surface codes. Unlike previous unitary approaches whose fault-distance remains constant with increasing code distance, our scheme ensures that the protection offered by the code is preserved during state preparation. Building on strategies discovered by reinforcement learning for the surface-17 code, we generalize the construction to arbitrary code distances and both rotated and unrotated surface codes. The proposed encoding relies only on geometrically local gates, and is therefore fully compatible with planar 2D qubit connectivity, and it achieves circuit depth scaling as $\mathcal{O}(d)$, consistent with fundamental entanglement-generation bounds. We design explicit stabilizer-expanding circuits with and without ancilla-mediated connectivity and analyze their error-propagation behavior. Numerical simulations under depolarizing noise show that our unitary encoding without ancillas outperforms standard stabilizer-measurement-based schemes, reducing logical error rates by up to an order of magnitude. These results make the scheme particularly relevant for platforms such as trapped ions and neutral atoms, where measurements are costly relative to gates and idling noise is considerably weaker than gate noise. Our work bridges the gap between measurement-based and unitary encodings of surface-code states and opens new directions for distance-preserving state preparation in fault-tolerant quantum computation.

Related papers

• 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)
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements [0.8491161158902805]
  We propose an efficient approach to generate unitary designs for encoded qubits in surface codes.<n>We numerically show that the ensemble of logical unitaries converges to a unitary design in the thermodynamic limit.<n>Our results provide a practical way to realize unitary designs on encoded qubits.
  arXiv  Detail & Related papers  (2024-12-05T18:36:14Z)
• Non-local resources for error correction in quantum LDPC codes [0.0]
  High performing qLDPC codes have non-local stabilizers that are challenging to measure.<n>Recent advancements have shown how to deterministically perform high-fidelity, cavity mediated many-body gates.<n>We propose a compatible tri-layer architectural layout for scheduling stabilizer measurements.
  arXiv  Detail & Related papers  (2024-09-09T17:28:41Z)
• Toward a 2D Local Implementation of Quantum LDPC Codes [1.1936126505067601]
  Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes.<n>We present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates.
  arXiv  Detail & Related papers  (2024-04-26T19:48:07Z)
• 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)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Mitigating Temporal Fragility in the XY Surface Code [3.4746204759424715]
  We propose a new logical state preparation protocol based on locally entangling qubits into small Greenberger-Horne-Zeilinger-like states. We prove that in this new procedure $O(sqrtn)$ high-rate errors along a single lattice boundary can cause a logical failure.
  arXiv  Detail & Related papers  (2023-10-26T18:00:02Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• 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)
• 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)
• 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)
• Measurement-free preparation of grid states [0.0]
  The Gottesman-Kitaev-Preskill code is a promising approach towards fault-tolerant quantum computing. For the code to be fault tolerant, the quality of the grid states has to be extremely high. Here we propose a measurement-free preparation protocol which deterministically prepares arbitrary logical grid states with a rectangular or hexagonal lattice.
  arXiv  Detail & Related papers  (2019-12-29T13:12:46Z)

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.