Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2412.07181 · Proceedings of the ACM on Measurement and Analysis of Computing Systems

Modeling and Simulating Rydberg Atom Quantum Computers for Hardware-Software Co-design with PachinQo

Jason Ludmir, Yuqian Huo, Nicholas S. DiBrita, Tirthak Patel

Published Dec 10, 2024• 6 citations
arXivHTMLPDF

Abstract

Quantum computing has the potential to accelerate various domains: scientific computation, machine learning, and optimization. Recently, Rydberg atom quantum computing has emerged as a promising quantum computing technology, especially with the demonstration of the zonal addressing architecture. However, this demonstration is only compatible with one type of quantum algorithm, and extending it to compile and execute general quantum algorithms is a challenge. To address it, we propose PachinQo, a framework to co-design the architecture and compilation for zonal addressing systems for any given quantum algorithm. PachinQo's evaluation demonstrates its ability to improve a quantum algorithm's estimated probability of success by 45% on average in error-prone quantum environments.

DOI
10.1145/3700421

Related papers

Modeling and Simulating Rydberg Atom Quantum Computers for Hardware-Software Co-design with PachinQo

Jason Ludmir, Yuqian Huo, Nicholas S. DiBrita +1 more

Quantum computing has the potential to accelerate various domains: scientific computation, machine learning, and optimization. Recently, Rydberg atom quantum computing has emerged as a promising quantum computing technology, especially with the demonstration of the zonal addressing architecture. However, this demonstration is only compatible with one type of quantum algorithm, and extending it to compile and execute general quantum algorithms is a challenge. To address it, we propose PachinQo, a framework to co-design the architecture and compilation for zonal addressing systems for any given quantum algorithm. PachinQo's evaluation demonstrates its ability to improve a quantum algorithm's estimated probability of success by 45% on average in error-prone quantum environments.

ACM SIGMETRICS Performance Evaluation Review•Jun 16, 2025•0 citations

Adaptive Hardware-Software Co-Design for Quantum Computing

Jincheng Zhang

Quantum computing promises revolutionary advancements across various fields, but its practical realization hinges on overcoming significant challenges in algorithm execution. Traditional hardware-software co-design approaches for quantum computing often rely on pre-defined architectures and compilation strategies, which can be suboptimal for diverse quantum algorithms. This paper proposes an adaptive hardware-software co-design framework that dynamically adjusts the quantum computing system's configuration – encompassing both hardware architecture and software compilation – in response to the specific requirements of the algorithm being executed. The core claim is that optimized co-design is pivotal for efficient quantum algorithm execution. This framework leverages a dynamic optimization loop, continuously monitoring algorithm performance and adjusting parameters such as qubit connectivity, gate set selection, and compilation strategies. The system utilizes a mathematical model to represent the algorithm's computational demands and hardware capabilities, enabling real-time adaptation. This approach moves beyond static design methodologies, offering a pathway towards significantly improved performance and resource utilization in quantum computing systems. The framework's ability to adapt in real-time represents a crucial step towards unlocking the full potential of quantum algorithms.

•Sep 5, 2026•0 citations

Modeling and Simulating Rydberg Atom Quantum Computers for Hardware-Software Co-design with PachinQo

Jason Ludmir, Yuqian Huo, Nicholas S. DiBrita +1 more

ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)•Jun 4, 2025•0 citations

On the Co-Design of Quantum Software and Hardware

Gushu Li, Anbang Wu, Yunong Shi +3 more

A quantum computing system naturally consists of two components, the software system and the hardware system. Quantum applications are programmed using the quantum software and then executed on the quantum hardware. However, the performance of existing quantum computing system is still limited. Solving a practical problem that is beyond the capability of classical computers on a quantum computer has not yet been demonstrated. In this review, we point out that the quantum software and hardware systems should be designed collaboratively to fully exploit the potential of quantum computing. We first review three related works, including one hardware-aware quantum compiler optimization, one application-aware quantum hardware architecture design flow, and one co-design approach for the emerging quantum computational chemistry. Then we discuss some potential future directions following the co-design principle.

ACM International Conference on Nanoscale Computing and Communication (NANOCOM)•Sep 7, 2021•46 citations

Invited: Building Robust Quantum System Software for Technology-Specific Characteristics

Tirthak Patel, Devesh Tiwari

