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

arXiv:2006.09488

Circuits: An abstract viewpoint

Andreas R. Blass, Yuri G. Gurevich

Published Jun 16, 2020• 2 citations
arXivHTMLPDF

Abstract

Our primary purpose is to isolate the abstract, mathematical properties of circuits -- both classical Boolean circuits and quantum circuits -- that are essential for their computational interpretation. A secondary purpose is to clarify the similarities and differences between the classical and quantum situations. The general philosophy in this note is to include the mathematically essential aspects of circuits but to omit any of the additional structures that are usually included for convenience. We shall, however, retain the assumption that circuits are finite; this assumption does no harm to the applicability of our approach and is necessary for some of our work.

DOI
10.48550/arxiv.2006.09488

Related papers

Quantum error correction

Anirban Pathak

In Chapter 4 we introduced different quantum gates and quantum circuits and in Chapter 5 we described several quantum algorithms. So far the analysis of the algorithms and the circuits has been made with the assumption that the required unitary operations can be implemented exactly without any error. This is an abstraction. In an actual physical system that implements a quantum algorithm or a quantum circuit there are several sources of errors. The situation is similar in classical computation and to circumvent this problem error correcting codes are used in classical digital computing. Since qubits are more delicate and more susceptible to errors we need to introduce quantum error correcting codes. It is very important, as without such codes it will not be possible to build a scalable quantum computer. Such quantum error correcting codes are introduced in this chapter. However, we will not limit ourselves to the discussion of error correcting codes alone. We will also discuss more general aspects of errors and error correction, like decoherence, decoherence free subspace and fault-tolerance.

CRC Press eBooks•Jun 20, 2013•42 citations

Quantum Computer:2. Differences between Quantum and Classical Circuits : The Case of Addition Circuits

Yasuhiro Takahashi

情報処理•Jun 15, 2014•0 citations

Characterization of exact one-query quantum algorithms (ii): for partial functions

Zekun Ye, Lvzhou Li

The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical counterpart. For example, the well-known quantum algorithms including Deutsch-Jozsa algorithm, Simon algorithm and Grover algorithm all show a considerable advantage of quantum computing from the viewpoint of query complexity. Recently we have considered in (Phys. Rev. A. {\bf 101}, 02232 (2020)) the problem: what functions can be computed by an exact one-query quantum algorithm? This problem has been addressed for total Boolean functions but still open for partial Boolean functions. Thus, in this paper we continue to characterize the computational power of exact one-query quantum algorithms for partial Boolean functions by giving several necessary and sufficient conditions. By these conditions, we construct some new functions that can be computed exactly by one-query quantum algorithms but have essential difference from the already known ones. Note that before our work, the known functions that can be computed by exact one-query quantum algorithms are all symmetric functions, whereas the ones constructed in this papers are generally asymmetric.

arXiv:2008.11998•Aug 27, 2020•3 citations

A PHYSICS-FREE INTRODUCTION TO THE QUANTUM COMPUTATION MODEL

Stephen Fenner

This article defines and proves basic properties of the standard quantum circuit model of computation. The model is developed abstractly in close analogy with (classical) deterministic and probabilistic circuits, without recourse to any physical concepts or principles. It is intended as a primer for theoretical computer scientists who do not know--and perhaps do not care to know--any physics.

arXiv:cs/0304008•WORLD SCIENTIFIC eBooks•Apr 1, 2004•4 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

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

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

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.

Logic Journal of IGPL•Apr 24, 2025•1 citation
Our primary purpose is to isolate the abstract, mathematical properties of circuits -- both classical Boolean circuits and quantum circuits -- that are essential for their computational interpretation. A secondary purpose is to clarify the similarities and differences between the classical and quantum situations. The general philosophy in this note is to include the mathematically essential aspects of circuits but to omit any of the additional structures that are usually included for convenience. We shall, however, retain the assumption that circuits are finite; this assumption does no harm to the applicability of our approach and is necessary for some of our work.
In Chapter 4 we introduced different quantum gates and quantum circuits and in Chapter 5 we described several quantum algorithms. So far the analysis of the algorithms and the circuits has been made with the assumption that the required unitary operations can be implemented exactly without any error. This is an abstraction. In an actual physical system that implements a quantum algorithm or a quantum circuit there are several sources of errors. The situation is similar in classical computation and to circumvent this problem error correcting codes are used in classical digital computing. Since qubits are more delicate and more susceptible to errors we need to introduce quantum error correcting codes. It is very important, as without such codes it will not be possible to build a scalable quantum computer. Such quantum error correcting codes are introduced in this chapter. However, we will not limit ourselves to the discussion of error correcting codes alone. We will also discuss more general aspects of errors and error correction, like decoherence, decoherence free subspace and fault-tolerance.
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical counterpart. For example, the well-known quantum algorithms including Deutsch-Jozsa algorithm, Simon algorithm and Grover algorithm all show a considerable advantage of quantum computing from the viewpoint of query complexity. Recently we have considered in (Phys. Rev. A. {\bf 101}, 02232 (2020)) the problem: what functions can be computed by an exact one-query quantum algorithm? This problem has been addressed for total Boolean functions but still open for partial Boolean functions. Thus, in this paper we continue to characterize the computational power of exact one-query quantum algorithms for partial Boolean functions by giving several necessary and sufficient conditions. By these conditions, we construct some new functions that can be computed exactly by one-query quantum algorithms but have essential difference from the already known ones. Note that before our work, the known functions that can be computed by exact one-query quantum algorithms are all symmetric functions, whereas the ones constructed in this papers are generally asymmetric.
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.