English
Related papers

Related papers: Codes and Protocols for Distilling $T$, controlled…

200 papers

We study the transversality of the Toffoli gate in a hybrid-code system that employs two quantum error correction codes with special structure. We find that a system using a triorthogonal code with its paired code supports a fully…

Quantum Physics · Physics 2025-11-13 Dawei Jiao , Mahdi Bayanifar , Alexei Ashikhmin , Olav Tirkkonen

We propose a new family of error detecting stabilizer codes with an encoding rate 1/3 that permit a transversal implementation of the pi/8-rotation $T$ on all logical qubits. The new codes are used to construct protocols for distilling…

Quantum Physics · Physics 2012-11-30 Sergey Bravyi , Jeongwan Haah

Qudits offer the potential for low-overhead magic state distillation, although previous results for asymptotically good codes have required qudit dimension $q\gg 100$ or code length $\mathcal{N}\gg 100$. These parameters far exceed…

Quantum Physics · Physics 2025-12-29 Michael J. Cervia , Henry Lamm , Diyi Liu , Edison M. Murairi , Shuchen Zhu

Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource…

Quantum Physics · Physics 2013-09-05 Adam Paetznick , Ben W. Reichardt

It has been conjectured [1] that for any distillation protocol for magic states for the $T$ gate, the number of noisy input magic states required per output magic state at output error rate $\epsilon$ is $\Omega(\log(1/\epsilon))$. We show…

Quantum Physics · Physics 2018-02-07 M. B. Hastings , J. Haah

Magic State Distillation (MSD) has been a research focus for fault-tolerant quantum computing due to the need for non-Clifford resource in gaining quantum advantage. Although many of the MSD protocols so far are based on stabilizer codes…

Quantum Physics · Physics 2025-09-23 Yunzhe Zheng , Dong E. Liu

Magic state distillation (MSD) is a cornerstone of fault-tolerant quantum computing, enabling non-Clifford gates via state injection into stabilizer circuits. However, the substantial overhead of current MSD protocols remains a major…

Quantum Physics · Physics 2026-05-26 Muhammad Erew , Moshe Goldstein , Yaron Oz , Haim Suchowski

Fault-tolerant quantum computation requires minimizing non-Clifford gates, whose implementation via magic state distillation dominates the resource costs. While $T$-count minimization is well-studied, dedicated $CCZ$ factories shift the…

Quantum Physics · Physics 2026-02-18 Kirill Khoruzhii , Patrick Gelß , Sebastian Pokutta

Magic state distillation is a key component of fault-tolerant quantum computation, as it enables the implementation of non-Clifford gates such as the $T$ gate and the $CCZ$ gate via gate teleportation. However, conventional distillation…

Quantum Physics · Physics 2026-05-22 Tomohiro Itogawa , Yutaka Hirano , Yutaro Akahoshi , Keisuke Fujii

Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could…

Information Theory · Computer Science 2021-08-20 Narayanan Rengaswamy , Robert Calderbank , Michael Newman , Henry D. Pfister

We propose families of protocols for magic state distillation -- important components of fault tolerance schemes --- for systems of odd prime dimension. Our protocols utilize quantum Reed-Muller codes with transversal non-Clifford gates. We…

Quantum Physics · Physics 2013-01-01 Earl T. Campbell , Hussain Anwar , Dan E. Browne

For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can…

Quantum Physics · Physics 2013-03-27 Bryan Eastin

High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive…

Quantum Physics · Physics 2026-05-04 Cheng-Yun Ding , Li-Hua Zhang , Jian Zhou

This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost metrics are used. Our synthesis techniques are independent…

Quantum Physics · Physics 2011-08-01 D. Maslov , D. M. Miller , G. W. Dueck

Triorthogonal codes are a class of quantum error correcting codes used in magic state distillation protocols. We classify all triorthogonal codes with $n+k \le 38$, where $n$ is the number of physical qubits and $k$ is the number of logical…

Quantum Physics · Physics 2022-07-29 Sepehr Nezami , Jeongwan Haah

We present an infinite family of protocols to distill magic states for $T$-gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a given target error that is conjectured to be optimal. The space…

Quantum Physics · Physics 2017-10-04 Jeongwan Haah , Matthew B. Hastings , D. Poulin , D. Wecker

The standard approach to fault-tolerant quantum computation is to store information in a quantum error correction code, such as the surface code, and process information using a strategy that can be summarized as distill-then-synthesize. In…

Quantum Physics · Physics 2026-05-01 Earl T. Campbell , Mark Howard

Multi-controlled Toffoli gates are fundamental building blocks in quantum computation, with applications in quantum arithmetic, simulation, and search algorithms. In fault-tolerant architectures, their realization is constrained by the high…

Quantum Physics · Physics 2026-05-19 Abhoy Kole , Majd Assaad , Till Schnittka , Rolf Drechsler

Fault-tolerant implementation of non-Clifford gates is a major challenge for achieving universal fault-tolerant quantum computing with quantum error-correcting codes. Magic state distillation is the most well-studied method for this but…

Quantum Physics · Physics 2026-01-09 Seok-Hyung Lee , Felix Thomsen , Nicholas Fazio , Benjamin J. Brown , Stephen D. Bartlett

Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-dimensional (2D) topological codes such as the surface and…

Quantum Physics · Physics 2021-06-23 Michael E. Beverland , Aleksander Kubica , Krysta M. Svore
‹ Prev 1 2 3 10 Next ›