Optimizing FTQC Programs through QEC Transpiler and Architecture Codesign

• URL: http://arxiv.org/abs/2412.15434v1
• Date: Thu, 19 Dec 2024 22:33:21 GMT
• Title: Optimizing FTQC Programs through QEC Transpiler and Architecture Codesign
• Authors: Meng Wang, Chenxu Liu, Samuel Stein, Yufei Ding, Poulami Das, Prashant J. Nair, Ang Li,
• Abstract summary: This paper introduces TACO, a framework to reduce Clifford cost.<n>Through codesign, insights rooted in the FTQC architecture can inform novel circuit-level optimizations.<n> Evaluations show that TACO achieves an average 91.7% reduction in Clifford gates across diverse quantum circuits.
• Score: 21.40851546772101
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computing (FTQC) is essential for executing reliable quantum computations of meaningful scale. Widely adopted QEC codes for FTQC, such as the surface code and color codes, utilize Clifford+T gate sets, where T gates are generally considered as the primary bottleneck due to their high resource costs. Recent advances in T gate optimization have significantly reduced this overhead, making Clifford gate complexity an increasingly critical bottleneck that remains largely unaddressed in present FTQC compiler and architecture designs. To address this new bottleneck, this paper introduces TACO, a \textbf{T}ranspiler-\textbf{A}rchitecture \textbf{C}odesign \textbf{O}ptimization framework, to reduce Clifford cost. Specifically, we observe that, through codesign, insights rooted in the FTQC architecture can inform novel circuit-level optimizations for FTQC compilers. These optimizations, in turn, provide new opportunities to redesign and improve the underlying architecture. Evaluations show that TACO achieves an average 91.7% reduction in Clifford gates across diverse quantum circuits and significantly enhances gate parallelism compared to Pauli-based approaches. These improvements enable an efficient FTQC architecture that can achieve single-gate-per-cycle throughput using only $1.5n+4$ logical qubit tiles, considerably pushing forward upon previously proposed designs that require $2n+\sqrt{8n}+1$ tiles. These results highlight the benefits of bidirectional optimization through codesign. TACO will be open-source.

Related papers

• Rethinking Autoregressive Models for Lossless Image Compression via Hierarchical Parallelism and Progressive Adaptation [75.58269386927076]
  Autoregressive (AR) models are often dismissed as impractical due to prohibitive computational cost.<n>This work re-thinks this paradigm, introducing a framework built on hierarchical parallelism and progressive adaptation.<n> Experiments on diverse datasets (natural, satellite, medical) validate that our method achieves new state-of-the-art compression.
  arXiv  Detail & Related papers  (2025-11-14T06:27:58Z)
• PT$^2$-LLM: Post-Training Ternarization for Large Language Models [52.4629647715623]
  Large Language Models (LLMs) have shown impressive capabilities across diverse tasks, but their large memory and compute demands hinder deployment.<n>We propose PT$2$-LLM, a post-training ternarization framework tailored for LLMs.<n>At its core is an Asymmetric Ternary Quantizer equipped with a two-stage refinement pipeline.
  arXiv  Detail & Related papers  (2025-09-27T03:01:48Z)
• Tableau-Based Framework for Efficient Logical Quantum Compilation [15.58811254216672]
  Fault-tolerant quantum computing (FTQC) enables reliable execution of quantum algorithms.<n>FTQC architectures minimize the number of physical qubits required, saving more than half compared to other architectures.<n>We present TQC, a framework that minimizes FTQC runtime overhead without requiring additional physical qubits.
  arXiv  Detail & Related papers  (2025-09-02T18:18:46Z)
• A Lazy Resynthesis Approach for Simultaneous T Gate and Two-Qubit Gate Optimization of Quantum Circuits [33.60428512062096]
  State-of-the-art quantum circuit optimization (QCO) algorithms for T-count reduction often lead to a substantial increase in two-qubit gate count (2Q-count)<n>We propose a novel lazy resynthesis approach for modern tableau-based QCO flows that significantly mitigates the 2Q-gate surges commonly introduced during T-count optimization in Clifford+T circuits.
  arXiv  Detail & Related papers  (2025-08-06T05:21:14Z)
• Optimal Compilation Strategies for QFT Circuits in Neutral-Atom Quantum Computing [10.15254069964668]
  Neutral-atom quantum computing (NAQC) offers distinct advantages such as dynamic qubit reconfigurability, long coherence times, and high gate fidelities.<n>This paper introduces optimal compilation strategies tailored to QFT circuits and NAQC systems, addressing these challenges for both linear and grid-like architectures.
  arXiv  Detail & Related papers  (2025-06-18T03:34:03Z)
