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.13805 · Proceedings of the AAAI Conference on Artificial Intelligence

AI-Powered Algorithm-Centric Quantum Processor Topology Design

Tian Li, Xiao-Yue Xu, Chen Ding, Tian-Ci Tian, Wei-You Liao, Shuo Zhang, He-Liang Huang

Published Apr 11, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum processor. The qubits' arrangement, or topology, is pivotal to the circuit's performance, a factor that often defies traditional heuristic or manual optimization methods due to its complexity. In this study, we introduce a novel approach leveraging reinforcement learning to dynamically tailor qubit topologies to the unique specifications of individual quantum circuits, guiding algorithm-driven quantum processor topology design for reducing the depth of mapped circuit, which is particularly critical for the output accuracy on noisy quantum processors. Our method marks a significant departure from previous methods that have been constrained to mapping circuits onto a fixed processor topology. Experiments demonstrate that we have achieved notable enhancements in circuit performance, with a minimum of 20% reduction in circuit depth in 60% of the cases examined, and a maximum enhancement of up to 46%. Furthermore, the pronounced benefits of our approach in reducing circuit depth become increasingly evident as the scale of the quantum circuits increases, exhibiting the scalability of our method in terms of problem size. This work advances the co-design of quantum processor architecture and algorithm mapping, offering a promising avenue for future research and development in the field.

DOI
10.1609/aaai.v39i1.32023

Related papers

Dynamic Topology for Quantum Algorithm Integration

Jincheng Zhang

The field of quantum algorithm integration has witnessed significant advancements, striving to enhance the efficiency and precision of quantum computations. This paper introduces a novel dynamic topology approach to quantum algorithm integration, aiming to optimize the execution of quantum algorithms through intelligent and adaptive topology adjustments. We propose a method that dynamically adjusts the quantum algorithm's topology, leveraging quantum state learning to achieve superior performance. The core mechanism focuses on optimizing the interplay between quantum state evolution and algorithm structure, resulting in improved accuracy and reduced computational complexity. This approach offers a departure from traditional static integration methods, capitalizing on the inherent potential of quantum mechanics. This research delves into the design and implementation of this dynamic topology framework, examining its impact on various quantum algorithms and providing a foundation for future advancements in this area.

•Aug 29, 2026•0 citations

Dynamic Topological Adaptive Quantum Computing Architecture

Jincheng Zhang

This paper proposes a novel quantum computing architecture centered around dynamic topological adaptation, leveraging real-time monitoring of entanglement strength and coherence times within qubits alongside machine learning algorithms to optimize quantum circuit topology. The core claim is that by continuously assessing qubit characteristics and employing reinforcement learning, the architecture can dynamically adjust the quantum circuit's topology, significantly enhancing computational efficiency and resilience to errors. The proposed system utilizes a distributed quantum processor with individual qubits equipped with sensors to measure their quantum properties. Data from these sensors is transmitted in real-time to a machine learning model, trained using reinforcement learning, which learns to optimize qubit connections and prioritize coherence times. This adaptive approach overcomes the limitations of static quantum circuit design and offers a pathway toward truly self-optimizing quantum computation. The system's ability to respond to the physical state of qubits and adapt the circuit topology based on task requirements promises substantial improvements in quantum computing performance.

•Sep 1, 2026•0 citations

Using Topology-Aware Reinforcement Learning to Synthesize Quantum Linear Reversible Circuits

Giovanni Acampora, Allegra Cuzzocrea, Marco Lapegna +2 more

In the Noisy Intermediate-Scale Quantum (NISQ) era, efficient quantum circuit synthesis is essential for optimizing limited qubit resources and mitigating noise effects. Quantum Linear Reversible Circuits (QLRCs) are a fundamental class of circuits with applications in quantum compilation or quantum error correction. They are composed exclusively of CX and SWAP gates, which are among the noisiest operations on current quantum hardware. Therefore, their efficient synthesis is pivotal for executing QLRCs on NISQ processors, which have restricted connectivity between qubits. In this direction, we introduce a Reinforcement Learning (RL)-based synthesis approach using Proximal Policy Optimization (PPO) to synthesize QLRCs on generic topologies of up to five qubits. This work extends previous work that did not handle different topologies of quantum processors. Our method dynamically adapts to hardware constraints, learning optimal or near-optimal gate decompositions. We compare our approach against Qiskit’s synthesis methods for QLRCs, demonstrating that our RL-based synthesizer consistently achieves lower CX gate depth. These results highlight the potential of RL-driven quantum circuit synthesis as a powerful alternative to traditional heuristic-based techniques, paving the way for more efficient AI-based quantum compilation strategies in the NISQ era.

International Joint Conference on Neural Networks (IJCNN)•Jun 30, 2025•0 citations

Core Claim: A novel self-adaptive topology-based quantum algorithm design method, designed to optimize quantum algorithm efficiency and accuracy, utilizing the unique properties of self-adaptive topology.

Jincheng Zhang

