Parallelizing Program Execution on Distributed Quantum Systems via Compiler/Hardware Co-Design

• URL: http://arxiv.org/abs/2511.14306v1
• Date: Tue, 18 Nov 2025 10:05:20 GMT
• Title: Parallelizing Program Execution on Distributed Quantum Systems via Compiler/Hardware Co-Design
• Authors: Folkert de Ronde, Alexander Knapen, Stephan Wong, Sebastian Feld,
• Abstract summary: This paper introduces a novel approach to enhance the execution of quantum algorithms on distributed quantum systems.<n>The proposed method involves the development of a hardware design that supports parallel instruction execution and a compiler that modifies the order of instructions to increase parallelism opportunities.<n>The results demonstrate a significant speedup, achieving a maximum average speedup of 16.5x and a maximum single-benchmark speedup of 56.2x relative to a baseline, serial execution model.
• Score: 39.81714981855818
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As quantum computers continue to improve and support larger, more complex computations, smart control hardware and compilers are needed to efficiently leverage the capabilities of these systems. This paper introduces a novel approach to enhance the execution of quantum algorithms on distributed quantum systems. The proposed method involves the development of a hardware design that supports parallel instruction execution and a compiler that modifies the order of instructions to increase parallelism opportunities. The hardware design can be flexibly configured to facilitate parallel execution of instructions that have identical parameters. Furthermore, the compiler uses the underlying hardware constraints to intelligently reorder and decompose instructions to avoid dependencies. The compiler, hardware, and their combination are evaluated using a runtime calculator and a benchmark quantum algorithm set. The results demonstrate a significant speedup, achieving a maximum average speedup of 16.5x and a maximum single-benchmark speedup of 56.2x relative to a baseline, serial execution model. Furthermore, we show a speedup can be obtained across all benchmarks using any of the proposed hardware schemes, although the degree of speedup is largely dependent on the type of quantum algorithm. Taken together, the results of this paper represent a significant step towards realizing high-performance quantum computing systems.

Related papers

• Scalable parallel simulation of quantum circuits on CPU and GPU systems [9.62558654513992]
  We present a comprehensive parallelization solution for the Q$2$Chemistry software package.<n>Our optimizations significantly enhance the simulation speed compared to unoptimized baselines.<n>These benchmarks highlight the capability of Q$2$Chemistry to effectively handle large-scale quantum simulations.
  arXiv  Detail & Related papers  (2025-09-05T09:20:11Z)
• Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation [0.0]
  This work provides an implementation of Shor's factoring algorithm, compiled to elementary quantum gates using PennyLane and Catalyst.<n>We demonstrate that with QJIT compilation, the algorithm is compiled once per bit width of $N$, even when $N$-specific optimizations are applied to circuit generation.<n>The implementation is benchmarked up to 32-bit $N$, and both the size of the compiled program and the pure compilation time are found to be constant.
  arXiv  Detail & Related papers  (2025-04-16T19:30:10Z)
• Design of an FPGA-Based Neutral Atom Rearrangement Accelerator for Quantum Computing [1.003635085077511]
  Neutral atoms have emerged as a promising technology for implementing quantum computers. We propose a novel quadrant-based rearrangement algorithm that employs a divide-and-conquer strategy and also enables the simultaneous movement of multiple atoms. This is the first hardware acceleration work for atom rearrangement, and it significantly reduces the processing time.
  arXiv  Detail & Related papers  (2024-11-19T10:38:21Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Compiler Optimization for Quantum Computing Using Reinforcement Learning [3.610459670994051]
  We propose a reinforcement learning framework for developing optimized quantum circuit compilation flows. The proposed framework is set up with a selection of compilation passes from IBM's Qiskit and Quantinuum's TKET. It significantly outperforms both individual compilers in 73% of cases regarding the expected fidelity.
  arXiv  Detail & Related papers  (2022-12-08T19:00:01Z)
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers [0.0]
  Open-source software package, Arline Benchmarks, is designed to perform automated benchmarking of quantum compilers. We compare several quantum compilation frameworks based on a set of important metrics. We propose a concept of composite compilation pipeline that combines compiler-specific circuit optimizations in a single compilation stack.
  arXiv  Detail & Related papers  (2022-02-28T18:48:01Z)
• Enabling Retargetable Optimizing Compilers for Quantum Accelerators via a Multi-Level Intermediate Representation [78.8942067357231]
  We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work results in compile times that are 1000x faster than standard Pythonic approaches, and 5-10x faster than comparative standalone quantum language compilers.
  arXiv  Detail & Related papers  (2021-09-01T17:29:47Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)

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.