!
You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.
Quick Navigation
Topics
Quantum Error Correction Fault Tolerance
Parity-unfolded distillation architecture for noise-biased platforms
arXiv
Authors: Konstantin Tiurev, Christoph Fleckenstein, Christophe Goeller, Paul Schnabl, Matthias Traube, Nitica Sakharwade, Anette Messinger, Josua Unger, Wolfgang Lechner
Year
2026
Paper ID
52503
Status
Preprint
Abstract Read
~2 min
Abstract Words
157
Citations
N/A
Abstract
We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations Z^{1/2k} rather than approximating them with the conventional (Clifford + T) gate set. The architecture is enabled by efficient distillation of gates from an arbitrary level of the Clifford hierarchy, which we refer to as parity unfolding. With it, a state |Zkrangle = Z^{1/2k}|{+}rangle can be prepared fault-tolerantly using 2k+3 + O\(2k/2\) biased-noise qubits on a planar chip with nearest-neighbour connectivity. For algorithms requiring native Z^{1/2k} gates, such as the Quantum Fourier Transform and phase estimation, the proposed scheme allows to reduce resource overheads for up to k=7, i.e., up to T1/32. Furthermore, when used for the synthesis of arbitrary small-angle rotations, parity-unfolded distillation of $T$ + $sqrt{T}$ reduces the minimum achievable logical error rate by 43% while cutting the resource requirements by 26%, when compared to unfolded distillation of only the T gate.
Why This Paper Matters
- This paper contributes to the Quantum Error Correction & Fault Tolerance research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations Z^1/2^k...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.