Partially Fault-Tolerant Quantum Computing Architecture with Error-Corrected Clifford Gates and Space-Time Efficient Analog Rotations

• Published in: PRX quantum Vol. 5; no. 1; p. 010337
• Main Authors: Akahoshi, Yutaro, Maruyama, Kazunori, Oshima, Hirotaka, Sato, Shintaro, Fujii, Keisuke
• Format: Journal Article
• Language: English
• Published: American Physical Society 01.03.2024
• ISSN: 2691-3399; 2691-3399
• DOI: 10.1103/PRXQuantum.5.010337

Quantum computers are expected to drastically accelerate certain computing tasks versus classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have tens to hundreds of noisy physical qubits, are gradually becoming available, but it is still challenging to achieve useful quantum advantages in meaningful tasks. On the other hand, full fault-tolerant quantum computing (FTQC) based on quantum error correction code remains far beyond realization due to its extremely large requirement of high-precision physical qubits. In this study, we propose a quantum computing architecture to close the gap between NISQ and FTQC architectures. Our architecture is based on erroneous arbitrary rotation gates and error-corrected Clifford gates implemented by lattice surgery. We omit the typical distillation protocol to achieve direct analog rotations and small qubit requirements, and minimize the remnant errors of the rotations by a carefully designed state injection protocol. Our estimation based on numerical simulations shows that for early-FTQC devices that consist of 10 4 physical qubits with physical error probability p = 10 − 4 , we can perform roughly 1.72 × 10 7 Clifford operations and 3.75 × 10 4 arbitrary rotations on 64 logical qubits. Such computations cannot be realized by the existing NISQ and FTQC architectures on the same device, as well as classical computers. We hope that our proposal and the corresponding development of quantum algorithms based on it will bring new insights into the realization of practical quantum computers in the future.