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

Logic Journal of IGPL

Quantum simulation of Boolean logic, digital circuits, and cryptographic schemes

Daniel Escánez-Expósito, Pino Caballero‐Gil

Published Apr 24, 2025• 1 citation
Publisher

Abstract

Abstract This paper describes a novel library implementation for quantum simulation of typical Boolean circuits and several encryption systems. The tool contains half and full adders, binary encoder ($2^{n}$ to $n$), binary decoder ($n$ to $2^{n}$), and multiplexer, as well as its development details accompanied by graphics generated by the software itself. These tools are essential for the implementation of several classical and current ciphers. In addition, studies of optimizations for the quantum paradigm of symmetric encryption systems of different types, such as substitution or permutation ciphers and a simplified version of AES (S-AES), are included. This approach allows a simple and intuitive understanding of the quantum equivalent circuits to the fundamentals of digital electronics and logic design, providing an innovative and pedagogical tool that allows the quantum implementation of classic circuits for real applications including complex encryption systems, starting from previously defined algorithms.

DOI
10.1093/jigpal/jzaf019

Related papers

A survey of the research on quantum circuit synthesis and optimization of symmetric-key cryptography

LIN Da, GAO Fei, ZOU Jian +3 more

With the continuous development of quantum technology and the gradual advancement of quantum computers, the challenges faced by modern cryptography are becoming increasingly diverse. When analyzing the security strength of cryptographic algorithms against quantum attacks, the construction of quantum implementation circuits is a crucial aspect. Symmetric-key cryptography is an important component of modern cryptography. This study reviews the research results of optimizing the quantum implementation of symmetric-key cryptography under quantum computing models. Specifically, this work summarizes the construction of reversible circuits for linear layers, Substitution-boxes (S-boxes), and various addition operations, as well as the quantum implementation of symmetric-key ciphers such as AES, SM4, and Camellia.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Nov 5, 2024•2 citations

STUDY AND REALIZATION OF SIMPLE QUANTUM GATES

Lavanya Ravala, S. Vishnu Priya, G .V. Sujitha +2 more

Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.

International Journal of Novel Research and Development•Apr 1, 2026•0 citations

Resource-Constrained Quantum Implementation and Analysis of Mini-AES Cipher

Syed Shahmir, Ghulam Murtaza, Elmahdi Bentafat +4 more

Quantum search algorithms, such as Grover's algorithm, will soon pose a threat to current encryption standards as quantum computing advances toward practical implementation. These algorithms rely on quantum circuits that map cryptographic algorithms into appropriate Hilbert spaces, thus linking algorithmic inputs and outputs through quantum superposition. However, implementing and testing such circuits on existing quantum simulators, such as Qiskit, encounters significant memory and computational bottlenecks that limit research progress. To address these simulation constraints, we present a resource-optimized quantum circuit implementation of a complete two-round Mini-AES encryption algorithm. Our approach systematically converts the cipher's algebraic structure using algebraic normal form (ANF) equations, mapping XOR operations to CNOT gates and AND operations to Toffoli gates. To reduce memory overhead, we implement an ancilla-reuse strategy utilizing mid-circuit measurements and resets. Additionally, we introduce an automated procedure that generates Qiskitcompatible quantum circuits for arbitrary S-boxes and cryptographic primitives, streamlining the development of quantum cryptanalysis implementations. Our implementation achieves full encryption and decryption in a quantum circuit with modest gate requirements that can be achieved by the current or near-future state of the art quantum computers. In addition, we provide system utilization metrics to validate our resource-constrained implementation. This compact and pedagogically accessible implementation establishes a practical foundation for quantum cryptanalysis research and post-quantum cryptographic analysis.

arXiv:2503.06566•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Advanced Encryption Standard on a Quantum System

Aditya Damodhar Dhanapal, Sm Anantha Ramanujan, V. Jeyalakshmi

Quantum computers have shown their capability to outperform the world's fastest supercomputers despite their nascent stage. This poses questions about the security of existing encryption schemes and offers exciting new possibilities to the field of cryptography. Extension of existing cryptographic algorithms and development of novel cryptographic protocols exploiting the physics of the quantum realm are unique prospects for the industry moving forward. This work implemented a hybrid classical-quantum AES-128 circuit on the open-source Qiskit simulator and explored the possibilities of reducing the qubit count necessary for implementing the same. Multiple classical bits were encoded into a single qubit for processing, and a machine learning model was trained to decode the output data back to classical bits. The circuit size was halved by changing the encoding form of classical bits into qubits. Our hybrid circuit also achieved significant speed up over the existing hybrid circuit for AES encryption and decryption.