• Flexion: Adaptive In-Situ Encoding for On-Demand QEC in Ion Trap Systems [16.77947483425163]
  A key near-term goal is to build a system capable of executing millions of logical operations reliably. We propose a novel system architecture targeting MQC on trapped-ion quantum computers. We propose Flexion, a hybrid encoding scheme that uses bare qubits for 1Q gates and QEC-encoded logical qubits for 2Q gates.
  arXiv  Detail & Related papers  (2025-04-22T22:44:47Z)
• Survival of the Optimized: An Evolutionary Approach to T-depth Reduction [2.089191490381739]
  We propose a Genetic Algorithm (GA)-based approach to discover near-optimal T-gate merge patterns across circuit layers. Our framework yields an average improvement of 1.2x across varying circuit sizes and T-gate densities.
  arXiv  Detail & Related papers  (2025-04-13T00:55:18Z)
• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code [5.89889361990138]
  We propose a new ion-trap optimized architecture for the efficient execution of both gate and non-transversal operations. By differentiating the regions for gates from those for non-transversal gates and syndrome extraction, our chip layout minimizes ion shuttling and simplifies physical implementations.
  arXiv  Detail & Related papers  (2025-01-25T12:49:07Z)
• High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture [0.5779598097190628]
  We propose a high-performance and low-overhead FTQC architecture based on lattice surgery (LS) using surface code (SC) The proposed Bypass architecture is a 2.5-dimensional architecture consisting of dense and sparse qubit layers. The results show that the Bypass architecture improves the fidelity of FTQC and both a 1.73x speedup and a 17% reduction in classical/quantum hardware resources.
  arXiv  Detail & Related papers  (2024-11-26T15:27:59Z)
• ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout [6.382954852270525]
  We propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. Our approach significantly decreases compilation time, gate count, and circuit depth, improving robustness for large-scale quantum computations.
  arXiv  Detail & Related papers  (2024-10-31T12:07:46Z)
• Integrating Window-Based Correlated Decoding with Constant-Time Logical Gates for Large-Scale Quantum Computation [11.657137510701165]
  One crucial issue of fault-tolerant quantum computing is reducing the overhead of implementing gates. Recently proposed correlated decoding and algorithmic fault tolerance" achieve fast universality gates. This approach is incompatible with window-based decoding, which is a natural requirement for handling large-scale circuits.
  arXiv  Detail & Related papers  (2024-10-22T12:44:41Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Mechanistic Design and Scaling of Hybrid Architectures [114.3129802943915]
  We identify and test new hybrid architectures constructed from a variety of computational primitives. We experimentally validate the resulting architectures via an extensive compute-optimal and a new state-optimal scaling law analysis. We find MAD synthetics to correlate with compute-optimal perplexity, enabling accurate evaluation of new architectures.
  arXiv  Detail & Related papers  (2024-03-26T16:33:12Z)
• FlowNAS: Neural Architecture Search for Optical Flow Estimation [65.44079917247369]
  We propose a neural architecture search method named FlowNAS to automatically find the better encoder architecture for flow estimation task. Experimental results show that the discovered architecture with the weights inherited from the super-network achieves 4.67% F1-all error on KITTI.
  arXiv  Detail & Related papers  (2022-07-04T09:05:25Z)
• Efficient variational synthesis of quantum circuits with coherent multi-start optimization [1.3108652488669734]
  We consider the problem of synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates. A key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice.
  arXiv  Detail & Related papers  (2022-05-02T18:00:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients [75.41173109807735]
  Differentiable ARchiTecture Search (DARTS) has recently become the mainstream of neural architecture search (NAS) We tackle the hypergradient computation in DARTS based on the implicit function theorem. We show that the architecture optimisation with the proposed method, named iDARTS, is expected to converge to a stationary point.
  arXiv  Detail & Related papers  (2021-06-21T00:44:11Z)
• Towards Accurate and Compact Architectures via Neural Architecture Transformer [95.4514639013144]
  It is necessary to optimize the operations inside an architecture to improve the performance without introducing extra computational cost. We have proposed a Neural Architecture Transformer (NAT) method which casts the optimization problem into a Markov Decision Process (MDP) We propose a Neural Architecture Transformer++ (NAT++) method which further enlarges the set of candidate transitions to improve the performance of architecture optimization.
  arXiv  Detail & Related papers  (2021-02-20T09:38:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.