Unitary fault-tolerant encoding of Pauli states in surface codes
Luis Colmenarez, Remmy Zen, Jan Olle, Florian Marquardt, Markus M\"uller

TL;DR
This paper introduces a scalable, unitary encoding method for preparing Pauli eigenstates in surface codes that preserves fault-tolerance during state preparation, outperforming traditional measurement-based schemes.
Contribution
It presents a novel, distance-preserving, unitary encoding scheme for surface codes that is compatible with 2D qubit layouts and reduces logical error rates.
Findings
Outperforms standard schemes under depolarizing noise
Reduces logical error rates by up to an order of magnitude
Compatible with planar 2D qubit connectivity
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 ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
