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

International Journal of Information Technology

Template-based optimization of universal quantum reversible logic design for enhanced metrics

Mamtha Prajapati, Kalyan Babu Killana

Published Aug 29, 2025• 4 citations
Publisher
DOI
10.1007/s41870-025-02713-8

Related papers

Optimization Approaches for Designing Quantum Reversible Arithmetic Logic Unit

Majid Haghparast, Ali Bolhassani

International Journal of Theoretical Physics•Sep 3, 2015•10 citations

Novel Design of Resource‐Constrained Quantum Reversible Logic Gates at Optimal Cost and Depth

Mamtha Prajapati, Kalyan Babu Killana

Reversible logic computation and optimization of reversible circuits help synthesize applications characterized by ultra‐low power consumption, including quantum information processing, the field of nanotechnology, semiconductor technology, the field of optics, and very‐large‐scale integration (VLSI), among others. Reversible logic design is a growing research subject that evaluates and applies resources in new advancements. This article provides an optimized, unique, resource‐constrained universal quantum reversible gate for nanoscale applications that perform all fundamental logic operations. Optimization and gate relocation have enhanced a published and proposed design. Quantum reversible circuits are optimized for cost and depth via template matching, gate fusion (merging) and commutation, gate decomposition, and gate elimination. These methods reduce circuit complexity and size significantly. A step‐by‐step optimization of the quantum reversible logic design is first presented. The novel quantum reversible gates MRQ1, MRQ2, and M‐BUS are implemented and verified on the IBM Qiskit platform. The proposed reversible gates’ design complexity is assessed using 13 standard Boolean expressions. Proposed quantum reversible gates demonstrate an improvement in performance, covering a range of 12.5%–72.7% over prior designs in gate count, depth, and quantum cost. Gate count improved most, impacting other parameters and demonstrating the design’s resource efficiency.

Journal of Nanotechnology•Jan 1, 2025•2 citations

Complete synthesis of identity templates for quantum and reversible logic MCT circuits using SAT-solvers and proposal of suboptimality witness notion

Adam Jagielski

In this study, we introduce a procedural generation technique for Identity Templates applicable to quantum and reversible logic circuits. These templates are recognized for their significant role in enhancing the efficiency of quantum and reversible logic optimization. Our approach enables the exhaustive synthesis of all potential templates up to a specified size. Leveraging the power of SAT-solver technology, we have verified the comprehensiveness of our template collections by confirming the full exploration of the search space. Additionally, we propose an innovative concept of Suboptimality Witnesses, which we anticipate will be instrumental in streamlining the search process in formal methods, akin to SAT-solvers, for the synthesis of reversible logic circuits.

International Journal of Electronics and Telecommunications•Jul 25, 2024•0 citations

Reversible Logic Synthesis Methodologies with Application to Quantum Computing

Saleem Mohammed Ridha Taha

Studies in systems, decision and control•Sep 24, 2015•26 citations

Template-based mapping of reversible circuits to IBM quantum computers

Philipp Niemann, Alexandre A. A. de Almeida, Gerhard W. Dueck +1 more

Microprocessors and Microsystems•Mar 4, 2022•4 citations

Enhancing the MMD algorithm in multi-core environments

Michael Schlösser

The work done in this thesis enhances the MMD algorithm in multi-core environments. The MMD algorithm, a transformation based algorithm for reversible logic synthesis, is based on the works introduced by Maslov, Miller and Dueck and their original, sequential implementation. It synthesises a formal function specification, provided by a truth table, into a reversible network and is able to perform several optimization steps after the synthesis. This work concentrates on one of these optimization steps, the template matching. This approach is used to reduce the size of the reversible circuit by replacing a number of gates that match a template which implements the same function and uses less gates. Smaller circuits have several benefits since they need less area and are not as costly. The template matching approach introduced in the original works is computationally expensive since it tries to match a library of templates against the given circuit. For each template at each position in the circuit, a number of different combinations have to be calculated during runtime resulting in high execution times, especially for large circuits. In order to make the template matching approach more efficient and usable, it has been reimplemented in order to take advantage of modern multi-core architectures such as the Cell Broadband Engine or a Graphics Processing Unit. For this work, two algorithmically different approaches that try to consider each multi-core architecture’s strengths, have been analyzed and improved. For the analysis these approaches have been cross-implemented on the two target hardware architectures and compared to the original parallel versions. Important metrics for this analysis are the execution time of the algorithm and the result of the minimization with the template matching approach. It could be shown that the algorithmically different approaches produce the same minimization results, independent of the used hardware architecture. However, both cross-implementations also show a significantly higher execution time which makes them practically irrelevant. The results of the first analysis and comparison lead to the decision to enhance only the original parallel approaches. Using the same metrics for successful enhancements as mentioned above, it could be shown that improving the algorithmic concepts and exploiting the capabilities of the hardware lead to better results for the execution time and the minimization results compared to their original implementations.

