Related papers: Low-overhead Magic State Circuits with Transversal…
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…
For planar architectures surface code-based quantum error correction is one of the most promising approaches to fault-tolerant quantum computation. This is partially due to the variety of fault-tolerant logical protocols that can be…
The scarcity of qubits is a major obstacle to the practical usage of quantum computers in the near future. To circumvent this problem, various circuit knitting techniques have been developed to partition large quantum circuits into…
Fault-tolerant quantum computing hinges on efficient logical compilation, in particular, translating high-level circuits into code-compatible implementations. Gate-by-gate compilation often yields deep circuits, requiring significant…
We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This…
Current, near-term quantum devices have shown great progress in recent years culminating with a demonstration of quantum supremacy. In the medium-term, however, quantum machines will need to transition to greater reliability through error…
We present a universal scheme of pulsed operations for the IBM oscillator-stabilized flux qubit comprising the CPHASE gate, single-qubit preparations and measurements. Based on numerical simulations, we argue that the error rates for these…
While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qubits is one such constraint that restricts two-qubit…
Fault tolerance is widely regarded as indispensable for achieving scalable and reliable quantum computing. However, the spacetime overhead required for fault-tolerant quantum computating remains prohibitively large. A critical challenge…
Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study focuses on the addressability problem within CSS codes: what circuits…
A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can…
Quantum algorithms for quantum chemistry map the dynamics of electrons in a molecule to the dynamics of a coupled spin system. To reach chemical accuracy for interesting molecules, a large number of quantum gates must be applied which…
We give a general method of construting quantum circuit for random \QTR{it}{satisfiability} (SAT) problems with the basic logic gates such as multi-qubit controlled-NOT and NOT gates. The sizes of these circuits are almost the same as the…
Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block.…
Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an…
The realization of large-scale quantum computers requires not only quantum error correction (QEC) but also fault-tolerant operations to handle errors that propagate into harmful errors. Recently, flag-based protocols have been introduced…
Fault-tolerant quantum error correction is a necessity for any quantum architecture destined to tackle interesting, large-scale problems. Its theoretical formalism has been well founded for nearly two decades. However, we still do not have…
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes,…
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…
Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice. Yet designing codes that support useful transversal operations -- especially non-Clifford or addressable gates -- remains…