This paper discusses the various technologies used for quantum computing and highlights the need for compiler and software stack solutions that are portable across different technologies (beyond superconducting qubit quantum computers) while providing a higher-level interface that allows scientists to run their programs in a technology-agnostic manner. To achieve this, quantum compilers and architecture designs must not be bound by classical-style standards and specifications. As a first step toward tackling this challenge, this paper then focuses on developing a compiler solution for neutral atom quantum computing technology, which has several potential benefits over superconducting qubit quantum computing technology.These benefits include a greater connectivity of qubits within the Rydberg interaction radius, which allows for fewer SWAP operations, and the ability to execute multi-qubit gates directly. However, neutral atom quantum computers have a different set of constraints and requirements, including interaction blockades, which can result in potential serialization of operations, reducing some of the gains due to the better connectivity of neutral atom quantum computers. The paper then concludes by stating that addressing these challenges requires further research and development in the field.

ACM/IEEE Design Automation Conference (DAC)•Jul 9, 2023•0 citations

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

Folkert de Ronde, Alexander Knapen, Stephan Wong +1 more

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.

quant-pharXiv:2511.14306•Physica Scripta•Nov 19, 2025•0 citations
Quantum computing has the potential to accelerate various domains: scientific computation, machine learning, and optimization. Recently, Rydberg atom quantum computing has emerged as a promising quantum computing technology, especially with the demonstration of the zonal addressing architecture. However, this demonstration is only compatible with one type of quantum algorithm, and extending it to compile and execute general quantum algorithms is a challenge. To address it, we propose PachinQo, a framework to co-design the architecture and compilation for zonal addressing systems for any given quantum algorithm. PachinQo's evaluation demonstrates its ability to improve a quantum algorithm's estimated probability of success by 45% on average in error-prone quantum environments.
Quantum computing has the potential to accelerate various domains: scientific computation, machine learning, and optimization. Recently, Rydberg atom quantum computing has emerged as a promising quantum computing technology, especially with the demonstration of the zonal addressing architecture. However, this demonstration is only compatible with one type of quantum algorithm, and extending it to compile and execute general quantum algorithms is a challenge. To address it, we propose PachinQo, a framework to co-design the architecture and compilation for zonal addressing systems for any given quantum algorithm. PachinQo's evaluation demonstrates its ability to improve a quantum algorithm's estimated probability of success by 45% on average in error-prone quantum environments.
Quantum computing promises revolutionary advancements across various fields, but its practical realization hinges on overcoming significant challenges in algorithm execution. Traditional hardware-software co-design approaches for quantum computing often rely on pre-defined architectures and compilation strategies, which can be suboptimal for diverse quantum algorithms. This paper proposes an adaptive hardware-software co-design framework that dynamically adjusts the quantum computing system's configuration – encompassing both hardware architecture and software compilation – in response to the specific requirements of the algorithm being executed. The core claim is that optimized co-design is pivotal for efficient quantum algorithm execution. This framework leverages a dynamic optimization loop, continuously monitoring algorithm performance and adjusting parameters such as qubit connectivity, gate set selection, and compilation strategies. The system utilizes a mathematical model to represent the algorithm's computational demands and hardware capabilities, enabling real-time adaptation. This approach moves beyond static design methodologies, offering a pathway towards significantly improved performance and resource utilization in quantum computing systems. The framework's ability to adapt in real-time represents a crucial step towards unlocking the full potential of quantum algorithms.
A quantum computing system naturally consists of two components, the software system and the hardware system. Quantum applications are programmed using the quantum software and then executed on the quantum hardware. However, the performance of existing quantum computing system is still limited. Solving a practical problem that is beyond the capability of classical computers on a quantum computer has not yet been demonstrated. In this review, we point out that the quantum software and hardware systems should be designed collaboratively to fully exploit the potential of quantum computing. We first review three related works, including one hardware-aware quantum compiler optimization, one application-aware quantum hardware architecture design flow, and one co-design approach for the emerging quantum computational chemistry. Then we discuss some potential future directions following the co-design principle.
This paper discusses the various technologies used for quantum computing and highlights the need for compiler and software stack solutions that are portable across different technologies (beyond superconducting qubit quantum computers) while providing a higher-level interface that allows scientists to run their programs in a technology-agnostic manner. To achieve this, quantum compilers and architecture designs must not be bound by classical-style standards and specifications. As a first step toward tackling this challenge, this paper then focuses on developing a compiler solution for neutral atom quantum computing technology, which has several potential benefits over superconducting qubit quantum computing technology.These benefits include a greater connectivity of qubits within the Rydberg interaction radius, which allows for fewer SWAP operations, and the ability to execute multi-qubit gates directly. However, neutral atom quantum computers have a different set of constraints and requirements, including interaction blockades, which can result in potential serialization of operations, reducing some of the gains due to the better connectivity of neutral atom quantum computers. The paper then concludes by stating that addressing these challenges requires further research and development in the field.
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.