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

Multi-target quantum compilation algorithm

Le Bin Ho, Vu Tuan Hai, Nguyen Tan Viet, Jesus Urbaneja, Nguyen Vu Linh, Lan Nguyen Tran

Published Aug 6, 2024• 1 citation
Publisher

Abstract

Abstract In quantum computing, quantum compilation transforms a target unitary into a trainable unitary represented by a quantum circuit. Traditional quantum compilation optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets. To address this, we developed a multi-target quantum compilation algorithm to enhance the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the algorithm’s effectiveness, highlighting the significance of multi-target optimization in advancing quantum computing. This work establishes the foundation for further development and evaluation of multi-target quantum compilation algorithms.

DOI
10.21203/rs.3.rs-4678149/v1

Related papers

Multi-target quantum compilation algorithm

Vu Tuan Hai, Nguyen Tan Viet, Jesus Urbaneja +3 more

Abstract Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum state preparation, and quantum dynamic simulation. Traditional quantum compilation usually optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets, such as thermal state preparation, time-dependent dynamic simulation, and others. To address this, we develop a multi-target quantum compilation algorithm to improve the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the effectiveness of the algorithm, highlighting the importance of multi-target optimization in advancing quantum computing. This work lays the groundwork for further development and evaluation of multi-target quantum compilation algorithms.

arXiv:2407.01010•Machine Learning Science and Technology•Nov 25, 2024•2 citations

Quantum Computing Program Compilation and Optimization Theory

Jincheng Zhang

This paper presents a novel theory for quantum computing program compilation and optimization. The core of this theory lies in translating high-level quantum programs into efficient quantum circuit implementations. This is achieved through the utilization of an abstract syntax tree (AST) derived from the quantum program. A compilation algorithm is designed to traverse the AST and generate corresponding quantum circuits, incorporating optimization strategies throughout the process. The work addresses a significant challenge within quantum computing – the complexity of program compilation – and proposes a new theoretical framework to facilitate the development of more practical and performant quantum algorithms. The theoretical framework outlined here provides a foundation for future research and development in quantum compiler design.

•Aug 29, 2026•0 citations

Adaptive Quantum Circuit Compilation based on Quantum Coherence Analysis

Jincheng Zhang

Quantum circuit compilation is a crucial step in transforming a high-level quantum algorithm description into a sequence of gates executable on a specific quantum hardware platform. Traditional compilation methods predominantly focus on minimizing gate count and circuit depth, often overlooking the significant impact of quantum coherence on the overall fidelity of the computation. This paper introduces an adaptive quantum circuit compilation algorithm designed to mitigate this limitation. The algorithm dynamically analyzes the coherence properties of the quantum circuit during the compilation process, aiming to preserve coherence while simultaneously minimizing detrimental decoherence effects. This approach represents a fundamental shift in the compilation paradigm, directly addressing the critical challenge of coherence maintenance in quantum computing. The proposed methodology utilizes a novel metric for coherence analysis and employs an adaptive optimization strategy to achieve superior circuit fidelity compared to conventional compilation techniques. The effectiveness of the algorithm is demonstrated through theoretical analysis and a detailed explanation of its components, paving the way for more robust and accurate quantum circuit implementations.

•Sep 2, 2026•0 citations

Adaptive Quantum Circuit Compilation for Hardware-Aware Optimization

Jincheng Zhang

Quantum circuit compilation is a critical step in realizing quantum algorithms on real quantum hardware. Traditional compilation methods often employ static optimization strategies, neglecting the unique constraints and characteristics of the target quantum device. This paper introduces a novel adaptive quantum circuit compilation framework designed to dynamically adjust circuit designs based on hardware-specific information, aiming to minimize gate count and, consequently, error rates. The core of the framework lies in integrating a hardware simulator directly within the compilation process. This allows the compiler to evaluate the performance of various circuit designs—considering factors like qubit connectivity, gate fidelity, and decoherence models—before committing to a final layout. The proposed approach represents a shift from static to adaptive optimization, providing a more nuanced and effective strategy for translating quantum algorithms into executable code on diverse quantum hardware platforms. This research demonstrates a significant potential improvement in quantum circuit efficiency and fidelity, addressing a key bottleneck in the advancement of quantum computing.

