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

Journal of Artificial Intelligence and Autonomous Intelligence

A Quine-McCluskey Based Method for Generating Optimum Combinational Logic Circuits from Reversible Quantum Circuits

Orhan Yaman, Tuba Şanlı, Mehmet Karaköse

Published Jan 1, 2024• 2 citations
Publisher

Abstract

Algorithms specifically designed for quantum computers have been developed. In quantum circuits, the Feynman, Toffoli, and Fredkin gates are employed instead of traditional inputs such as AND, OR, NAND, NOR, XOR, and XNOR in combinational logic gates. The ability to convert quantum circuits into combinational logic circuits, or vice versa, is of utmost importance. This essay study (or paper) aims to demonstrates the process of deriving combinational logic circuits from reversible quantum circuits. To achieve this, the Quine-McCluskey technique was utilized along with state tables generated from the quantum circuits to obtain an optimal logic expression that serves as the basis for constructing the combinational logic circuit. The resultant obtained combinational logic circuit was implemented within the MATLAB Simulink environment, and state tables were obtained. A comparison was made between the state tables derived from the quantum circuit and the combinational circuit, yielding successful results.

DOI
10.54364/jaiai.2024.1110

Related papers

Design of optimal and combinational logic circuit using karnaugh method in quantum circuits

Tuba Şanlı, Orhan Yaman, Mehmet Karaköse

Today, quantum computers are still in development and are an area actively studied by researchers.Although quantum computers have high potential, there are significant technical difficulties and obstacles to achieving practical applications.Many research labs and companies are working on increasing the number of qubits, solving stability problems, and improving error correction techniques, and scalability.These efforts aim at advances such as the development of more stable and reliable qubits, the discovery of more precise control and reading techniques, and the design of more advanced algorithms.This study aims to establish a connection between quantum computers and classical computers.To achieve this, research and work have employed a Karnaugh-based approach.Karnaugh maps serve as highly useful tools in the analysis of complex logic circuits.Depending on one's needs and design requirements, different logic functions can be analyzed and simplified using Karnaugh maps.In this study, the Karnaugh map-based method is utilized to obtain the Boolean function from the state table of the Quantum circuit generated from the RCViewer+ synthesis tool.Subsequently, the obtained function is transformed into a combinational logic circuit.As a result, an optimal combinational circuit corresponding to the quantum circuit can be obtained.

•Sep 23, 2023•0 citations

In-depth Comparative Analysis of Reversible Gates for Designing Logic Circuits

Hari Mohan Gaur, Ashutosh Kumar Singh, Umesh Ghanekar

Reversible logic is expanding grounds with its applicability to various upcoming technologies and quantum computation. Numerous reversible gates has also been proposed for designing logic circuits apart of basic quantum controlled Toffoli and Fredkin gates. A comparative study and analysis of a range of reversible gates from the literature is presented in this paper to obtain an optimal solution for designing these circuits. The gates are synthesized and implemented to obtain equivalent quantum circuits and operating cost in terms of number of inputs, gate cost, quantum cost, garbage output and ancilla input. The comparison is done at two subsequent levels i.e. gates structural level and circuit design level, providing a better solution for designing logic circuits. It is calculated that, basic gates are 50% efficient at gate level and 33% at design level analysis in terms of gate cost, as compared to the most efficient gates proposed in the literature.

Procedia Computer Science•Jan 1, 2018•36 citations

Reversible Logic Gates for Efficient Circuit Construction and Quantum Computing

R Manaswini, J Silamboli, Kalyandurg Rafeeq Ahmed +2 more

Reversible logic, also known as information lossless logic, is a promising technology that allows embedded data within circuits to be retrieved in case of failure.This study explores the use of reversible gates, such as Feynman gates, Toffoli gates, Fredkin gates, Peres gates, Double Feynman gates, NFT gates, DKG gates, and DFT gates, to construct logic circuits.These reversible logic gates can be effectively used for the implementation of any higher logic circuits-based applications.In the proposed paper the Arithmetic logic unit based on reversible logic hates is implemented in Verilog as well as IBM quantum software.The major applications of reversible logic gates include quantum computing, low power circuits, nano and CMOS technologies, photonics.In the last part of the paper the circuits implemented using Verilog and IBM quantum a chip level design using Cadance layout is implemented.

International Conference on Computer, Computation and Communication (IC3C)•Jan 1, 2025•0 citations

A Scalable Synthesis Algorithm for Reversible Functions

Moein Sarvaghad-Moghaddam, Morteza Saheb Zamani, Mehdi Sedighi

