pith. sign in

arxiv: 2412.15434 · v2 · pith:BK4K3YWHnew · submitted 2024-12-19 · 🪐 quant-ph

Transpiler-Architecture Co-Design to Curb Clifford Costs in Fault-Tolerant Quantum Computing

classification 🪐 quant-ph
keywords cliffordtacocircuitexecutionquantumarchitecturalbottleneckcircuits
0
0 comments X
read the original abstract

Quantum Error Correction (QEC) codes form the foundation of Fault-Tolerant Quantum Computing (FTQC) and predominantly use the Clifford+T gate set. Recently, Clifford operations have become the key performance bottleneck in implementing QEC. While state-of-the-art approaches like Pauli-Based Compilation (PBC) reduce Clifford overhead by transforming Clifford gates into Pauli measurements, they do so at the cost of gate-level parallelism, inflating circuit depth and execution times. To overcome these limitations, we introduce TACO, a Transpiler-Architecture Co-design framework that tackles the Clifford bottleneck through circuit and architectural optimization. TACO uses FTQC insights to guide hardware-aware Clifford gate elimination and circuit restructuring, and leverages the resulting optimized circuits to refine architectural design. TACO applies FTQC-specific transformations to aggressively reduce Clifford overhead from rotation synthesis and Toffoli decompositions, while preserving gate-level parallelism. The resulting architecture is optimized for the locality and data-movement patterns of these circuits, enabling high-throughput, resource-efficient execution. Our evaluation across diverse benchmarks shows that TACO achieves up to 21.9x (mean 4.4x) reduction in execution time compared to the state-of-the-art baseline.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture

    quant-ph 2026-04 unverdicted novelty 6.0

    Syn@fac optimization reduces estimated circuit failure probability by a factor of 9 on average across non-Clifford benchmarks for bivariate bicycle code modular FTQC architectures, with additional gains from transvect...

  2. Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage

    quant-ph 2026-04 unverdicted novelty 6.0

    A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms...

  3. O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling

    quant-ph 2026-04 unverdicted novelty 6.0

    O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.

  4. Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent

    quant-ph 2026-05 unverdicted novelty 3.0

    AL-QHD benchmarks on nonconvex test functions and ACOPF power problems show useful accuracy at fixed qubit cost but require roughly 10^8 T gates for realistic instances.