English
Related papers

Related papers: Distilling Magic States in the Bicycle Architectur…

200 papers

We show how looped pipeline architectures - which use short-range shuttling of physical qubits to achieve a finite amount of non-local connectivity - can be used to efficiently implement the fault-tolerant non-Clifford gate between 2D…

Quantum Physics · Physics 2025-02-17 Thomas R. Scruby , Kae Nemoto , Zhenyu Cai

Topological measurement-based quantum computation (MBQC) enables one to carry out universal fault-tolerant quantum computation via single-qubit Pauli measurements with a family of large entangled states called cluster states as resources.…

Quantum Physics · Physics 2022-01-06 Seok-Hyung Lee , Hyunseok Jeong

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 states are eigenstates of non-Pauli operators. One way of suppressing errors present in magic states is to perform parity measurements in their non-Pauli eigenbasis and postselect on even parity. Here we develop new protocols based on…

Quantum Physics · Physics 2018-02-23 Earl T. Campbell , Mark Howard

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

Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum…

Quantum Physics · Physics 2021-04-20 Benjamin J. Brown

Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state rho, can we do universal quantum computation? As motivation for this question, "magic state" distillation procedures can reduce the general…

Quantum Physics · Physics 2007-05-23 Ben W. Reichardt

High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight $6$ or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB)…

Quantum Physics · Physics 2026-05-07 Zijian Liang , Yu-An Chen

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

I reduce the cost to prepare magic states with lattice surgery operations on the surface code by using a recursive implementation of 15-to-1 magic state distillation. On a rotated surface code with distance $d$, $|T\rangle$ preparation…

Quantum Physics · Physics 2026-03-06 Jonathan E. Moussa

As quantum computing progresses towards the early fault-tolerant regime, quantum error correction will play a crucial role in protecting qubits and enabling logical Clifford operations. However, the number of logical qubits will initially…

Quantum Physics · Physics 2025-11-11 Surabhi Luthra , Alexandra E. Moylett , Dan E. Browne , Earl T. Campbell

Magic state cultivation is a leading approach for generating the resource states required for fault-tolerant quantum computation. Here we present a new cultivation protocol that increases the success probability of magic-state generation in…

Quantum Physics · Physics 2026-02-02 Yotam Vaknin , Shoham Jacoby , Arne Grimsmo , Alex Retzker

Magic state distillation, which is a probabilistic process used to generate magic states, plays an important role in universal fault-tolerant quantum computers. On the other hand, to solve interesting problems, we need to run complex…

Quantum Physics · Physics 2024-07-11 Yutaka Hirano , Yasunari Suzuki , Keisuke Fujii

We propose a novel, distillation-free scheme for the fault-tolerant implementation of non-Clifford gates at the logical level, thereby completing the universal gate set. Our approach exploits generalized lattice surgery to integrate two…

Quantum Physics · Physics 2025-03-26 Yifei Wang , Yingfei Gu

Entanglement distillation is an essential building block in quantum communication protocols. Here, we study the class of near-term implementable distillation protocols that use bilocal Clifford operations followed by a single round of…

Quantum Physics · Physics 2022-06-01 Sarah Jansen , Kenneth Goodenough , Sébastian de Bone , Dion Gijswijt , David Elkouss

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 low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their…

Quantum Physics · Physics 2026-05-07 Nitish Kumar Chandra , Eneet Kaur , Reza Nejabati , Kaushik P. Seshadreesan

Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most $\epsilon$ scales as $O(\log^{\gamma}(1/\epsilon))$ (Bravyi and Haah, PRA 2012).…

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

We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…

Quantum Physics · Physics 2026-01-21 Hugo Lóio , Guglielmo Lami , Lorenzo Leone , Max McGinley , Xhek Turkeshi , Jacopo De Nardis

Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of…

Quantum Physics · Physics 2024-07-08 Jens Niklas Eberhardt , Vincent Steffan