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

American Journal of Science & Engineering

Implementing Classical Logic in a Quantum Environment

Christopher T. Dunne

Published Jun 6, 2022• 0 citations
Publisher

Abstract

This paper is meant to serve as an introductory guide on how to implement simple logic gates in a quantum environment. Uncompressed circuits for each statement can be found in the appendix.
DOI
10.15864/ajse.3104

Related papers

Implementation of Quantum Gates based Logic Circuits using IBM Qiskit

Enaul Haq Shaik, Nakkeeran Rangaswamy

Quantum computing is an emerging field that depends upon the basic properties of quantum physics and principles of classical systems. This leads a way to develop systems to solve complex problems that a classical system cannot do. In this article, we present simple methods to implement logic circuits using quantum gates. Logic gates and circuits are defined with quantum gates using Qiskit in Python. Later, they are verified with quantum circuits created by using IBM Quantum. Moreover, we propose a way of instantiating the basic logic circuits to design high-end logic expressions. As per our knowledge, the proposed simple approach may be helpful to solve the complex logical problems in near future.

International Conference on Computing, Communication and Security (ICCCS)•Oct 14, 2020•30 citations

Construction of Quantum Circuits for Classical Logical Gates Using Quantum Gates with Qiskit

Sumathi Pawar, Suchetha N V, Ramasubramanian Murugesan +2 more

International Conference Computational Vision and Bio Inspired Computing•Aug 1, 2026•0 citations

FROM QUANTUM LOGIC TO QUANTUM COMPUTATIONAL LOGIC

Michele Caponigro, Stefano Mancini

We overview the main concepts of quantum logic ranging from the orthodox formulation to the quantum computational aspects.

•Jan 1, 2006•0 citations

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

Advanced Tutorials on Quantum Circuits

Ayan Datta, P Prabhavathi

River Publishers eBooks•Jan 26, 2026•0 citations

Beyond Classical

Robert Hundt

This chapter serves as a bridge from the introductory material to the sections on quantum algorithms. We start by implementing a classical circuit using quantum gates and show that quantum computers are at least as capable as classical computers. Then we discuss the term “beyond classical,” which is now the preferred term to describe computation that can be run efficiently on a quantum computer but would be intractable to run on a classical computer. For this, we discuss in detail Google’s seminal quantum supremacy paper.

Cambridge University Press eBooks•Nov 20, 2025•0 citations
Quantum computing is an emerging field that depends upon the basic properties of quantum physics and principles of classical systems. This leads a way to develop systems to solve complex problems that a classical system cannot do. In this article, we present simple methods to implement logic circuits using quantum gates. Logic gates and circuits are defined with quantum gates using Qiskit in Python. Later, they are verified with quantum circuits created by using IBM Quantum. Moreover, we propose a way of instantiating the basic logic circuits to design high-end logic expressions. As per our knowledge, the proposed simple approach may be helpful to solve the complex logical problems in near future.
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.
This chapter serves as a bridge from the introductory material to the sections on quantum algorithms. We start by implementing a classical circuit using quantum gates and show that quantum computers are at least as capable as classical computers. Then we discuss the term “beyond classical,” which is now the preferred term to describe computation that can be run efficiently on a quantum computer but would be intractable to run on a classical computer. For this, we discuss in detail Google’s seminal quantum supremacy paper.