English
Related papers

Related papers: Small Codes for Magic State Distillation

200 papers

Quantum technologies rely on high-quality resource states, such as maximally entangled or private states, which are indispensable for quantum communication and cryptography. In practice, however, these states are inevitably degraded by…

Quantum Physics · Physics 2026-03-05 Christopher Popp , Tobias C. Sutter , Beatrix C. Hiesmayr

Quantum error correction is a cornerstone of reliable quantum computing, with surface codes emerging as a prominent method for protecting quantum information. Surface codes are efficient for Clifford gates but require magic state…

Quantum Physics · Physics 2025-03-13 Avimita Chatterjee , Archisman Ghosh , Swaroop Ghosh

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

To run large-scale algorithms on a quantum computer, error-correcting codes must be able to perform a fundamental set of operations, called logic gates, while isolating the encoded information from…

Magic state distillation protocols have a complicated non-linear nature. Analysis of protocols is therefore usually restricted to one-parameter families of states, which aids tractability. We show that if we lift this one-parameter…

Quantum Physics · Physics 2017-08-31 Patrick Rall

Error correcting codes protect quantum information and form the basis of fault tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transverse non-Clifford…

Quantum Physics · Physics 2015-10-12 Earl T. Campbell

Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so called qudit…

Quantum Physics · Physics 2020-06-24 Lane G. Gunderman

We develop a procedure for distilling magic states used in universal quantum computing that requires substantially fewer initial resources than prior schemes. Our distillation circuit is based on a family of concatenated quantum codes that…

Quantum Physics · Physics 2013-04-10 Cody Jones

We present a scheme for magic state distillation using punctured polar codes. Our results build on some recent work by Bardet et al. (ISIT, 2016) who discovered that polar codes can be described algebraically as decreasing monomial codes.…

Quantum Physics · Physics 2019-01-08 Anirudh Krishna , Jean-Pierre Tillich

With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…

Quantum Physics · Physics 2025-07-09 Victor Barizien , Hugo Jacinto , Nicolas Sangouard

In many architectures for fault tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible…

Quantum Physics · Physics 2011-06-28 Earl T. Campbell

The leading paradigm for performing computation on quantum memories can be encapsulated as distill-then-synthesize. Initially, one performs several rounds of distillation to create high-fidelity magic states that provide one good T gate, an…

Quantum Physics · Physics 2017-02-15 Earl T. Campbell , Mark Howard

Encoding quantum information to protect it from errors is essential for performing large-scale quantum computations. Performing a universal set of quantum gates on encoded states demands a potentially large resource overhead and minimizing…

Practical quantum computation requires high-fidelity instruction executions on qubits. Among them, Clifford instructions are relatively easy to perform, while non-Clifford instructions require the use of magic states. This makes magic state…

Quantum Physics · Physics 2025-09-30 Junshi Wang , Prakash Murali

We show that the physical consistency of magic state distillation imposes new constraints on the weight enumerators of classical error-correcting codes. We establish that for $|T\rangle$-state distillation protocols based on linear…

Quantum Physics · Physics 2026-03-24 Amolak Ratan Kalra , Shiroman Prakash

Identifying necessary and sufficient conditions for universal quantum computing is a long-standing open problem for which contextuality is, perhaps, the only promising solution [Howard et al., Nature 510, 351 (2014)]. To justify this…

Quantum Physics · Physics 2020-03-06 Shiroman Prakash , Aashi Gupta

We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal…

Quantum Physics · Physics 2025-04-25 Lucas Daguerre , Isaac H. Kim

Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the architecture, the computational space, magic states can then…

Quantum Physics · Physics 2024-03-29 Vadym Kliuchnikov , Eddie Schoute

The failure susceptibility of the quantum hardware will force quantum computers to execute fault-tolerant quantum circuits. These circuits are based on quantum error correcting codes, and there is increasing evidence that one of the most…

Quantum Physics · Physics 2019-01-31 Alexandru Paler

Virtual distillation is a technique that aims to mitigate errors in noisy quantum computers. It works by preparing multiple copies of a noisy quantum state, bridging them through a circuit, and conducting measurements. As the number of…

Quantum Physics · Physics 2023-10-11 Peiyi Li , Ji Liu , Hrushikesh Pramod Patil , Paul Hovland , Huiyang Zhou