Reversible computation is an emerging technology that has gained significant attention due to its critical role in quantum circuit synthesis and low-power design. This paper introduces a transformation-based method for exact synthesis of reversible circuits. The proposed approach utilizes a novel adaptation of the Quine-McCluskey algorithm to eliminate input-output discrepancies in the truth table, transforming the permutation matrix into an identity matrix. Furthermore, a novel search space reduction technique is presented which, combined with the primary method, enables the synthesis algorithm to handle high-input reversible functions. This approach combines the influence of multiple control qubits on a target qubit, evaluating their collective impact. This aggregation can decrease the control qubit count within quantum gates. Consequently, it proves beneficial for applications like surface code error correction architectures as well as current Noisy Intermediate-Scale Quantum (NISQ) hardwares. Experimental results demonstrate significant improvements over the state-of-the-art exact synthesis methods, achieving up to 99% improvements in terms of the number of levels of T-gates.

arXiv:2504.02632•Apr 3, 2025•0 citations

Realization and Optimization of Quantum Equivalent Circuits of Reversible Combinational Circuits

A. Kamaraj, P. Marichamy, K. P. Kaviyashri

Energy dissipation is the important constrain in the design and implementation of VLSI circuits. Usage of Reversible logic circuit is the best solution for lower energy dissipation. In this paper, basic reversible gates and some existing gates and KMD gates are realized using the Quantum Equivalent structure and the Controlled-V and V+ gate structure from their functional expression. Using the qubit gate reduction procedure of quantum circuit, the quantum cost and number of primitive gates of the functional expression are deduced. After synthesizing the Quantum Cost (QC), Gate count (GC), Garbage Output (GO), number of gates, constant inputs are compared with the non-optimized circuit. The quantum circuit and controlled V and V+ structure are realized in RCViewer+ tool using .tfc (“Toffoli-Fredkin Cascade”) code.

Journal of Computational and Theoretical Nanoscience•May 1, 2020•2 citations

BDD-Based Synthesis of Reversible Logic

Robert Wille, Rolf Drechsler

Reversible logic became a promising alternative to traditional circuits because of its applications in emerging technologies such as quantum computing, low-power design, DNA computing, or nanotechnologies. As a result, synthesis of the respective circuits is an intensely studied topic. However, most synthesis methods are limited, because they rely on a truth table representation of the function to be synthesized. In this paper, the authors present a synthesis approach that is based on Binary Decision Diagrams (BDDs). The authors propose a technique to derive reversible or quantum circuits from BDDs by substituting all nodes of the BDD with a cascade of Toffoli or quantum gates, respectively. Boolean functions containing more than a hundred of variables can efficiently be synthesized. More precisely, a circuit can be obtained from a given BDD using an algorithm with linear worst case behavior regarding run-time and space requirements. Furthermore, using the proposed approach, theoretical results known from BDDs can be transferred to reversible circuits. Experiments show better results (with respect to the circuit cost) and a significantly better scalability in comparison to previous synthesis approaches.

