English
Related papers

Related papers: Magic teleportation with generalized lattice surge…

200 papers

The surface code family is a promising approach to implementing fault-tolerant quantum computations. Universal fault-tolerance requires error-corrected non-Clifford operations, in addition to Clifford gates, and for the former, it is…

Quantum Physics · Physics 2026-04-06 Younghun Kim , Martin Sevior , Muhammad Usman

Magic states are a foundational resource for universal quantum computation. To survive in a realistic noisy environment, magic states must be prepared fault-tolerantly and protected by a quantum error-correcting code. The recent discovery…

Quantum Physics · Physics 2026-02-02 Dominic J. Williamson

Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier…

Quantum Physics · Physics 2026-03-05 Heather Leitch , Yingkai Ouyang

To achieve scalable universal quantum computing, we need to implement a universal set of logical gates fault-tolerantly, for which the main difficulty lies with non-Clifford gates. We demonstrate that several characteristic features of the…

Quantum Physics · Physics 2025-02-04 Yi-Fei Wang , Yixu Wang , Yu-An Chen , Wenjun Zhang , Tao Zhang , Jiazhong Hu , Wenlan Chen , Yingfei Gu , Zi-Wen Liu

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…

We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits…

Quantum Physics · Physics 2014-07-22 Andrew J. Landahl , Ciaran Ryan-Anderson

One of the leading quantum computing architectures is based on the two-dimensional (2D) surface code. This code has many advantageous properties such as a high error threshold and a planar layout of physical qubits where each physical qubit…

Quantum Physics · Physics 2019-12-06 Michael Vasmer , Dan E. Browne

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

Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…

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

Fault-tolerant quantum computers, with error correction implemented using topological codes, will most likely require lattice surgery protocols in order to implement a universal gate set. Timelike failures during lattice surgery protocols…

Quantum Physics · Physics 2022-10-31 Prithviraj Prabhu , Christopher Chamberland

We present a footprint study for the scaling of modular quantum error correction (QEC) protocols designed for triangular color codes, including a lattice-surgery-based logical teleportation gadget, and compare the performance of various…

A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code…

Quantum Physics · Physics 2015-04-16 Todd A. Brun , Yi-Cong Zheng , Kung-Chuan Hsu , Joshua Job , Ching-Yi Lai

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and…

Quantum Physics · Physics 2011-06-22 Salman Beigi , Peter W. Shor

As there is no quantum error correction code with universal set of transversal gates, several approaches have been proposed which, in combination of transversal gates, make universal fault-tolerant quantum computation possible. Magic state…

Quantum Physics · Physics 2021-09-07 Eesa Nikahd , Morteza Saheb Zamani , Mehdi Sedighi

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

Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally. In this work, we first introduce a decoder…

Quantum Physics · Physics 2022-03-01 Christopher Chamberland , Earl T. Campbell

Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physical errors can be detected and…

Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation rules, a quantum circuit can be transpiled into a sequence…

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