•Jan 30, 2011•0 citations
Reversible logic computation and optimization of reversible circuits help synthesize applications characterized by ultra‐low power consumption, including quantum information processing, the field of nanotechnology, semiconductor technology, the field of optics, and very‐large‐scale integration (VLSI), among others. Reversible logic design is a growing research subject that evaluates and applies resources in new advancements. This article provides an optimized, unique, resource‐constrained universal quantum reversible gate for nanoscale applications that perform all fundamental logic operations. Optimization and gate relocation have enhanced a published and proposed design. Quantum reversible circuits are optimized for cost and depth via template matching, gate fusion (merging) and commutation, gate decomposition, and gate elimination. These methods reduce circuit complexity and size significantly. A step‐by‐step optimization of the quantum reversible logic design is first presented. The novel quantum reversible gates MRQ1, MRQ2, and M‐BUS are implemented and verified on the IBM Qiskit platform. The proposed reversible gates’ design complexity is assessed using 13 standard Boolean expressions. Proposed quantum reversible gates demonstrate an improvement in performance, covering a range of 12.5%–72.7% over prior designs in gate count, depth, and quantum cost. Gate count improved most, impacting other parameters and demonstrating the design’s resource efficiency.
In this study, we introduce a procedural generation technique for Identity Templates applicable to quantum and reversible logic circuits. These templates are recognized for their significant role in enhancing the efficiency of quantum and reversible logic optimization. Our approach enables the exhaustive synthesis of all potential templates up to a specified size. Leveraging the power of SAT-solver technology, we have verified the comprehensiveness of our template collections by confirming the full exploration of the search space. Additionally, we propose an innovative concept of Suboptimality Witnesses, which we anticipate will be instrumental in streamlining the search process in formal methods, akin to SAT-solvers, for the synthesis of reversible logic circuits.
The work done in this thesis enhances the MMD algorithm in multi-core environments. The MMD algorithm, a transformation based algorithm for reversible logic synthesis, is based on the works introduced by Maslov, Miller and Dueck and their original, sequential implementation. It synthesises a formal function specification, provided by a truth table, into a reversible network and is able to perform several optimization steps after the synthesis. This work concentrates on one of these optimization steps, the template matching. This approach is used to reduce the size of the reversible circuit by replacing a number of gates that match a template which implements the same function and uses less gates. Smaller circuits have several benefits since they need less area and are not as costly. The template matching approach introduced in the original works is computationally expensive since it tries to match a library of templates against the given circuit. For each template at each position in the circuit, a number of different combinations have to be calculated during runtime resulting in high execution times, especially for large circuits. In order to make the template matching approach more efficient and usable, it has been reimplemented in order to take advantage of modern multi-core architectures such as the Cell Broadband Engine or a Graphics Processing Unit. For this work, two algorithmically different approaches that try to consider each multi-core architecture’s strengths, have been analyzed and improved. For the analysis these approaches have been cross-implemented on the two target hardware architectures and compared to the original parallel versions. Important metrics for this analysis are the execution time of the algorithm and the result of the minimization with the template matching approach. It could be shown that the algorithmically different approaches produce the same minimization results, independent of the used hardware architecture. However, both cross-implementations also show a significantly higher execution time which makes them practically irrelevant. The results of the first analysis and comparison lead to the decision to enhance only the original parallel approaches. Using the same metrics for successful enhancements as mentioned above, it could be shown that improving the algorithmic concepts and exploiting the capabilities of the hardware lead to better results for the execution time and the minimization results compared to their original implementations.