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:1208.5425 · Quantum Information Processing

Depth-optimized reversible circuit synthesis

Mona Arabzadeh, Morteza Saheb Zamani, Mehdi Sedighi, Mehdi Saeedi

Published Sep 8, 2012• 20 citations
arXivHTMLPDF
DOI
10.1007/s11128-012-0482-8

Related papers

Reversible and Quantum Circuit Synthesis

Chia-Chun Lin

•Jan 1, 2014•2 citations

Optimal Reversible Logic Circuit Synthesis Based on a Hybrid DFS-BFS Technique

Dipak Kumar Kole, Hafizur Rahaman, D K Das +1 more

Logic synthesis with reversible circuits has received considerable interest in the light of advances recently made in quantum computation. In this paper, we propose an improved technique for synthesizing reversible circuits based on a combined depth-first search (DFS) and breadth-first search (BFS) algorithm. A method based on DFS alone may often take a long time to converge, whereas, a BFS based method requires a large amount of memory for designing a circuit of moderate complexity. To strike a balance between these two approaches, we propose a hybrid DFS-BFS based synthesis algorithm that reduces the computation time compared to the DFS method and requires less space compared to the BFS method, while optimizing the cost of the circuit. Synthesis results on several reversible benchmark circuits have been reported.

International Symposium on Electronic System Design•Dec 1, 2010•18 citations

Nearest Neighbor Architecture Circuit Synthesis and T-depth Reduction for Quantum Circuit Optimization

Zanhe Qi

•Mar 31, 2026•0 citations

A Transformation Framework for Cost Optimization in Circuit Design

Khaled El-Wazan, Mohamed Osman, Ahmed Younes

Reversible circuit synthesis is a foundation of quantum computing; however, existing methodolo-gies often produce a significant s u r g e i n g a t e count, which increases hardware complexity and error sus-ceptibility. We propose a greedy, transformation-based optimization algorithm designed to simplify resultant circuits from group-theoretic synthesis by utilizing transformation rules in a greedy manner. The opti-mized circuits are benchmarked against Qiskit native synthesis and demonstrate significant i m provements in terms of primitive gate count and depth.

International Conference on Machine Intelligence and Smart Innovation (ICMISI)•May 9, 2026•0 citations

Synthesis of reversible circuits with minimal costs

Guowu Yang, Xiaoyu Song, William N. N. Hung +2 more

CALCOLO•Sep 1, 2008•15 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
Logic synthesis with reversible circuits has received considerable interest in the light of advances recently made in quantum computation. In this paper, we propose an improved technique for synthesizing reversible circuits based on a combined depth-first search (DFS) and breadth-first search (BFS) algorithm. A method based on DFS alone may often take a long time to converge, whereas, a BFS based method requires a large amount of memory for designing a circuit of moderate complexity. To strike a balance between these two approaches, we propose a hybrid DFS-BFS based synthesis algorithm that reduces the computation time compared to the DFS method and requires less space compared to the BFS method, while optimizing the cost of the circuit. Synthesis results on several reversible benchmark circuits have been reported.
Reversible circuit synthesis is a foundation of quantum computing; however, existing methodolo-gies often produce a significant s u r g e i n g a t e count, which increases hardware complexity and error sus-ceptibility. We propose a greedy, transformation-based optimization algorithm designed to simplify resultant circuits from group-theoretic synthesis by utilizing transformation rules in a greedy manner. The opti-mized circuits are benchmarked against Qiskit native synthesis and demonstrate significant i m provements in terms of primitive gate count and depth.
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.