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

Quantum computers, principles and latest development

Eduard Ješko

Published Jun 17, 2014• 0 citations
OpenAlex

Abstract

The main goal of this thesis is to give information on quantum computer principles and its latest development. In the first part we introduce quantum bits, quantum registers and quantum gates. We show basic operations acting on one and more qubits. On an example we present, how it is possible to construct an arbitrary gate using only elementary quantum gates. We describe a behaviour of quantum computers called quantum parallelism and show its application in Deutsch's algorithm. We define the quantum Fourier transform and its applications. In the last chapter we explain on what principle the D-Wave quantum computer works. In this thesis we compare classical and quantum computers in terms of algorithms and computational speed.

Related papers

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 computers: Registers, gates and algorithms

Paul Isaac Hagouel, Ioannis G. Karafyllidis

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.

IEEE International Conference on Microelectronics (MIEL)•May 1, 2012•25 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

Quantum Computers - Example of Executing the Deutsch Quantum Algorithm Using Google Colab

Željko Eremić, Tanja Sekulić, Iris Borjanović Trusina

In this paper, an introduction to the basic principles of quantum computing is provided, from concepts of quantum mechanics to their mathematical and computational representation.The core phenomena of quantum mechanics, such as superposition, interference, and entanglement, are explained, and their applications in quantum information processing are described.Mathematical representation of quantum information, starting from qubits, quantum gates, and quantum operations, is presented and explained.Also, the overview of basic quantum algorithms is given and compared to classical approaches.The quantum Deutsch algorithm is presented and discussed mathematically.Prerequisites and programming code in Python for executing the quantum Deutsch's algorithm are presented.Figures of quantum circuits and execution results are given.Finally, the results of the execution of this algorithm are discussed.

International Scientific Conference Sinteza•Jan 1, 2026•0 citations

State of the Art and Prospects for Quantum Computing

M. I. Dyakonov

The idea of quantum computing is to store information in the values of 2N complex amplitudes describing the wavefunction of N two-level systems (qubits), and to process this information by applying unitary transformations (quantum gates), that change these amplitudes in a precise and controlled manner. This chapter first explains an advanced research and development activity (ARDA) experts' panel roadmap for quantum computing. Experimental studies related to the idea of quantum computing comprise only a tiny part of the whole QC literature. The goal of such proof-of-principle experiments is to show the possibility of manipulating small numbers of two-level quantum systems serving as qubits, to realize the basic quantum operations, as well as to demonstrate elements of Shor’s factoring algorithm and error correction by encoding. Controlled Vocabulary Terms error correction; information management; quantum communication

Wiley eBooks•May 20, 2013•7 citations
The main goal of this thesis is to give information on quantum computer principles and its latest development. In the first part we introduce quantum bits, quantum registers and quantum gates. We show basic operations acting on one and more qubits. On an example we present, how it is possible to construct an arbitrary gate using only elementary quantum gates. We describe a behaviour of quantum computers called quantum parallelism and show its application in Deutsch's algorithm. We define the quantum Fourier transform and its applications. In the last chapter we explain on what principle the D-Wave quantum computer works. In this thesis we compare classical and quantum computers in terms of algorithms and computational speed.
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.
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.
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.
In this paper, an introduction to the basic principles of quantum computing is provided, from concepts of quantum mechanics to their mathematical and computational representation.The core phenomena of quantum mechanics, such as superposition, interference, and entanglement, are explained, and their applications in quantum information processing are described.Mathematical representation of quantum information, starting from qubits, quantum gates, and quantum operations, is presented and explained.Also, the overview of basic quantum algorithms is given and compared to classical approaches.The quantum Deutsch algorithm is presented and discussed mathematically.Prerequisites and programming code in Python for executing the quantum Deutsch's algorithm are presented.Figures of quantum circuits and execution results are given.Finally, the results of the execution of this algorithm are discussed.
The idea of quantum computing is to store information in the values of 2N complex amplitudes describing the wavefunction of N two-level systems (qubits), and to process this information by applying unitary transformations (quantum gates), that change these amplitudes in a precise and controlled manner. This chapter first explains an advanced research and development activity (ARDA) experts' panel roadmap for quantum computing. Experimental studies related to the idea of quantum computing comprise only a tiny part of the whole QC literature. The goal of such proof-of-principle experiments is to show the possibility of manipulating small numbers of two-level quantum systems serving as qubits, to realize the basic quantum operations, as well as to demonstrate elements of Shor’s factoring algorithm and error correction by encoding. Controlled Vocabulary Terms error correction; information management; quantum communication