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

Springer eBooks

Quantum Combinational Circuits

Hafiz Md. Hasan Babu

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-97-7154-7_9

Related papers

Constructing Quantum Combinational Logic Circuits

Jae‐Seung Lee, Jae‐Hyun Kim, Yongwook Chung +1 more

APS•Mar 1, 2000•0 citations

Quantum-DNA Combinational Circuits

Hafiz Md. Hasan Babu

Springer eBooks•Jan 1, 2025•1 citation

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

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

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.

Journal of Artificial Intelligence and Autonomous Intelligence•Jan 1, 2024•2 citations

Quantum Circuits

WORLD SCIENTIFIC eBooks•Aug 27, 2026•0 citations

Quantum Combinational Logics and their Realizations with Circuits

Xiaoxue Tong, Tian Chen, Naiqiao Pan +1 more

Abstract Classical combinational logic circuits (CCLCs) are widely used in various fields. Corresponding to the CCLCs, here schemes are given for some quantum combinational logic circuits (QCLCs) based on the quantum NAND tree. Three typical circuits, adder, comparator, and seven‐segment display decoder, are discussed in detail as examples. All the designs of the schemes are based on the quantum random walk theory. Furthermore, these QCLCs are mapped onto the classical circuit networks and design new types of CCLCs, and take advantage of the fact that there is a good correspondence between the voltage in the circuit satisfying Kirchhoff's law and the system wave function satisfying the Schrodinger equation. These CCLCs that are designed have exponential speedup functions compared with conventional ones, which have been demonstrated experimentally. Because classical circuit networks possess good scalability and stability, the realization of QCLCs on classical circuits is expected to have potential applications for information processing in the era of big data.

Advanced Quantum Technologies•Oct 15, 2023•4 citations

Quantum Circuits

Madhusudan Singh Irish Singh, Bharat S. Rawal

Springer eBooks•Jan 1, 2026•0 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.
Abstract Classical combinational logic circuits (CCLCs) are widely used in various fields. Corresponding to the CCLCs, here schemes are given for some quantum combinational logic circuits (QCLCs) based on the quantum NAND tree. Three typical circuits, adder, comparator, and seven‐segment display decoder, are discussed in detail as examples. All the designs of the schemes are based on the quantum random walk theory. Furthermore, these QCLCs are mapped onto the classical circuit networks and design new types of CCLCs, and take advantage of the fact that there is a good correspondence between the voltage in the circuit satisfying Kirchhoff's law and the system wave function satisfying the Schrodinger equation. These CCLCs that are designed have exponential speedup functions compared with conventional ones, which have been demonstrated experimentally. Because classical circuit networks possess good scalability and stability, the realization of QCLCs on classical circuits is expected to have potential applications for information processing in the era of big data.