Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations

Abstract

Quantum computers are expected to bring drastic acceleration to several computing tasks against 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 at this moment. On the other hand, the full fault-tolerant quantum computing (FTQC) based on the quantum error correction (QEC) 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. 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\times 10^7$ Clifford operations and $3.75\times 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 bring new insights on realization of practical quantum computers in future.

20 pages, 28 figures

References in corpus (16)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Quantum computational advantage using photons
• Simulated Quantum Computation of Molecular Energies
• Strong quantum computational advantage using a superconducting quantum processor
• Suppressing quantum errors by scaling a surface code logical qubit
• Hybrid quantum-classical algorithms and quantum error mitigation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Magic state distillation with low overhead
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• A magic state's fidelity can be superior to the operations that created it
• Fast estimation of outcome probabilities for quantum circuits
• Local variational quantum compilation of a large-scale Hamiltonian dynamics
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture

Cited by in corpus (27)

• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Quantum-selected configuration interaction with time-evolved state
• Solving reaction dynamics with quantum computing algorithms
• Block encoding bosons by signal processing
• C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Almost fault-tolerant quantum machine learning with drastic overhead reduction
• Practical implementation of arbitrary nonlocal controlled-unitary gate via indefinite causal order
• Fault-tolerant quantum simulation of generalized Hubbard models
• Phase estimation with partially randomized time evolution
• Space-time tradeoff in networked virtual distillation
• Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Simulation of Shor algorithm for discrete logarithm problems with comprehensive pairs of modulo p and order q
• High-fidelity initialization a logical qubit with multiple injections
• Quantum subspace verification for error correction codes
• Error-mitigated initialization of surface codes with non-Pauli stabilizers
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Q-Cluster: Quantum Error Mitigation Through Noise-Aware Unsupervised Learning
• Robust Error Accumulation Suppression for Quantum Circuits
• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• RESCQ: Realtime Scheduling for Continuous Angle Quantum Error Correction Architectures