Related papers: STAR-Magic Mutation: Even More Efficient Analog Ro…
Fault-tolerant (FT) computation by using quantum error correction (QEC) is essential for realizing large-scale quantum algorithms. Devices are expected to have enough qubits to demonstrate aspects of fault tolerance in the near future.…
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…
Preparing high-fidelity logical states is a central challenge in fault-tolerant quantum computing, yet existing approaches struggle to balance control complexity against resource overhead. Here, we present a complete framework for the…
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…
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…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physical errors can be detected and…
Modern robotic systems, deployed across domains from industrial automation to domestic assistance, face a critical challenge: executing tasks with precision and adaptability in dynamic, unpredictable environments. To address this, we…
Geometric phase is a promising element to induce high-fidelity and robust quantum operations due to its built-in noise-resilience feature. Unfortunately, its practical applications are usually circumscribed by requiring complex interactions…
With the successful demonstration of transversal CNOTs in many recent experiments, it is the right moment to examine its implications on one of the most critical parts of fault-tolerant computation -- magic state preparation. Using an…
The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a…
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…
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…
One of the most promising routes towards fault-tolerant quantum computation utilizes topological quantum error correcting codes, such as the $\mathbb{Z}_2$ surface code. Logical qubits can be encoded in a variety of ways in the surface…
Quantum computers capable of solving classically intractable problems are under construction, and intermediate-scale devices are approaching completion. Current efforts to design large-scale devices require allocating immense resources to…
We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approximating them with the conventional…
We propose a novel, distillation-free scheme for the fault-tolerant implementation of non-Clifford gates at the logical level, thereby completing the universal gate set. Our approach exploits generalized lattice surgery to integrate two…
In universal fault-tolerant quantum computing, implementing logical non-Clifford gates often demands substantial spacetime resources for many error-correcting codes, including the high-threshold surface code. A critical mission for…
Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the…
In the early years of fault-tolerant quantum computing (FTQC), it is expected that the available code distance and the number of magic states will be restricted due to the limited scalability of quantum devices and the insufficient…