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

IEEE International Conference on Microelectronics (MIEL)

Quantum computers: Registers, gates and algorithms

Paul Isaac Hagouel, Ioannis G. Karafyllidis

Published May 1, 2012• 25 citations
Publisher

Abstract

Quantum computing is a process that incorporates interacting physical systems that represent quantum bits and quantum gates. We present the quantum bit (qubit), the quantum register and the quantum gates. The qubit is described as a vector in a two-dimensional Hilbert space and the quantum register, which comprises a number of qubits, as a vector in a multidimensional Hilbert space. Quantum gates are Hilbert space operators that rotate the qubit or the quantum register vectors. Quantum computations are modeled and described using a quantum circuit model. We also present a quantum computer simulator based on the circuit model of quantum computation. In this model quantum computations and quantum algorithms are represented by circuits, which comprise quantum gates and quantum registers. The well-known Deutsch's algorithm is described and the corresponding quantum circuit is presented. Possible applications of quantum computers are be presented and discussed.

DOI
10.1109/miel.2012.6222789

Related papers

Quantum computer simulator based on the circuit model of quantum computation

Ioannis G. Karafyllidis

A quantum computer simulator is presented. This simulator is an engineering work and no deep understanding of quantum mechanics is required from the user. The simulator is based on the circuit model of quantum computation in which quantum gates act on quantum registers which comprise a number of quantum bits (qubits). The inputs to the simulator are the initial states of the qubits that form a quantum register and the quantum gates applied at each computation step. The inputs are entered through a graphical user interface. The outputs of the simulator are the matrices that represent the quantum register state at each quantum computation step and graphical outputs that show the probability of measuring each one of the possible quantum register base states and the phase of each state at each computation step. The well-known Deutsch's algorithm and the quantum Fourier transform, which is the base of many quantum algorithms, are presented using this simulator. Furthermore, the generation and variation of entanglement during quantum computations can be calculated using this simulator. The quantum computer simulator is a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms.

IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications•Aug 1, 2005•56 citations

Quantum computing: an introduction

T. Beth

Summary form only given, as follows. Gives a system theoretic approach to the concept of quantum computing. A quantum computer is envisaged to be a system of quantum circuits, acting on a state space, which is a finite-say 2/sup n/-dimensional-complex Hilbert space. The circuitry is a sequence of unitary transforms U/sub t/ /spl epsiv/ SU(2/sup n/) followed by a measurement. These transforms, so-called quantum gates, are controlled by a classical computer, usually especially electromagnetic fields. The state space of a quantum computer has the structure of a Hermitian vector space. Thus it allows "simultaneous" superposition of orthogonal basis states (corresponding to classical states) with the possibility of constructive and destructive interference between different paths of computation. This principle allows the usage of so-called entangled states by preparing the superposition of special "bent" configurations of basis vectors in the product Hilbert space, e.g., as they are known from error control and cryptography. This latter "entanglement" not only promises to make a quantum computer much more powerful than a probabilistic one, but it also allows a method of parallelism. The reason for this lies not only in the fact that the 2/sup n/ dimensional Hilbert space is the n-fold tensor product of 2-dimensional spaces as it is given by spin-1/2-particles, like photons, representing a quantum bit. First of all, we shall address the fact that the power of quantum computing lies in the properties of entangled states as opposed to those of separable states which essentially would resemble classical circuits without giving the feature of exponential speed-up. We shall briefly describe possible physical realisations of quantum (optic, electronic, magnetic,...) devices allowing the engineering of Hamiltonians needed for quantum systems. Basic quantum gates, especially the quantum Horner-Toffoli gate will be discussed to display the principles and methodology for designing quantum circuits. An outlook towards the possible availability of nano- and mesoscopic technologies supporting this new architecture in future generations concludes based on a speculative worst/best case forecast of possible applications, e.g., in public key and conventional cryptography.

IEEE International Symposium on Circuits and Systems proceedings•Jan 1, 2000•7 citations

Basic principles of quantum computing

Santeri Huhtanen