Quantum computation offers the potential for exponentially faster computation compared to classical computation, but its practical implementation faces significant challenges related to algorithm design and optimization. This paper explores the application of self-adaptive topology to quantum algorithm design, proposing a new approach that dynamically adjusts the topology of quantum circuits to enhance performance. We present a method for constructing quantum circuits that leverages the inherent properties of self-adaptive topology to achieve improved efficiency and accuracy. The core mechanism involves the iterative refinement of a topological structure based on feedback from quantum measurements, allowing the algorithm to adapt to the specific characteristics of the input quantum system. This paper details the design of an algorithm, including the mathematical formulation of the adaptive topology, and provides a preliminary analysis of its performance compared to traditional approaches. The research aims to contribute to the development of more efficient and robust quantum algorithms through the application of self-adaptive topology, opening avenues for advancements in quantum information processing. The investigation will focus on a specific example of a quantum algorithm, highlighting the benefits of the proposed approach.

•Sep 5, 2026•0 citations

Dynamic Topology for Quantum Circuit Optimization

Jincheng Zhang

Quantum computation leverages the unique properties of quantum mechanics, offering the potential for unparalleled computational power. However, the design and optimization of quantum circuits pose significant challenges, particularly in terms of circuit complexity and performance. This paper introduces a novel dynamic topology optimization algorithm for quantum circuits, aiming to enhance efficiency and scalability. We propose a method that dynamically adjusts the topology of a quantum circuit, enabling the algorithm to explore a wider range of potential solutions and potentially discover more optimal circuit designs. This approach contrasts with traditional methods, which often rely on static parameter tuning. The proposed algorithm demonstrates improved performance through a series of experiments, showcasing its effectiveness in optimizing quantum circuit parameters. This work provides a new perspective on quantum circuit optimization, emphasizing the role of dynamic topology in achieving improved efficiency.

•Sep 5, 2026•0 citations

Quantum Machine Learning Architecture Search via Deep Reinforcement Learning

Xin Dai, Tzu-Chieh Wei, Shinjae Yoo +1 more

The rapid advancement of quantum computing (QC) and machine learning (ML) has given rise to the burgeoning field of quantum machine learning (QML), aiming to capitalize on the strengths of quantum computing to propel ML forward. Despite its promise, crafting effective QML models necessitates profound expertise to strike a delicate balance between model intricacy and feasibility on Noisy Intermediate-Scale Quantum (NISQ) devices. While complex models offer robust representation capabilities, their extensive circuit depth may impede seamless execution on extant noisy quantum platforms. In this paper, we address this quandary of QML model design by employing deep reinforcement learning to explore proficient QML model architectures tailored for designated supervised learning tasks. Specifically, our methodology involves training an RL agent to devise policies that facilitate the discovery of QML models without predetermined ansatz. Furthermore, we integrate an adaptive mechanism to dynamically adjust the learning objectives, fostering continuous improvement in the agent's learning process. Through extensive numerical simulations, we illustrate the efficacy of our approach within the realm of classification tasks. Our proposed method successfully identifies VQC architectures capable of achieving high classification accuracy while minimizing gate depth. This pioneering approach not only advances the study of AI-driven quantum circuit design but also holds significant promise for enhancing performance in the NISQ era.

