Magic State Distillation via Codes over Binary Extension Fields

• URL: http://arxiv.org/abs/2608.09727v1
• Date: Mon, 10 Aug 2026 15:26:12 GMT
• Title: Magic State Distillation via Codes over Binary Extension Fields
• Abstract summary: We show that multi-qubit gates of interest such as $textCS$, $textCCZ$, and.<n>textTOF# = textCCZ_123textCCZ_345$, can be packaged into simple gates over the larger fields.<n>We find that our protocols outperform the state-of-the-art in almost every situation.
• Score: 1.2016221684155222
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computation architectures are frequently bottlenecked by the overhead of producing high-fidelity magic states. In this work, we use algebraic geometric techniques to construct codes over binary extension fields $\mathbb{F}_{2^s}$, thus discovering new protocols for the distillation of qubit magic states, where our focus is on the regime of practical qubit-based quantum computing architectures. To do this, we show that multi-qubit gates of interest such as $\text{CS}$, $\text{CCZ}$, and $\text{TOF}\# = \text{CCZ}_{123}\text{CCZ}_{345}$, can be packaged into simple gates over the larger fields, and we derive simple algebraic conditions in the extension fields allowing the distillation of these gates. Because they are derived from Galois qudits, the corresponding qubits codes naturally handle the correlated errors present on such multi-qubit states. Moreover, the protocols we discover are extremely compact; for example, we show that 4 $\text{CS}$ states can be distilled to 1 $\text{CS}$ state at distance 2, using only 4 logical qubits. For a case study, we consider the distillation of $\text{CS}$ and $\text{CCZ}$ states from injected $\text{T}$ and $\text{CS}$ states. When optimized for magic state production per unit time, or logical spacetime volume, we find that our protocols outperform the state-of-the-art in almost every situation, both at input error rates $10^{-3}$ (direct injection), and $10^{-6}$ (allowing some cultivation pre-injection).

Related papers

• Zero-level $CCZ$ Distillation [2.6945797019995363]
  Magic state distillation is a key component of fault-tolerant quantum computation.<n>We propose a zero-level distillation protocol that efficiently generates a high-fidelity logical $CCZ magic state.<n>The proposed method improves the logical error rate by approximately one and two orders of magnitude at $p = 10-3$ and $p = 10-4$, respectively.
  arXiv  Detail & Related papers  (2026-05-21T01:22:28Z)
• Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators [36.94429692322632]
  Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings.<n>We compare the non-Clifford cost of implementing diagonal evolutions, exemplified by $U=e-it_x2$ in a uniform field-amplitude discretization of a real scalar field, using either one logical $d$-level qudit or $n_b=eil log drceil$ logical qubits.
  arXiv  Detail & Related papers  (2026-04-29T15:25:08Z)
• Efficient Fuzzy Private Set Intersection from Secret-shared OPRF [41.88845480337768]
  Fuzzy PSI (FPSI) is a PSI variant where the receiver learns the items $q in Q$ for which there exists some $w in W$ under a given distance metric.<n>We propose efficient FPSI protocols for $L_p in [1, infty]$ distance metrics.<n>Our protocols achieve linear communication and computation complexity in the set sizes $m,n$, the dimension $d$, and the distance threshold $$.
  arXiv  Detail & Related papers  (2026-04-16T11:51:25Z)
• Quantum Algorithms for Finite-horizon Markov Decision Processes [40.812944518646006]
  We design quantum algorithms that are more efficient than classical algorithms to solve time-dependent and finite-horizon Markov Decision Processes (MDPs)<n>In the exact dynamics setting, we prove that our $textbfQVI-1$ algorithm achieves a quadratic speedup in the size of the action space $(A)$.<n>In the generative model setting, we prove that our algorithms $textbfQVI-3$ and $textbfQVI-4$ achieve improvements in sample complexity over the state-of-the-art (SOTA) classical algorithm.
  arXiv  Detail & Related papers  (2025-08-07T09:00:23Z)
• Efficient Magic State Cultivation on $\mathbb{RP}^2$ [4.828791769306579]
  We propose a new magic state cultivation protocol that produces a logical $mathrmT$ state on a rotated surface code.<n>Small $mathbbRP2$ codes are used to hold logical information and checked by syndrome extraction circuits.<n>Our protocol requires about an order of magnitude smaller space-time volume to reach a target logical error rate around $10-9$ compared to the original MSC protocol.
  arXiv  Detail & Related papers  (2025-03-24T13:20:57Z)
• Generating logical magic states with the aid of non-Abelian topological order [0.0]
  In fault-tolerant quantum computing, non-Clifford gates are crucial for universal computation.<n>We propose a new protocol that combines magic state preparation and code transformation to realize logical non-Clifford operations.
  arXiv  Detail & Related papers  (2025-02-03T02:38:32Z)
• Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound [44.154181086513574]
  We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ frackn = frac13 $. We demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs.
  arXiv  Detail & Related papers  (2024-10-05T11:56:15Z)
• Constant-Overhead Magic State Distillation [10.97201040724828]
  Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. Existing protocols require polylogarithmically growing overheads with some $gamma > 0$. We develop protocols that achieve an $mathcalO(1)$ overhead, meaning the optimal $gamma = 0$.
  arXiv  Detail & Related papers  (2024-08-14T18:31:22Z)
• Low Overhead Qutrit Magic State Distillation [0.0]
  We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with fault-tolerant quantum computing.<n>We construct a family of $[[9m-k, k, 2]]_3$ triorthogonal qutrit error-correcting codes for any positive $m$ and $k$ with $k leq 3m-2 integers.
  arXiv  Detail & Related papers  (2024-03-10T14:56:07Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits [0.755972004983746]
  Variational quantum algorithms (VQAs) optimize the parameters $vectheta$ of a parametrized quantum circuit. We prove two results, assuming $V(vectheta)$ is an alternating layered ansatz composed of blocks forming local 2-designs. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
  arXiv  Detail & Related papers  (2020-01-02T18:18:25Z)

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.