•Sep 3, 2026•0 citations

A Systematic Literature Review on Optimization Techniques for Quantum Computing Compilers

Camilla Vitoria Bueno da Rocha, Ana Luiza Diniz Santos, Matheus A. Souza

The rapid development of Quantum Computing (QC) as a promising computing paradigm has garnered significant attention for its ability to harness quantum mechanical properties for computation. With classical computing facing limitations outlined by Moore’s Law, QC emerges as a potential alternative for tackling complex computational problems. Yet, to unlock its full potential, robust and optimized compilers are pivotal, especially in addressing challenges posed by circuits with numerous qubits. In this systematic literature review, we analyze 18 articles to identify proposed optimizations for quantum compilers, exploring their applications, performance impacts, and emerging trends. Our primary goal is to offer valuable insights into the recent advancements and challenges in QC compiler optimizations. This will be achieved through the clustering of optimization groups, ultimately facilitating further progress in the development of highly optimized quantum algorithms and circuits.

•Oct 17, 2023•0 citations

Dynamic Quantum Circuit Compilation

Kun Fang, Munan Zhang, Ruqi Shi +1 more

The practical applications of quantum computing is currently limited by the small number of available qubits. Recent advances in quantum hardware have introduced midcircuit measurements and resets, enabling the reuse of measured qubits and thus reducing the qubit requirements for executing quantum algorithms. In this work, we present a systematic study of dynamic quantum circuit compilation, a process that transforms static quantum circuits into their dynamic equivalents with fewer qubits through qubit reuse. We establish the first graph-based framework for optimizing qubit-reuse compilation. In particular, we characterize the task of finding the optimal compilation strategy for maximizing qubit reuse using binary integer programming and provide efficient heuristic algorithms for devising general compilation strategies. We conduct a thorough analysis of quantum circuits with practical relevance and offer their optimal qubit-reuse compilation strategies. We also perform a comparative analysis against state-of-the-art approaches, demonstrating the superior performance of our methods in both structured and random quantum circuits. Our framework lays a rigorous foundation for understanding dynamic quantum circuit compilation via qubit reuse, holding significant promise for the practical implementation of large-scale quantum algorithms on quantum computers with limited resources.

