The Fast for the Curious: How to accelerate fault-tolerant quantum applications

• URL: http://arxiv.org/abs/2510.26078v1
• Date: Thu, 30 Oct 2025 02:27:55 GMT
• Title: The Fast for the Curious: How to accelerate fault-tolerant quantum applications
• Authors: Sam McArdle, Alexander M. Dalzell, Aleksander Kubica, Fernando G. S. L. Brandão,
• Abstract summary: 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.
• Score: 101.46859364118622
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We evaluate strategies for reducing the run time of fault-tolerant quantum computations, targeting practical utility in scientific or industrial workflows. Delivering a technology with broad impact requires scaling devices, while also maintaining acceptable run times for computations. Optimizing logical clock speed may require moving beyond current strategies, and adopting methods that trade faster run time for increased qubit counts or engineering complexity. We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times. We illustrate a selection of these topics with resource estimates for simulating the Fermi-Hubbard model.

Related papers

• Space and Time Cost of Continuous Rotations in Surface Codes [5.949578540557016]
  Clifford operations are relatively easy to implement in fault-tolerant quantum computers.<n>continuous rotation gates remain a significant bottleneck in typical quantum algorithms.<n>Several techniques have been developed to reduce the T-count or T-depth of rotations, such as Hamming weight phasing and catalyst towers.
  arXiv  Detail & Related papers  (2025-08-08T11:38:41Z)
• Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning [1.0542466736167886]
  Current quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors.<n>We introduce a simulation-based tool that supports distributed scheduling and concurrent execution of quantum jobs on networked QPUs connected via real-time classical channels.
  arXiv  Detail & Related papers  (2025-06-12T16:54:19Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems [4.485653384761728]
  We introduce an alternating design approach to minimize idle time while preserving qubit efficiency in Shor's algorithm.<n>We also demonstrate how task rearrangement enhances execution efficiency in the presence of multiple distribution channels.<n>Our findings provide a structured framework for optimizing compiled quantum circuits for Shor's algorithm.
  arXiv  Detail & Related papers  (2025-03-28T16:07:52Z)
• QuartDepth: Post-Training Quantization for Real-Time Depth Estimation on the Edge [55.75103034526652]
  We propose QuartDepth which adopts post-training quantization to quantize MDE models with hardware accelerations for ASICs.<n>Our approach involves quantizing both weights and activations to 4-bit precision, reducing the model size and computation cost.<n>We design a flexible and programmable hardware accelerator by supporting kernel fusion and customized instruction programmability.
  arXiv  Detail & Related papers  (2025-03-20T21:03:10Z)
• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures [0.8453577061453568]
  We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations.<n>We show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters.
  arXiv  Detail & Related papers  (2024-11-06T21:25:34Z)
• 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)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference [56.24109486973292]
  We study the interplay between pruning and quantization during the training of neural networks for ultra low latency applications. We find that quantization-aware pruning yields more computationally efficient models than either pruning or quantization alone for our task.
  arXiv  Detail & Related papers  (2021-02-22T19:00:05Z)
• Straggler-aware Distributed Learning: Communication Computation Latency Trade-off [56.08535873173518]
  Straggling workers can be tolerated by assigning redundant computations and coding across data and computations. In most existing schemes, each non-straggling worker transmits one message per iteration to the parameter server (PS) after completing all its computations. Imposing such a limitation results in two main drawbacks; over-computation due to inaccurate prediction of the straggling behaviour, and under-utilization due to treating workers as straggler/non-straggler.
  arXiv  Detail & Related papers  (2020-04-10T08:39:36Z)

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.