English
Related papers

Related papers: Transversal Gates for Highly Asymmetric qLDPC Code…

200 papers

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…

Quantum Physics · Physics 2007-05-23 P. Oscar Boykin , Tal Mor , Matthew Pulver , Vwani Roychowdhury , Farrokh Vatan

In recent years qubit designs such as transmons approached the fidelities of up to 0.999. However, even these devices are still insufficient for realizing quantum error correction requiring better than 0.9999 fidelity. Topologically…

Quantum Physics · Physics 2021-10-13 Andrey R. Klots , Lev B. Ioffe

Quantum error correction (QEC) is considered a deciding component in enabling practical quantum computing. Stabilizer codes, and in particular topological surface codes, are promising candidates for implementing QEC by redundantly encoding…

Quantum Physics · Physics 2025-12-12 Josias Old , Stephan Tasler , Michael J. Hartmann , Markus Müller

In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an…

Quantum Physics · Physics 2021-08-20 Narayanan Rengaswamy , Robert Calderbank , Michael Newman , Henry D. Pfister

Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom…

It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…

Information Theory · Computer Science 2009-08-15 Salah A. Aly

Conventional approaches to fault-tolerant quantum computing realize logical circuits gate-by-gate, synthesizing each gate independently on one or more code blocks. This incurs excess overhead and doesn't leverage common structures in…

Quantum Physics · Physics 2026-02-02 Zhuangzhuang Chen , Jack Owen Weinberg , Narayanan Rengaswamy

As quantum circuits become more integrated and complex, additional error sources that were previously insignificant start to emerge. Consequently, the fidelity of quantum gates benchmarked under pristine conditions falls short of predicting…

Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can…

Quantum Physics · Physics 2013-05-29 Andrew M. Steane , Ben Ibinson

We present an architecture for early fault-tolerant quantum computers based on the smallest interesting colour code (Earl Campbell, 2016). It realizes a universal logical gate set consisting of single-qubit measurements and preparations in…

Quantum Physics · Physics 2025-07-29 Jacob S. Nelson , Andrew J. Landahl , Andrew D. Baczewski

Quantum error correction codes with non-local connections such as quantum low-density parity-check (qLDPC) incur lower overhead and outperform surface codes on large-scale devices. These codes are not applicable on current superconducting…

Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we…

Quantum Physics · Physics 2019-03-01 Robin Harper , Steven T. Flammia

Developing quantum computers for real-world applications requires understanding theoretical sources of quantum advantage and applying those insights to design more powerful machines. Toward that end, we introduce a high-fidelity gate set…

Quantum Physics · Physics 2021-08-04 Alexander D. Hill , Mark J. Hodson , Nicolas Didier , Matthew J. Reagor

Because of their long coherence time and compatibility with industrial foundry processes, electron spin qubits are a promising platform for scalable quantum processors. A full-fledged quantum computer will need quantum error correction,…

In many physical systems it is expected that environmental decoherence will exhibit an asymmetry between dephasing and relaxation that may result in qubits experiencing discrete phase errors more frequently than discrete bit errors. In the…

Quantum Physics · Physics 2009-11-13 A. M. Stephens , Z. W. E. Evans , S. J. Devitt , L. C. L. Hollenberg

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes.…

We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal…

Quantum Physics · Physics 2024-06-19 Nikolas P. Breuckmann , Simon Burton

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

Quantum error-correcting codes with asymptotically lower overheads than the surface code require nonlocal connectivity. Leveraging multilayer routing and long-range coupling capabilities in superconducting qubit hardware, we develop…

Topological color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Neither a two-dimensional nor a three-dimensional topology, however, can provide a universal gate set $\{$H, T, CNOT$\}$, with the…

Quantum Physics · Physics 2024-06-26 Friederike Butt , Sascha Heußen , Manuel Rispler , Markus Müller