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:2211.07685 · Journal of Computational Physics

Highly optimized quantum circuits synthesized via data-flow engines

Péter Rakyta, Gregory Morse, Jakab Nádori, Zita Majnay-Takács, Oskar Mencer, Zoltán Zimborás

Published Jan 9, 2024• 13 citations
arXivHTMLPDF
DOI
10.1016/j.jcp.2024.112756

Related papers

Synthesizing Quantum Circuits via Numerical Optimization

Timothée Goubault de Brugière, Marc Baboulin, Benoît Valiron +1 more

arXiv:2004.07714•Lecture notes in computer science•Jan 1, 2019•9 citations

Synthesizing Quantum-Circuit Optimizers

Amanda Xu, Abtin Molavi, Lauren Pick +2 more

Near-term quantum computers are expected to work in an environment where each operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied to minimize the number of noisy operations. Today, physicists are constantly experimenting with novel devices and architectures. For every new physical substrate and for every modification of a quantum computer, we need to modify or rewrite major pieces of the optimizer to run successful experiments. In this paper, we present QUESO, an efficient approach for automatically synthesizing a quantum-circuit optimizer for a given quantum device. For instance, in 1.2 minutes, QUESO can synthesize an optimizer with high-probability correctness guarantees for IBM computers that significantly outperforms leading compilers, such as IBM's Qiskit and TKET, on the majority (85%) of the circuits in a diverse benchmark suite. A number of theoretical and algorithmic insights underlie QUESO: (1) An algebraic approach for representing rewrite rules and their semantics. This facilitates reasoning about complex symbolic rewrite rules that are beyond the scope of existing techniques. (2) A fast approach for probabilistically verifying equivalence of quantum circuits by reducing the problem to a special form of polynomial identity testing . (3) A novel probabilistic data structure, called a polynomial identity filter (PIF), for efficiently synthesizing rewrite rules. (4) A beam-search-based algorithm that efficiently applies the synthesized symbolic rewrite rules to optimize quantum circuits.

arXiv:2211.09691•Proceedings of the ACM on Programming Languages•Jun 6, 2023•42 citations

Scalable Quantum Circuit Optimization Using Automated Synthesis

Xin-Chuan Wu, Costin Iancu, Frederic T. Chong

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

Technology mapping and optimization for reversible and quantum circuits

Zahra Sasanian

Quantum information processing is of interest as it offers the potential for a new generation of very powerful computers supporting novel computational paradigms. Over the last couple of decades, different aspects of quantum computers ranging from quantum algorithms to quantum physical design have received growing attention. One of the most important research areas is the synthesis and post-synthesis optimization of reversible and quantum circuits. Many synthesis and optimization approaches can be found in the literature, yet, due to the complexity of the problem, finding approaches leading to optimal, or near optimal, results is still an open problem. The synthesized circuits are usually evaluated based on quantum cost models. Therefore, they are often technology mapped to circuits of more primitive gates. To this end, various technology mapping approaches have also been proposed in the past few years. Related work shows an existing gap in optimized technology mapping for reversible and quantum circuits. In this dissertation, an optimized technology mapping design flow is introduced for mapping reversible circuits to quantum circuits. The contributions of this dissertation are classified as follows: - New reversible circuit optimization methods. - Optimized reversible to quantum mapping approaches. - New quantum gate libraries and new cost models for reversible gates based on the new libraries. - Quantum circuit optimization approaches. The steps above, form an optimized flow for mapping reversible circuits to quantum circuits. At each step of the design flow optimized and consistent approaches are suggested with the goal of reducing the quantum cost of the synthesized reversible circuits. The evaluations show that the proposed mapping methodology leads to significant improvement in the quantum cost of the existing benchmark circuits.

•Jan 1, 2012•14 citations

Optimizing Quantum Circuits for Arbitrary State Synthesis and Initialization

Naveed Mahmud, Andrew MacGillivray, Manu Chaudhary +1 more

