English
Related papers

Related papers: Magic state distillation with low overhead

200 papers

We show that states obtained from deep random Clifford circuits doped with non-Clifford phase gates (including T-gates and $\sqrt{\mathrm{T}}$-gates) can be disentangled completely, provided the number of non-Clifford gates is smaller or…

Quantum Physics · Physics 2026-01-08 Gerald E. Fux , Benjamin Béri , Rosario Fazio , Emanuele Tirrito

Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure non-stabilizer states which can be distilled from certain mixed non-stabilizer states via Clifford group operations alone.…

Quantum Physics · Physics 2013-05-29 Earl T. Campbell , Dan E. Browne

This work augments the recently introduced Stabilizer Tensor Network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford…

Quantum Physics · Physics 2025-05-19 Azar C. Nakhl , Ben Harper , Maxwell West , Neil Dowling , Martin Sevior , Thomas Quella , Muhammad Usman

We investigate the statistical properties of orthogonal, or real, Clifford circuits doped with magic and imaginary resources. By developing the Weingarten calculus for the real Clifford group, we derive the exact overlap distribution of…

Quantum Physics · Physics 2025-12-19 Beatrice Magni , Markus Heinrich , Lorenzo Leone , Xhek Turkeshi

Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups. We introduce an efficient classical framework for computing stabilizer R\'enyi entropies and stabilizer…

Quantum Physics · Physics 2026-04-21 Zhenyu Xiao , Shinsei Ryu

The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…

Quantum Physics · Physics 2019-08-05 James R. Seddon , Earl T. Campbell

Quantum computers have recently made great strides and are on a long-term path towards useful fault-tolerant computation. A dominant overhead in fault-tolerant quantum computation is the production of high-fidelity encoded qubits, called…

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new…

Quantum Physics · Physics 2017-04-26 Theodore J. Yoder , Isaac H. Kim

Magic state distillation plays a crucial role in fault-tolerant quantum computation and represents a major bottleneck. In contrast to traditional logical-level distillation, physical-level distillation offers significant overhead reduction…

Quantum Physics · Physics 2025-10-29 Yutaka Hirano , Riki Toshio , Tomohiro Itogawa , Keisuke Fujii

Triorthogonal matrices were introduced in Quantum Information Theory in connection with distillation of magic states (Bravyi and Haah (2012)). We give an algorithm to construct binary triorthogonal matrices from binary self-dual codes.…

Information Theory · Computer Science 2024-08-20 Minjia Shi , Haodong Lu , Jon-Lark Kim , Patrick Sole

Magic states are key ingredients in schemes to realize universal fault-tolerant quantum computation. Theories of magic states attempt to quantify this computational element via monotones and determine how these states may be efficiently…

Quantum Physics · Physics 2022-04-28 Nikolaos Koukoulekidis , David Jennings

The ternary Golay code -- one of the first and most beautiful classical error-correcting codes discovered -- naturally gives rise to an 11-qutrit quantum error correcting code. We apply this code to magic state distillation, a leading…

Quantum Physics · Physics 2020-09-07 Shiroman Prakash

Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density parity-check (qLDPC) codes poses additional challenges, due…

Quantum Physics · Physics 2025-05-13 Guo Zhang , Yuanye Zhu , Xiao Yuan , Ying Li

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit…

Quantum Physics · Physics 2024-10-28 Tyler LeBlond , Christopher Dean , George Watkins , Ryan S. Bennink

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

Quantum Physics · Physics 2026-04-27 Mathias Weiden , Justin Kalloor , John Kubiatowicz , Ed Younis , Costin Iancu

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…

Magic state cultivation is a state-of-the-art protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation. It offers a significant reduction in spacetime overhead compared to traditional magic…

Quantum Physics · Physics 2026-03-25 Kaavya Sahay , Pei-Kai Tsai , Kathleen Chang , Qile Su , Thomas B. Smith , Shraddha Singh , Shruti Puri

Quantum computers capable of solving classically intractable problems are under construction, and intermediate-scale devices are approaching completion. Current efforts to design large-scale devices require allocating immense resources to…

One of the key challenges in quantum information is coherently manipulating the quantum state. However, it is an outstanding question whether control can be realized with low error. Only gates from the Clifford group -- containing $\pi$,…

In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where…

Quantum Physics · Physics 2025-08-15 Quynh T. Nguyen , Christopher A. Pattison
‹ Prev 1 3 4 5 6 7 10 Next ›