arXiv:2407.20147•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•30 citations
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum processor. The qubits' arrangement, or topology, is pivotal to the circuit's performance, a factor that often defies traditional heuristic or manual optimization methods due to its complexity. In this study, we introduce a novel approach leveraging reinforcement learning to dynamically tailor qubit topologies to the unique specifications of individual quantum circuits, guiding algorithm-driven quantum processor topology design for reducing the depth of mapped circuit, which is particularly critical for the output accuracy on noisy quantum processors. Our method marks a significant departure from previous methods that have been constrained to mapping circuits onto a fixed processor topology. Experiments demonstrate that we have achieved notable enhancements in circuit performance, with a minimum of 20% reduction in circuit depth in 60% of the cases examined, and a maximum enhancement of up to 46%. Furthermore, the pronounced benefits of our approach in reducing circuit depth become increasingly evident as the scale of the quantum circuits increases, exhibiting the scalability of our method in terms of problem size. This work advances the co-design of quantum processor architecture and algorithm mapping, offering a promising avenue for future research and development in the field.
The field of quantum algorithm integration has witnessed significant advancements, striving to enhance the efficiency and precision of quantum computations. This paper introduces a novel dynamic topology approach to quantum algorithm integration, aiming to optimize the execution of quantum algorithms through intelligent and adaptive topology adjustments. We propose a method that dynamically adjusts the quantum algorithm's topology, leveraging quantum state learning to achieve superior performance. The core mechanism focuses on optimizing the interplay between quantum state evolution and algorithm structure, resulting in improved accuracy and reduced computational complexity. This approach offers a departure from traditional static integration methods, capitalizing on the inherent potential of quantum mechanics. This research delves into the design and implementation of this dynamic topology framework, examining its impact on various quantum algorithms and providing a foundation for future advancements in this area.
This paper proposes a novel quantum computing architecture centered around dynamic topological adaptation, leveraging real-time monitoring of entanglement strength and coherence times within qubits alongside machine learning algorithms to optimize quantum circuit topology. The core claim is that by continuously assessing qubit characteristics and employing reinforcement learning, the architecture can dynamically adjust the quantum circuit's topology, significantly enhancing computational efficiency and resilience to errors. The proposed system utilizes a distributed quantum processor with individual qubits equipped with sensors to measure their quantum properties. Data from these sensors is transmitted in real-time to a machine learning model, trained using reinforcement learning, which learns to optimize qubit connections and prioritize coherence times. This adaptive approach overcomes the limitations of static quantum circuit design and offers a pathway toward truly self-optimizing quantum computation. The system's ability to respond to the physical state of qubits and adapt the circuit topology based on task requirements promises substantial improvements in quantum computing performance.
In the Noisy Intermediate-Scale Quantum (NISQ) era, efficient quantum circuit synthesis is essential for optimizing limited qubit resources and mitigating noise effects. Quantum Linear Reversible Circuits (QLRCs) are a fundamental class of circuits with applications in quantum compilation or quantum error correction. They are composed exclusively of CX and SWAP gates, which are among the noisiest operations on current quantum hardware. Therefore, their efficient synthesis is pivotal for executing QLRCs on NISQ processors, which have restricted connectivity between qubits. In this direction, we introduce a Reinforcement Learning (RL)-based synthesis approach using Proximal Policy Optimization (PPO) to synthesize QLRCs on generic topologies of up to five qubits. This work extends previous work that did not handle different topologies of quantum processors. Our method dynamically adapts to hardware constraints, learning optimal or near-optimal gate decompositions. We compare our approach against Qiskit’s synthesis methods for QLRCs, demonstrating that our RL-based synthesizer consistently achieves lower CX gate depth. These results highlight the potential of RL-driven quantum circuit synthesis as a powerful alternative to traditional heuristic-based techniques, paving the way for more efficient AI-based quantum compilation strategies in the NISQ era.
Quantum computation offers the potential for exponentially faster computation compared to classical computation, but its practical implementation faces significant challenges related to algorithm design and optimization. This paper explores the application of self-adaptive topology to quantum algorithm design, proposing a new approach that dynamically adjusts the topology of quantum circuits to enhance performance. We present a method for constructing quantum circuits that leverages the inherent properties of self-adaptive topology to achieve improved efficiency and accuracy. The core mechanism involves the iterative refinement of a topological structure based on feedback from quantum measurements, allowing the algorithm to adapt to the specific characteristics of the input quantum system. This paper details the design of an algorithm, including the mathematical formulation of the adaptive topology, and provides a preliminary analysis of its performance compared to traditional approaches. The research aims to contribute to the development of more efficient and robust quantum algorithms through the application of self-adaptive topology, opening avenues for advancements in quantum information processing. The investigation will focus on a specific example of a quantum algorithm, highlighting the benefits of the proposed approach.
Quantum computation leverages the unique properties of quantum mechanics, offering the potential for unparalleled computational power. However, the design and optimization of quantum circuits pose significant challenges, particularly in terms of circuit complexity and performance. This paper introduces a novel dynamic topology optimization algorithm for quantum circuits, aiming to enhance efficiency and scalability. We propose a method that dynamically adjusts the topology of a quantum circuit, enabling the algorithm to explore a wider range of potential solutions and potentially discover more optimal circuit designs. This approach contrasts with traditional methods, which often rely on static parameter tuning. The proposed algorithm demonstrates improved performance through a series of experiments, showcasing its effectiveness in optimizing quantum circuit parameters. This work provides a new perspective on quantum circuit optimization, emphasizing the role of dynamic topology in achieving improved efficiency.
The rapid advancement of quantum computing (QC) and machine learning (ML) has given rise to the burgeoning field of quantum machine learning (QML), aiming to capitalize on the strengths of quantum computing to propel ML forward. Despite its promise, crafting effective QML models necessitates profound expertise to strike a delicate balance between model intricacy and feasibility on Noisy Intermediate-Scale Quantum (NISQ) devices. While complex models offer robust representation capabilities, their extensive circuit depth may impede seamless execution on extant noisy quantum platforms. In this paper, we address this quandary of QML model design by employing deep reinforcement learning to explore proficient QML model architectures tailored for designated supervised learning tasks. Specifically, our methodology involves training an RL agent to devise policies that facilitate the discovery of QML models without predetermined ansatz. Furthermore, we integrate an adaptive mechanism to dynamically adjust the learning objectives, fostering continuous improvement in the agent's learning process. Through extensive numerical simulations, we illustrate the efficacy of our approach within the realm of classification tasks. Our proposed method successfully identifies VQC architectures capable of achieving high classification accuracy while minimizing gate depth. This pioneering approach not only advances the study of AI-driven quantum circuit design but also holds significant promise for enhancing performance in the NISQ era.