Related papers: Fault-tolerant gates via homological product codes
We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes for error correction. Color codes have a set of transversal…
Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons…
In fault-tolerant quantum computing with the surface code, non-Clifford gates are crucial for universal computation. However, implementing these gates using methods like magic state distillation and code switching requires significant…
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…
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the…
Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant…
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…
The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which…
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate…
A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect of noise on circuits. In this work, we propose and…
In near-term quantum computing devices, connectivity between qubits remain limited by architectural constraints. A computational circuit with given connectivity requirements necessary for multi-qubit gates have to be embedded within…
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…
To solve classically hard problems, quantum computers need to be resilient to the influence of noise and decoherence. In such a fault-tolerant quantum computer, noise-induced errors must be detected and corrected in real-time to prevent…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…
An important approach to the fault-tolerant quantum computation is protecting the logical information using the quantum error correction. Usually, the logical information is in the form of logical qubits, which are encoded in physical…
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…
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…
We consider an approach to fault tolerant quantum computing based on a simple error detecting code operating as the substrate for a conventional surface code. We develop a customised decoder to process the information about the likely…
Quantum holonomic gates hold built-in resilience to local noises and provide a promising approach for implementing fault-tolerant quantum computation. We propose to realize high-fidelity holonomic $(N+1)$-qubit controlled gates using…