International Conference on Integrated Intelligence and Communication Systems (ICIICS)•Nov 24, 2023•3 citations

QuCirDET: A design and simulation tool for quantum circuits

Konstantinos P. Prousalis, Nikos Konofaos

An electronic design and evaluation tool for quantum circuit design is presented. It allows easy implementation of quantum algorithms based on the circuit model of quantum computation. The layout of an ideal circuit network can be designed in the logical layer and then automatically get converted into an encoded form closer to the physical layer. The possibility to select and apply the desired quantum error-correcting code enables to study a particular circuit from the aspect of error correction. Various constructions of the same logical network can be designed in order to compare the gate loads of different implementations and encoding or decoding schemas. It is a well structured software tool enabling expansion of other useful functions for realistic studies on quantum computation.

International Conference on Modern Circuits and Systems Technologies•May 1, 2016•4 citations

IMPLEMENTATION AND SIMULATION OF A QUANTUM HALF ADDER USING IBM QISKIT

Krishnaveni Guduru, Devi Prasanna Vempa, Manideepa Mekala +1 more

Quantum computing is an emerging computational paradigm that represents and processes information using quantum states. This paper presents the implementation and simulation of a Quantum Half Adder using the IBM Qiskit framework. The proposed circuit performs one-bit binary addition and produces two outputs, SUM and CARRY, through reversible quantum operations. Classical input values are encoded into quantum states using Pauli-X gates. Controlled-NOT (CNOT) gates are used to realize the XOR relationship required for SUM generation, while a Toffoli (CCNOT) gate realizes the AND relationship required for CARRY generation. The complete design is implemented in Python and executed using the Qiskit Aer Simulator. Four possible input combinations are evaluated and the measured outputs are compared with the expected Half Adder truth table. Circuit visualization, terminal output, and measurement histograms are used to verify the operation. The results show that the simulated circuit produces the expected SUM and CARRY values for all input combinations. The work provides a simple practical model for understanding reversible quantum computation, quantum gates, and Qiskit-based quantum circuit simulation.