International Journal of Applied Metaheuristic Computing•Oct 1, 2010•8 citations
Algorithms specifically designed for quantum computers have been developed. In quantum circuits, the Feynman, Toffoli, and Fredkin gates are employed instead of traditional inputs such as AND, OR, NAND, NOR, XOR, and XNOR in combinational logic gates. The ability to convert quantum circuits into combinational logic circuits, or vice versa, is of utmost importance. This essay study (or paper) aims to demonstrates the process of deriving combinational logic circuits from reversible quantum circuits. To achieve this, the Quine-McCluskey technique was utilized along with state tables generated from the quantum circuits to obtain an optimal logic expression that serves as the basis for constructing the combinational logic circuit. The resultant obtained combinational logic circuit was implemented within the MATLAB Simulink environment, and state tables were obtained. A comparison was made between the state tables derived from the quantum circuit and the combinational circuit, yielding successful results.
Today, quantum computers are still in development and are an area actively studied by researchers.Although quantum computers have high potential, there are significant technical difficulties and obstacles to achieving practical applications.Many research labs and companies are working on increasing the number of qubits, solving stability problems, and improving error correction techniques, and scalability.These efforts aim at advances such as the development of more stable and reliable qubits, the discovery of more precise control and reading techniques, and the design of more advanced algorithms.This study aims to establish a connection between quantum computers and classical computers.To achieve this, research and work have employed a Karnaugh-based approach.Karnaugh maps serve as highly useful tools in the analysis of complex logic circuits.Depending on one's needs and design requirements, different logic functions can be analyzed and simplified using Karnaugh maps.In this study, the Karnaugh map-based method is utilized to obtain the Boolean function from the state table of the Quantum circuit generated from the RCViewer+ synthesis tool.Subsequently, the obtained function is transformed into a combinational logic circuit.As a result, an optimal combinational circuit corresponding to the quantum circuit can be obtained.
Reversible logic is expanding grounds with its applicability to various upcoming technologies and quantum computation. Numerous reversible gates has also been proposed for designing logic circuits apart of basic quantum controlled Toffoli and Fredkin gates. A comparative study and analysis of a range of reversible gates from the literature is presented in this paper to obtain an optimal solution for designing these circuits. The gates are synthesized and implemented to obtain equivalent quantum circuits and operating cost in terms of number of inputs, gate cost, quantum cost, garbage output and ancilla input. The comparison is done at two subsequent levels i.e. gates structural level and circuit design level, providing a better solution for designing logic circuits. It is calculated that, basic gates are 50% efficient at gate level and 33% at design level analysis in terms of gate cost, as compared to the most efficient gates proposed in the literature.
Reversible logic, also known as information lossless logic, is a promising technology that allows embedded data within circuits to be retrieved in case of failure.This study explores the use of reversible gates, such as Feynman gates, Toffoli gates, Fredkin gates, Peres gates, Double Feynman gates, NFT gates, DKG gates, and DFT gates, to construct logic circuits.These reversible logic gates can be effectively used for the implementation of any higher logic circuits-based applications.In the proposed paper the Arithmetic logic unit based on reversible logic hates is implemented in Verilog as well as IBM quantum software.The major applications of reversible logic gates include quantum computing, low power circuits, nano and CMOS technologies, photonics.In the last part of the paper the circuits implemented using Verilog and IBM quantum a chip level design using Cadance layout is implemented.
Reversible computation is an emerging technology that has gained significant attention due to its critical role in quantum circuit synthesis and low-power design. This paper introduces a transformation-based method for exact synthesis of reversible circuits. The proposed approach utilizes a novel adaptation of the Quine-McCluskey algorithm to eliminate input-output discrepancies in the truth table, transforming the permutation matrix into an identity matrix. Furthermore, a novel search space reduction technique is presented which, combined with the primary method, enables the synthesis algorithm to handle high-input reversible functions. This approach combines the influence of multiple control qubits on a target qubit, evaluating their collective impact. This aggregation can decrease the control qubit count within quantum gates. Consequently, it proves beneficial for applications like surface code error correction architectures as well as current Noisy Intermediate-Scale Quantum (NISQ) hardwares. Experimental results demonstrate significant improvements over the state-of-the-art exact synthesis methods, achieving up to 99% improvements in terms of the number of levels of T-gates.
Energy dissipation is the important constrain in the design and implementation of VLSI circuits. Usage of Reversible logic circuit is the best solution for lower energy dissipation. In this paper, basic reversible gates and some existing gates and KMD gates are realized using the Quantum Equivalent structure and the Controlled-V and V+ gate structure from their functional expression. Using the qubit gate reduction procedure of quantum circuit, the quantum cost and number of primitive gates of the functional expression are deduced. After synthesizing the Quantum Cost (QC), Gate count (GC), Garbage Output (GO), number of gates, constant inputs are compared with the non-optimized circuit. The quantum circuit and controlled V and V+ structure are realized in RCViewer+ tool using .tfc (“Toffoli-Fredkin Cascade”) code.
Reversible logic became a promising alternative to traditional circuits because of its applications in emerging technologies such as quantum computing, low-power design, DNA computing, or nanotechnologies. As a result, synthesis of the respective circuits is an intensely studied topic. However, most synthesis methods are limited, because they rely on a truth table representation of the function to be synthesized. In this paper, the authors present a synthesis approach that is based on Binary Decision Diagrams (BDDs). The authors propose a technique to derive reversible or quantum circuits from BDDs by substituting all nodes of the BDD with a cascade of Toffoli or quantum gates, respectively. Boolean functions containing more than a hundred of variables can efficiently be synthesized. More precisely, a circuit can be obtained from a given BDD using an algorithm with linear worst case behavior regarding run-time and space requirements. Furthermore, using the proposed approach, theoretical results known from BDDs can be transferred to reversible circuits. Experiments show better results (with respect to the circuit cost) and a significantly better scalability in comparison to previous synthesis approaches.