Quantum mechanics has proven its position as the primary theory for accurately describing microscopic domains. Numerous fields in physics utilize quantum mechanics to great effects, with one prominent application being quantum computing. Quantum computing extends the field of quantum mechanics to information theory, striving to perform computational tasks utilizing quantum phenomena with notably greater efficiency compared to classical alternatives. In this thesis, I will go through the basics required in the field of quantum computing. To understand quantum computing demands adapting a new type of matrix mechanical view. This involves considering Hilbert spaces, which are linear vector space having a well defined inner product. Hilbert spaces contain state vectors describing quantum states, as well as operators for altering and measuring these states. The dynamics of quantum systems are governed by three quantum postulates. These specify Hilbert spaces and state vectors as the fundamental components of quantum systems, Hermitian operators as providing the physical manifestation of these systems, and finally, the Schrödinger's equation to describe the time evolution of such systems. These notions are required in producing quantum computing. Quantum computing uses qubits as the computational basis, analogous to classical bits but with the added capability of quantum superposition. Qubits are represented as two-state vectors, and can be physically realized with any quantum-behaving binary-valued system, like the electron spins. Qubits can be combined into higher dimensional states with the use of tensor products, causing the system's Hilbert space to expand as 2^n with n being the number of qubits, allowing for exponential computational speedup. Computational logic can be constructed by acting on the qubits using unitary operators, known as quantum gates. The combinations of qubits and quantum gates can be visualized as quantum circuits, depicted using specialized circuit diagram notations. An essential part of quantum computing, and the phenomena enabling exponential computational speedup, is quantum entanglement. Entanglement arises in interacting qubits, intertwining them so that the individual states become correlated. Entanglement can be characterized by being unable to reduce a combined state into its pure constituents. The amount of entanglement in a system can be measured using von Neumann entropy, analogous to Shannon entropy in classical information theory. Entanglement serves various purposes in quantum computing and is a defining feature distinguishing it from the classical domain. In this thesis, the entanglement properties of a periodic four-qubit circuit with alternating quantum gates were simulated. The simulation was performed computationally, and measured entanglement entropy as a function of the amount of circuit periods. The results demonstrated different characteristics of entanglement depending on the parameters used for the quantum gates, with the entanglement either being periodic, non-occurring or chaotic in nature.

•Jan 1, 2024•0 citations

Quantum Gates and Circuits

Kolla Bhanu Prakash

Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.

Wiley eBooks•Aug 17, 2026•0 citations

Quantum Computers

S. Rajasekar, R. Velusamy

In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.

CRC Press eBooks•Oct 5, 2022•0 citations

Quantum computation

