English
Related papers

Related papers: Accommodating Fabrication Defects on Floquet Codes…

200 papers

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential…

Fault-tolerant quantum computing is crucial for realizing large-scale quantum computation, and the interplay between hardware architecture and quantum error-correcting codes is a key consideration. We present a comparative study of two…

Quantum error correction is crucial for any quantum computing platform to achieve truly scalable quantum computation. The surface code and its variants have been considered the most promising quantum error correction scheme due to their…

To make practical quantum algorithms work, large-scale quantum processors protected by error-correcting codes are required to resist noise and ensure reliable computational outcomes. However, a major challenge arises from defects in…

We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. These codes have weight-two check operators, a finite encoding rate and can be decoded efficiently with minimum-weight perfect matching.…

Quantum Physics · Physics 2024-11-25 Oscar Higgott , Nikolas P. Breuckmann

Floquet codes are a recently discovered type of quantum error correction code. They can be thought of as generalising stabilizer codes and subsystem codes, by allowing the logical Pauli operators of the code to vary dynamically over time.…

Quantum Physics · Physics 2023-09-01 Alex Townsend-Teague , Julio Magdalena de la Fuente , Markus Kesselring

Spin qubits in semiconductor structures bring the promise of large-scale 2D integration, with the possibility to incorporate the control electronics on the same chip. In order to perform error correction on this platform, the characteristic…

Quantum Physics · Physics 2024-07-10 Bence Hetényi , James R. Wootton

The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into…

Quantum Physics · Physics 2025-09-30 Shouzhen Gu , Alex Retzker , Aleksander Kubica

Dynamical quantum error-correcting codes (QECC) offer wider possibilities in how one can protect logical quantum information from noise and perform fault-tolerant quantum computation compared to static QECCs. A family of dynamical QECCs…

Quantum Physics · Physics 2025-01-10 Andrew Tanggara , Mile Gu , Kishor Bharti

Fabrication errors pose a significant challenge in scaling up solid-state quantum devices to the sizes required for fault-tolerant (FT) quantum applications. To mitigate the resource overhead caused by fabrication errors, we combine two…

In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…

Quantum Physics · Physics 2015-05-13 David P. DiVincenzo

Whether it is at the fabrication stage or during the course of the quantum computation, e.g. because of high-energy events like cosmic rays, the qubits constituting an error correcting code may be rendered inoperable. Such defects may…

Quantum Physics · Physics 2023-07-26 Adam Siegel , Armands Strikis , Thomas Flatters , Simon Benjamin

We describe a method for creating twist defects in the honeycomb Floquet code of Hastings and Haah. In particular, we construct twist defects at the endpoints of condensation defects, which are built by condensing emergent fermions along…

Quantum Physics · Physics 2023-09-21 Tyler D. Ellison , Joseph Sullivan , Arpit Dua

Quantum computing offers significant speedups, but the large number of physical qubits required for quantum error correction introduces engineering challenges for a monolithic architecture. One solution is to distribute the logical quantum…

Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, including bivariate bicycle (BB) codes, achieve dramatic…

Quantum Physics · Physics 2025-06-24 Yingli Yang , Guo Zhang , Ying Li

Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…

Quantum Physics · Physics 2026-05-13 Prithviraj Prabhu

The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical realization, such as the space overhead, the threshold, and…

Quantum Physics · Physics 2025-06-03 Satoshi Yoshida , Shiro Tamiya , Hayata Yamasaki

Modular architectures offer a scalable path toward fault-tolerant quantum computing by interconnecting smaller quantum processing units (QPUs) provided that high-rate, fault-tolerant interfaces can be realized across modules. We present a…

Quantum Physics · Physics 2026-05-05 Frederik K. Marqversen , Gefen Baranes , Maxim Sirotin , Johannes Borregaard

The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes…

Quantum Physics · Physics 2015-09-15 Fern H. E. Watson , Hussain Anwar , Dan E. Browne

We present a fault-tolerant universal quantum computing architecture based on a code concatenation of biased-noise qubits and the parity architecture. The parity architecture can be understood as an LDPC code tailored specifically to obtain…

Quantum Physics · Physics 2025-12-01 Anette Messinger , Valentin Torggler , Berend Klaver , Michael Fellner , Wolfgang Lechner
‹ Prev 1 2 3 10 Next ›