English
Related papers

Related papers: Fast magic state preparation by gauging higher-for…

200 papers

Majorana-based quantum computation in nanowires and neutral atoms has gained prominence as a promising platform to encode qubits and protect them against noise. In order to run computations reliably on such devices, a fully fault-tolerant…

Quantum Physics · Physics 2025-09-17 Maryam Mudassar , Alexander Schuckert , Daniel Gottesman

Fault-tolerant quantum computing based on surface code has emerged as an attractive candidate for practical large-scale quantum computers to achieve robust noise resistance. To achieve universality, magic states preparation is a commonly…

The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. These two codes have transversal implementations of all Clifford gates, but…

Quantum Physics · Physics 2024-04-22 Matthew Sullivan

Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional…

Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check…

Quantum Physics · Physics 2022-05-24 Lawrence Z. Cohen , Isaac H. Kim , Stephen D. Bartlett , Benjamin J. Brown

The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…

Quantum Physics · Physics 2007-05-23 Andrew M. Steane

Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource…

Quantum Physics · Physics 2024-09-06 Hayato Goto

Quantum low-density parity check (qLDPC) codes are among the leading candidates to realize error-corrected quantum memories with low qubit overhead. Potentially high encoding rates and large distance relative to their block size make them…

Quantum Physics · Physics 2025-11-14 Josias Old , Juval Bechar , Markus Müller , Sascha Heußen

We present a comprehensive architectural analysis for a proposed fault-tolerant quantum computer based on cat codes concatenated with outer quantum error-correcting codes. For the physical hardware, we propose a system of acoustic…

We introduce STAR-magic mutation, an efficient protocol for implementing logical rotation gates on early fault-tolerant quantum computers. This protocol judiciously combines two of the latest state preparation protocols: transversal…

Quantum Physics · Physics 2026-03-25 Riki Toshio , Shota Kanasugi , Jun Fujisaki , Hirotaka Oshima , Shintaro Sato , Keisuke Fujii

High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for…

Quantum Physics · Physics 2025-09-22 Naoyuki Kanomata , Hayato Goto

Quantum error correction is necessary to perform large-scale quantum computation, but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit…

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

Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state…

Quantum Physics · Physics 2017-10-04 Eesa Nikahd , Mehdi Sedighi , Morteza Saheb Zamani

We show how to perform a fault-tolerant universal quantum computation in 2D architectures using only transversal unitary operators and local syndrome measurements. Our approach is based on a doubled version of the 2D color code. It enables…

Quantum Physics · Physics 2015-09-11 Sergey Bravyi , Andrew Cross

Continuous-variable cluster states allow for fault-tolerant measurement-based quantum computing when used in tandem with the Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode. For quad-rail-lattice macronode cluster…

Quantum Physics · Physics 2022-01-05 Blayney W. Walshe , Rafael N. Alexander , Nicolas C. Menicucci , Ben Q. Baragiola

Quantum low-density parity-check (qLDPC) codes can encode many logical qubits within a single code block at low physical qubit overhead, yet magic state injection into such codes remains largely underexplored. Existing state injection…

Quantum Physics · Physics 2026-04-08 Kun Liu , Shifan Xu , Tomas Jochym-O'Connor , Zhiyang He , Shraddha Singh , Yongshan Ding

We investigate a scheme of fault-tolerant quantum computation based on the cluster model. Logical qubits are encoded by a suitable code such as the Steane's 7-qubit code. Cluster states of logical qubits are prepared by post-selection…

Quantum Physics · Physics 2007-05-23 Keisuke Fujii , Katsuji Yamamoto

Magic state distillation (MSD) is an essential element for universal fault-tolerant quantum computing, which distills a high-fidelity magic state from noisy magic states using ideal (error-corrected) Clifford operations. For ideal Clifford…

Quantum Physics · Physics 2025-06-23 Tomohiro Itogawa , Yugo Takada , Yutaka Hirano , Keisuke Fujii

We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade-offs between the number of physical qubits and the fault-tolerant execution time of a…