This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations
Quantum computing is a process that incorporates interacting physical systems that represent quantum bits and quantum gates. We present the quantum bit (qubit), the quantum register and the quantum gates. The qubit is described as a vector in a two-dimensional Hilbert space and the quantum register, which comprises a number of qubits, as a vector in a multidimensional Hilbert space. Quantum gates are Hilbert space operators that rotate the qubit or the quantum register vectors. Quantum computations are modeled and described using a quantum circuit model. We also present a quantum computer simulator based on the circuit model of quantum computation. In this model quantum computations and quantum algorithms are represented by circuits, which comprise quantum gates and quantum registers. The well-known Deutsch's algorithm is described and the corresponding quantum circuit is presented. Possible applications of quantum computers are be presented and discussed.
A quantum computer simulator is presented. This simulator is an engineering work and no deep understanding of quantum mechanics is required from the user. The simulator is based on the circuit model of quantum computation in which quantum gates act on quantum registers which comprise a number of quantum bits (qubits). The inputs to the simulator are the initial states of the qubits that form a quantum register and the quantum gates applied at each computation step. The inputs are entered through a graphical user interface. The outputs of the simulator are the matrices that represent the quantum register state at each quantum computation step and graphical outputs that show the probability of measuring each one of the possible quantum register base states and the phase of each state at each computation step. The well-known Deutsch's algorithm and the quantum Fourier transform, which is the base of many quantum algorithms, are presented using this simulator. Furthermore, the generation and variation of entanglement during quantum computations can be calculated using this simulator. The quantum computer simulator is a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms.
Summary form only given, as follows. Gives a system theoretic approach to the concept of quantum computing. A quantum computer is envisaged to be a system of quantum circuits, acting on a state space, which is a finite-say 2/sup n/-dimensional-complex Hilbert space. The circuitry is a sequence of unitary transforms U/sub t/ /spl epsiv/ SU(2/sup n/) followed by a measurement. These transforms, so-called quantum gates, are controlled by a classical computer, usually especially electromagnetic fields. The state space of a quantum computer has the structure of a Hermitian vector space. Thus it allows "simultaneous" superposition of orthogonal basis states (corresponding to classical states) with the possibility of constructive and destructive interference between different paths of computation. This principle allows the usage of so-called entangled states by preparing the superposition of special "bent" configurations of basis vectors in the product Hilbert space, e.g., as they are known from error control and cryptography. This latter "entanglement" not only promises to make a quantum computer much more powerful than a probabilistic one, but it also allows a method of parallelism. The reason for this lies not only in the fact that the 2/sup n/ dimensional Hilbert space is the n-fold tensor product of 2-dimensional spaces as it is given by spin-1/2-particles, like photons, representing a quantum bit. First of all, we shall address the fact that the power of quantum computing lies in the properties of entangled states as opposed to those of separable states which essentially would resemble classical circuits without giving the feature of exponential speed-up. We shall briefly describe possible physical realisations of quantum (optic, electronic, magnetic,...) devices allowing the engineering of Hamiltonians needed for quantum systems. Basic quantum gates, especially the quantum Horner-Toffoli gate will be discussed to display the principles and methodology for designing quantum circuits. An outlook towards the possible availability of nano- and mesoscopic technologies supporting this new architecture in future generations concludes based on a speculative worst/best case forecast of possible applications, e.g., in public key and conventional cryptography.
Quantum mechanics has proven its position as the primary theory for accurately describing microscopic domains. Numerous fields in physics utilize quantum mechanics to great effects, with one prominent application being quantum computing. Quantum computing extends the field of quantum mechanics to information theory, striving to perform computational tasks utilizing quantum phenomena with notably greater efficiency compared to classical alternatives. In this thesis, I will go through the basics required in the field of quantum computing. To understand quantum computing demands adapting a new type of matrix mechanical view. This involves considering Hilbert spaces, which are linear vector space having a well defined inner product. Hilbert spaces contain state vectors describing quantum states, as well as operators for altering and measuring these states. The dynamics of quantum systems are governed by three quantum postulates. These specify Hilbert spaces and state vectors as the fundamental components of quantum systems, Hermitian operators as providing the physical manifestation of these systems, and finally, the Schrödinger's equation to describe the time evolution of such systems. These notions are required in producing quantum computing. Quantum computing uses qubits as the computational basis, analogous to classical bits but with the added capability of quantum superposition. Qubits are represented as two-state vectors, and can be physically realized with any quantum-behaving binary-valued system, like the electron spins. Qubits can be combined into higher dimensional states with the use of tensor products, causing the system's Hilbert space to expand as 2^n with n being the number of qubits, allowing for exponential computational speedup. Computational logic can be constructed by acting on the qubits using unitary operators, known as quantum gates. The combinations of qubits and quantum gates can be visualized as quantum circuits, depicted using specialized circuit diagram notations. An essential part of quantum computing, and the phenomena enabling exponential computational speedup, is quantum entanglement. Entanglement arises in interacting qubits, intertwining them so that the individual states become correlated. Entanglement can be characterized by being unable to reduce a combined state into its pure constituents. The amount of entanglement in a system can be measured using von Neumann entropy, analogous to Shannon entropy in classical information theory. Entanglement serves various purposes in quantum computing and is a defining feature distinguishing it from the classical domain. In this thesis, the entanglement properties of a periodic four-qubit circuit with alternating quantum gates were simulated. The simulation was performed computationally, and measured entanglement entropy as a function of the amount of circuit periods. The results demonstrated different characteristics of entanglement depending on the parameters used for the quantum gates, with the entanglement either being periodic, non-occurring or chaotic in nature.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.