For practical usage of quantum systems in solving real-world problems, large amounts of classical data are required to be transferred/encoded to the quantum domain. Arbitrary classical data is usually encoded onto quantum devices by synthesizing and initializing a corresponding quantum state. Current techniques of arbitrary state synthesis, however, produce deep and complex quantum circuits, leading to low state fidelity and possible violations of decoherence constraints. In this work, we propose an improved methodology and optimized circuits for synthesizing any arbitrary quantum state from given classical data. Compared to existing methods, the proposed methodology results in circuits with lower gate count, lower circuit depth, and high state fidelity. The proposed methods are evaluated by simulation in MATLAB and IBM qasm, and realistic implementation on an IBM quantum device. The experimental results show a reduction in gate count and circuit depth by a factor of two over existing methods.

IEEE International System-on-Chip Conference (SOCC)•Sep 14, 2021•2 citations

Synthesis and Optimization by Quantum Circuit Description Language

Mariam Zomorodi Moghadam, Mohammad Amin Taherkhani, Keivan Navi

Lecture notes in computer science•Jan 1, 2014•9 citations
Near-term quantum computers are expected to work in an environment where each operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied to minimize the number of noisy operations. Today, physicists are constantly experimenting with novel devices and architectures. For every new physical substrate and for every modification of a quantum computer, we need to modify or rewrite major pieces of the optimizer to run successful experiments. In this paper, we present QUESO, an efficient approach for automatically synthesizing a quantum-circuit optimizer for a given quantum device. For instance, in 1.2 minutes, QUESO can synthesize an optimizer with high-probability correctness guarantees for IBM computers that significantly outperforms leading compilers, such as IBM's Qiskit and TKET, on the majority (85%) of the circuits in a diverse benchmark suite. A number of theoretical and algorithmic insights underlie QUESO: (1) An algebraic approach for representing rewrite rules and their semantics. This facilitates reasoning about complex symbolic rewrite rules that are beyond the scope of existing techniques. (2) A fast approach for probabilistically verifying equivalence of quantum circuits by reducing the problem to a special form of polynomial identity testing . (3) A novel probabilistic data structure, called a polynomial identity filter (PIF), for efficiently synthesizing rewrite rules. (4) A beam-search-based algorithm that efficiently applies the synthesized symbolic rewrite rules to optimize quantum circuits.
Quantum information processing is of interest as it offers the potential for a new generation of very powerful computers supporting novel computational paradigms. Over the last couple of decades, different aspects of quantum computers ranging from quantum algorithms to quantum physical design have received growing attention. One of the most important research areas is the synthesis and post-synthesis optimization of reversible and quantum circuits. Many synthesis and optimization approaches can be found in the literature, yet, due to the complexity of the problem, finding approaches leading to optimal, or near optimal, results is still an open problem. The synthesized circuits are usually evaluated based on quantum cost models. Therefore, they are often technology mapped to circuits of more primitive gates. To this end, various technology mapping approaches have also been proposed in the past few years. Related work shows an existing gap in optimized technology mapping for reversible and quantum circuits. In this dissertation, an optimized technology mapping design flow is introduced for mapping reversible circuits to quantum circuits. The contributions of this dissertation are classified as follows: - New reversible circuit optimization methods. - Optimized reversible to quantum mapping approaches. - New quantum gate libraries and new cost models for reversible gates based on the new libraries. - Quantum circuit optimization approaches. The steps above, form an optimized flow for mapping reversible circuits to quantum circuits. At each step of the design flow optimized and consistent approaches are suggested with the goal of reducing the quantum cost of the synthesized reversible circuits. The evaluations show that the proposed mapping methodology leads to significant improvement in the quantum cost of the existing benchmark circuits.
For practical usage of quantum systems in solving real-world problems, large amounts of classical data are required to be transferred/encoded to the quantum domain. Arbitrary classical data is usually encoded onto quantum devices by synthesizing and initializing a corresponding quantum state. Current techniques of arbitrary state synthesis, however, produce deep and complex quantum circuits, leading to low state fidelity and possible violations of decoherence constraints. In this work, we propose an improved methodology and optimized circuits for synthesizing any arbitrary quantum state from given classical data. Compared to existing methods, the proposed methodology results in circuits with lower gate count, lower circuit depth, and high state fidelity. The proposed methods are evaluated by simulation in MATLAB and IBM qasm, and realistic implementation on an IBM quantum device. The experimental results show a reduction in gate count and circuit depth by a factor of two over existing methods.