arXiv:2310.11021•IEEE Transactions on Computers•Dec 15, 2025•7 citations
Abstract In quantum computing, quantum compilation transforms a target unitary into a trainable unitary represented by a quantum circuit. Traditional quantum compilation optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets. To address this, we developed a multi-target quantum compilation algorithm to enhance the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the algorithm’s effectiveness, highlighting the significance of multi-target optimization in advancing quantum computing. This work establishes the foundation for further development and evaluation of multi-target quantum compilation algorithms.
Abstract Quantum compilation is the process of converting a target unitary operation into a trainable unitary represented by a quantum circuit. It has a wide range of applications, including gate optimization, quantum-assisted compiling, quantum state preparation, and quantum dynamic simulation. Traditional quantum compilation usually optimizes circuits for a single target. However, many quantum systems require simultaneous optimization of multiple targets, such as thermal state preparation, time-dependent dynamic simulation, and others. To address this, we develop a multi-target quantum compilation algorithm to improve the performance and flexibility of simulating multiple quantum systems. Our benchmarks and case studies demonstrate the effectiveness of the algorithm, highlighting the importance of multi-target optimization in advancing quantum computing. This work lays the groundwork for further development and evaluation of multi-target quantum compilation algorithms.
This paper presents a novel theory for quantum computing program compilation and optimization. The core of this theory lies in translating high-level quantum programs into efficient quantum circuit implementations. This is achieved through the utilization of an abstract syntax tree (AST) derived from the quantum program. A compilation algorithm is designed to traverse the AST and generate corresponding quantum circuits, incorporating optimization strategies throughout the process. The work addresses a significant challenge within quantum computing – the complexity of program compilation – and proposes a new theoretical framework to facilitate the development of more practical and performant quantum algorithms. The theoretical framework outlined here provides a foundation for future research and development in quantum compiler design.
Quantum circuit compilation is a crucial step in transforming a high-level quantum algorithm description into a sequence of gates executable on a specific quantum hardware platform. Traditional compilation methods predominantly focus on minimizing gate count and circuit depth, often overlooking the significant impact of quantum coherence on the overall fidelity of the computation. This paper introduces an adaptive quantum circuit compilation algorithm designed to mitigate this limitation. The algorithm dynamically analyzes the coherence properties of the quantum circuit during the compilation process, aiming to preserve coherence while simultaneously minimizing detrimental decoherence effects. This approach represents a fundamental shift in the compilation paradigm, directly addressing the critical challenge of coherence maintenance in quantum computing. The proposed methodology utilizes a novel metric for coherence analysis and employs an adaptive optimization strategy to achieve superior circuit fidelity compared to conventional compilation techniques. The effectiveness of the algorithm is demonstrated through theoretical analysis and a detailed explanation of its components, paving the way for more robust and accurate quantum circuit implementations.
Quantum circuit compilation is a critical step in realizing quantum algorithms on real quantum hardware. Traditional compilation methods often employ static optimization strategies, neglecting the unique constraints and characteristics of the target quantum device. This paper introduces a novel adaptive quantum circuit compilation framework designed to dynamically adjust circuit designs based on hardware-specific information, aiming to minimize gate count and, consequently, error rates. The core of the framework lies in integrating a hardware simulator directly within the compilation process. This allows the compiler to evaluate the performance of various circuit designs—considering factors like qubit connectivity, gate fidelity, and decoherence models—before committing to a final layout. The proposed approach represents a shift from static to adaptive optimization, providing a more nuanced and effective strategy for translating quantum algorithms into executable code on diverse quantum hardware platforms. This research demonstrates a significant potential improvement in quantum circuit efficiency and fidelity, addressing a key bottleneck in the advancement of quantum computing.
The rapid development of Quantum Computing (QC) as a promising computing paradigm has garnered significant attention for its ability to harness quantum mechanical properties for computation. With classical computing facing limitations outlined by Moore’s Law, QC emerges as a potential alternative for tackling complex computational problems. Yet, to unlock its full potential, robust and optimized compilers are pivotal, especially in addressing challenges posed by circuits with numerous qubits. In this systematic literature review, we analyze 18 articles to identify proposed optimizations for quantum compilers, exploring their applications, performance impacts, and emerging trends. Our primary goal is to offer valuable insights into the recent advancements and challenges in QC compiler optimizations. This will be achieved through the clustering of optimization groups, ultimately facilitating further progress in the development of highly optimized quantum algorithms and circuits.
The practical applications of quantum computing is currently limited by the small number of available qubits. Recent advances in quantum hardware have introduced midcircuit measurements and resets, enabling the reuse of measured qubits and thus reducing the qubit requirements for executing quantum algorithms. In this work, we present a systematic study of dynamic quantum circuit compilation, a process that transforms static quantum circuits into their dynamic equivalents with fewer qubits through qubit reuse. We establish the first graph-based framework for optimizing qubit-reuse compilation. In particular, we characterize the task of finding the optimal compilation strategy for maximizing qubit reuse using binary integer programming and provide efficient heuristic algorithms for devising general compilation strategies. We conduct a thorough analysis of quantum circuits with practical relevance and offer their optimal qubit-reuse compilation strategies. We also perform a comparative analysis against state-of-the-art approaches, demonstrating the superior performance of our methods in both structured and random quantum circuits. Our framework lays a rigorous foundation for understanding dynamic quantum circuit compilation via qubit reuse, holding significant promise for the practical implementation of large-scale quantum algorithms on quantum computers with limited resources.