International Journal of Novel Research and Development•Sep 1, 2026•0 citations
Abstract This paper describes a novel library implementation for quantum simulation of typical Boolean circuits and several encryption systems. The tool contains half and full adders, binary encoder (2n2^{n}2n to nnn), binary decoder (nnn to 2n2^{n}2n), and multiplexer, as well as its development details accompanied by graphics generated by the software itself. These tools are essential for the implementation of several classical and current ciphers. In addition, studies of optimizations for the quantum paradigm of symmetric encryption systems of different types, such as substitution or permutation ciphers and a simplified version of AES (S-AES), are included. This approach allows a simple and intuitive understanding of the quantum equivalent circuits to the fundamentals of digital electronics and logic design, providing an innovative and pedagogical tool that allows the quantum implementation of classic circuits for real applications including complex encryption systems, starting from previously defined algorithms.
With the continuous development of quantum technology and the gradual advancement of quantum computers, the challenges faced by modern cryptography are becoming increasingly diverse. When analyzing the security strength of cryptographic algorithms against quantum attacks, the construction of quantum implementation circuits is a crucial aspect. Symmetric-key cryptography is an important component of modern cryptography. This study reviews the research results of optimizing the quantum implementation of symmetric-key cryptography under quantum computing models. Specifically, this work summarizes the construction of reversible circuits for linear layers, Substitution-boxes (S-boxes), and various addition operations, as well as the quantum implementation of symmetric-key ciphers such as AES, SM4, and Camellia.
Quantum computing represents a paradigm shift in computation by leveraging the principles of quantum mechanics such as superposition, entanglement, and interference to perform operations beyond classical limitations. Unlike classical computing systems that rely on irreversible logic operations and suffer from energy dissipation due to information loss, quantum systems utilize reversible unitary transformations that preserve information and improve computational efficiency. This paper presents a comprehensive framework for the design, simulation, and validation of quantum gates and reversible arithmetic circuits, including half adders and half subtractors. The proposed approach systematically maps classical arithmetic logic into quantum circuits using fundamental quantum gates such as Pauli-X, Hadamard, Controlled-NOT (CNOT), and Toffoli gates. The circuits are implemented and simulated using the Qiskit Aer framework, enabling detailed analysis of quantum state evolution and measurement outputs. The results obtained from simulation include program-level outputs, state vector representations, measurement counts, and probability distributions, all of which demonstrate strong agreement with classical truth tables. The analysis confirms the correctness, reversibility, and scalability of the proposed designs. Furthermore, a comparative performance evaluation highlights the advantages of quantum computing over classical approaches in terms of parallelism and energy efficiency. The proposed framework establishes a robust foundation for future implementation of complex Boolean logic and arithmetic operations in quantum systems.
Quantum search algorithms, such as Grover's algorithm, will soon pose a threat to current encryption standards as quantum computing advances toward practical implementation. These algorithms rely on quantum circuits that map cryptographic algorithms into appropriate Hilbert spaces, thus linking algorithmic inputs and outputs through quantum superposition. However, implementing and testing such circuits on existing quantum simulators, such as Qiskit, encounters significant memory and computational bottlenecks that limit research progress. To address these simulation constraints, we present a resource-optimized quantum circuit implementation of a complete two-round Mini-AES encryption algorithm. Our approach systematically converts the cipher's algebraic structure using algebraic normal form (ANF) equations, mapping XOR operations to CNOT gates and AND operations to Toffoli gates. To reduce memory overhead, we implement an ancilla-reuse strategy utilizing mid-circuit measurements and resets. Additionally, we introduce an automated procedure that generates Qiskitcompatible quantum circuits for arbitrary S-boxes and cryptographic primitives, streamlining the development of quantum cryptanalysis implementations. Our implementation achieves full encryption and decryption in a quantum circuit with modest gate requirements that can be achieved by the current or near-future state of the art quantum computers. In addition, we provide system utilization metrics to validate our resource-constrained implementation. This compact and pedagogically accessible implementation establishes a practical foundation for quantum cryptanalysis research and post-quantum cryptographic analysis.
Quantum computers have shown their capability to outperform the world's fastest supercomputers despite their nascent stage. This poses questions about the security of existing encryption schemes and offers exciting new possibilities to the field of cryptography. Extension of existing cryptographic algorithms and development of novel cryptographic protocols exploiting the physics of the quantum realm are unique prospects for the industry moving forward. This work implemented a hybrid classical-quantum AES-128 circuit on the open-source Qiskit simulator and explored the possibilities of reducing the qubit count necessary for implementing the same. Multiple classical bits were encoded into a single qubit for processing, and a machine learning model was trained to decode the output data back to classical bits. The circuit size was halved by changing the encoding form of classical bits into qubits. Our hybrid circuit also achieved significant speed up over the existing hybrid circuit for AES encryption and decryption.
An electronic design and evaluation tool for quantum circuit design is presented. It allows easy implementation of quantum algorithms based on the circuit model of quantum computation. The layout of an ideal circuit network can be designed in the logical layer and then automatically get converted into an encoded form closer to the physical layer. The possibility to select and apply the desired quantum error-correcting code enables to study a particular circuit from the aspect of error correction. Various constructions of the same logical network can be designed in order to compare the gate loads of different implementations and encoding or decoding schemas. It is a well structured software tool enabling expansion of other useful functions for realistic studies on quantum computation.
Quantum computing is an emerging computational paradigm that represents and processes information using quantum states. This paper presents the implementation and simulation of a Quantum Half Adder using the IBM Qiskit framework. The proposed circuit performs one-bit binary addition and produces two outputs, SUM and CARRY, through reversible quantum operations. Classical input values are encoded into quantum states using Pauli-X gates. Controlled-NOT (CNOT) gates are used to realize the XOR relationship required for SUM generation, while a Toffoli (CCNOT) gate realizes the AND relationship required for CARRY generation. The complete design is implemented in Python and executed using the Qiskit Aer Simulator. Four possible input combinations are evaluated and the measured outputs are compared with the expected Half Adder truth table. Circuit visualization, terminal output, and measurement histograms are used to verify the operation. The results show that the simulated circuit produces the expected SUM and CARRY values for all input combinations. The work provides a simple practical model for understanding reversible quantum computation, quantum gates, and Qiskit-based quantum circuit simulation.