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 Conference Computational Vision and Bio Inspired Computing

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

Sumathi Pawar, Suchetha N V, Ramasubramanian Murugesan, Mohammad Azmal, Ashvitha Kini

Published Aug 1, 2026• 0 citations
Publisher
DOI
10.1109/iccvbic71195.2026.11689299

Related papers

Quantum logic gates and circuits construction

Piotr Marecki

Archiwum Informatyki Teoretycznej i Stosowanej•Jan 1, 2001•0 citations

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

Exploration of Quantum computing and communication blocks with IBM Qiskit

Sumit Gupta, Mayank Namdev, Ankur Goyal +3 more

This manuscript provides a comprehensive exploration of quantum computing and communication’s foundational elements, employing Qiskit—an open-source quantum computing framework. It delves into the simulation of fundamental quantum blocks and the intricacies of two-qubit entanglement, presenting findings through graphical analyses. The discussion extends to quantum logic gates, including X, Y, Z and CNOT. This study not only examines the construction and application of quantum circuits. The simulation with Qiskit programming presents the basic quantum circuits and its outcomes after measurement.

Journal of Discrete Mathematical Sciences and Cryptography•Jan 1, 2024•1 citation

Quantum logic gate construction and quantum algorithms

Xinlan Zhou

•Jan 1, 2002•0 citations

Structural Verification of Quantum Circuits: A Haskell Implementation via Hoare Logic

Alex Bastianini

As quantum hardware remains limited by qubit count and noise, the efficiency and correctness of quantum programs cannot yet be efficiently checked by execution or classical simulation alone. This thesis develops a Hoare logic for reasoning about the structural properties of quantum circuits produced by Proto-Qiskit, a Qiskit inspired programming language. We define derivation rules that treat commands that modify circuits as assignments, allowing properties such as gate count, circuit width, and depth to be specified and verified. These results are implemented in a Haskell tool that parses annotated Proto-Qiskit programs and proves their validity by generating verification conditions using weakest precondition calculus, with the support of an SMT solver. The tool is demonstrated on parametric example programs, including a quantum Fourier transform circuit, highlighting both its capabilities and its current limitations. Furthermore, we informally discuss the implementation of an optimization-aware extension of the logic based on a quantum state assertion language. This allows triviality conditions to be checked during verification so that redundant gates can be identified and removed while proving the correctness of the resulting optimized circuit. We discuss the issues this extension introduces for automated verification.

•Jul 15, 2026•0 citations

Quantum Logic Circuits and Quantum Computing

Saleem Mohammed Ridha Taha

Studies in systems, decision and control•Sep 24, 2015•4 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.
This manuscript provides a comprehensive exploration of quantum computing and communication’s foundational elements, employing Qiskit—an open-source quantum computing framework. It delves into the simulation of fundamental quantum blocks and the intricacies of two-qubit entanglement, presenting findings through graphical analyses. The discussion extends to quantum logic gates, including X, Y, Z and CNOT. This study not only examines the construction and application of quantum circuits. The simulation with Qiskit programming presents the basic quantum circuits and its outcomes after measurement.
As quantum hardware remains limited by qubit count and noise, the efficiency and correctness of quantum programs cannot yet be efficiently checked by execution or classical simulation alone. This thesis develops a Hoare logic for reasoning about the structural properties of quantum circuits produced by Proto-Qiskit, a Qiskit inspired programming language. We define derivation rules that treat commands that modify circuits as assignments, allowing properties such as gate count, circuit width, and depth to be specified and verified. These results are implemented in a Haskell tool that parses annotated Proto-Qiskit programs and proves their validity by generating verification conditions using weakest precondition calculus, with the support of an SMT solver. The tool is demonstrated on parametric example programs, including a quantum Fourier transform circuit, highlighting both its capabilities and its current limitations. Furthermore, we informally discuss the implementation of an optimization-aware extension of the logic based on a quantum state assertion language. This allows triviality conditions to be checked during verification so that redundant gates can be identified and removed while proving the correctness of the resulting optimized circuit. We discuss the issues this extension introduces for automated verification.