Space-Time Optimisations for Early Fault-Tolerant Quantum Computation

• URL: http://arxiv.org/abs/2511.08848v1
• Date: Thu, 13 Nov 2025 01:11:58 GMT
• Title: Space-Time Optimisations for Early Fault-Tolerant Quantum Computation
• Authors: Sanaa Sharma, Prakash Murali,
• Abstract summary: We develop compilation techniques tailored to the needs of early FTQC systems.<n>Our work offers results with an average overhead of 1.2X in execution time for a 53% reduction in qubits against the theoretical lower bounds.<n>As the industry develops early FTQC systems with tens to hundreds of logical qubits over the coming years, our work has the potential to be widely useful.
• Score: 0.30079490585515334
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerance is the future of quantum computing, ensuring error-corrected quantum computation that can be used for practical applications. Resource requirements for fault-tolerant quantum computing (FTQC) are daunting, and hence, compilation techniques must be designed to ensure resource efficiency. There is a growing need for compilation strategies tailored to the early FTQC regime, which refers to the first generation of fault-tolerant machines operating under stringent resource constraints of fewer physical qubits and limited distillation capacity. Present-day compilation techniques are largely focused on overprovisioning of routing paths and make liberal assumptions regarding the availability of distillation factories. Our work develops compilation techniques that are tailored to the needs of early FTQC systems, including distillation-adaptive qubit layouts and routing techniques. In particular, we show that simple greedy heuristics are extremely effective for this problem, offering up to 60% reduction in the number of qubits compared to prior works. Our techniques offer results with an average overhead of 1.2X in execution time for a 53% reduction in qubits against the theoretical lower bounds. As the industry develops early FTQC systems with tens to hundreds of logical qubits over the coming years, our work has the potential to be widely useful for optimising program executions.

Related papers

• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• 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)
• Quantum Circuit Optimization for the Fault-Tolerance Era: Do We Have to Start from Scratch? [4.961442902343596]
  Quantum computing has made significant advancements in the last years in both hardware and software.<n>Current Noisy Intermediate-Scale Quantum (NISQ) hardware is still heavily affected by noise.<n>This work investigates the effects of different optimization passes on a representative selection of quantum circuits.
  arXiv  Detail & Related papers  (2025-09-02T18:00:00Z)
• End-to-End On-Device Quantization-Aware Training for LLMs at Inference Cost [53.25965863436039]
  Quantization-aware training (QAT) provides a more principled solution, but its reliance on backpropagation incurs prohibitive memory costs.<n>We propose ZeroQAT, a zeroth-order optimization-based QAT framework that supports both weight and activation quantization.<n>Experiments show that ZeroQAT consistently outperforms representative PTQ and QAT baselines while requiring significantly less memory.
  arXiv  Detail & Related papers  (2025-08-21T01:18:27Z)
• Variational Quantum Algorithms in the era of Early Fault Tolerance [2.7899834802862284]
  Quantum computing roadmaps predict the availability of 10,000 qubit devices within the next 3-5 years.<n>We introduce partial error correction (pQEC), a strategy that error-corrects Clifford operations while performing Rz rotations via magic state injection.<n>Our results show that pQEC can improve VQA fidelities by 9.27x over standard approaches.
  arXiv  Detail & Related papers  (2025-03-26T20:06:32Z)
• 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)
• Assessing the Requirements for Industry Relevant Quantum Computation [1.1687566782940522]
  We use open-source tools to assess the requirements for industry-relevant quantum computation. We base our figures of merit on current technology, as well as theoretical high-fidelity scenarios for superconducting qubit platforms. We find that the execution time of gate and measurement operations determines the overall computational runtime more strongly than the system error rates.
  arXiv  Detail & Related papers  (2024-08-05T16:00:49Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Modeling the Performance of Early Fault-Tolerant Quantum Algorithms [2.9263797260822835]
  We propose a methodology for modeling algorithm performance on EFTQC devices under varying degrees of error. We investigate the runtime performance and the fault-tolerant overhead of an EFTQC algorithm for phase estimation. Our analysis reveals that RFE achieves significant savings in physical qubit counts while having a much higher runtime upper bound.
  arXiv  Detail & Related papers  (2023-06-29T18:03:15Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)

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.