Pith. sign in

REVIEW 3 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.13181 v1 pith:22YLVELQ submitted 2023-03-23 quant-ph

classification quant-ph
keywords quantumcomputerscomputingphysicalqubitsrotationsarchitectureclifford
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery

    quant-ph 2026-07 accept novelty 7.5 of 10

    Cross-code lattice surgery between surface and 3D colour codes yields certified logical GHZ and |CCZ> GME plus arbitrary logical rotations on a trapped-ion processor.

  2. Realizing Error Suppression in Partially Fault-Tolerant Quantum Simulations with IBM Quantum Computers

    quant-ph 2026-07 conditional novelty 6.0 of 10

    Partially fault-tolerant [[4,2,2]] Iceberg-code simulations on ibm_boston improve local Ising observables over unencoded baselines by a few percent in 1D and over 200% in 2D at late times via Observable-Ranked Postselection.

  3. INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures

    quant-ph 2026-04 unverdicted novelty 6.0 of 10

    INJEQT reduces synthillation error by up to 22x, wall-clock time by 13x, and space-time cost by 7.2x in extractor FTQC architectures via auxiliary Rz synthesis and pre-fetching.

Pith tools