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

Modeling quantum circuits

Margareta Vamos

Published Jan 1, 2011• 1 citation
OpenAlex

Abstract

Quantum computers will be capable of new modes of computation which today???s computers are not capable of. The quantum theory of computation is the general theory of computation. The Turing model can describe completely the functioning of the existing computers. However, this model is just the classical approximation of the general quantum model. \nTo understand the Quantum Computation we don't need to understand quantum physics in detail. This paper presents some basic notions of quantum theory as the underlying foundation for quantum computing. The purpose of listing these notions is only to show that quantum computing has a solid theoretical foundation in quantum mechanics. \nQuantum computing basic components are quantum gates that can be used to form quantum circuits. Quantum algorithms are using parallel computation based on quantum entanglement. Because of state superposition a quantum processor can use all input values at the same time. To explore the full potential of quantum parallelism, new algorithms have been expressed mathematically. Although practical quantum computing is still in its early stages, it can represent the future of computation. The application provides means to graphically design a quantum circuit using quantum gates and to simulate a quantum algorithm represented by a quantum circuit. The user can choose a gate or a quantum gate from a list of elements. The gates have a number or a range of input and output pins, and some configurable properties. The user can drag and drop quantum gates to the project panel and connect them with quantum wires. The user will be able to run the circuit and evaluate the results.

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 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

Understanding the Basics of Quantum Computing and Its Impact on Modern Physics

M. Venugopala Rao, M. Krishna Kishore, A. Subba Rao

Quantum computing represents a transformative approach to computation by leveraging the fundamental principles of quantum mechanics. Unlike classical computing, which operates on bits, quantum computing uses quantum bits or qubits that exist in superposition, enabling parallel processing of information. This paper introduces the foundational concepts of quantum computing—such as superposition, entanglement, and quantum gates—and explores how these principles differ from classical models. Further, it highlights the implications of quantum computing in modern physics, especially in areas like quantum simulation, cryptography, and quantum field theory. By avoiding complex mathematical derivations, this paper aims to make quantum computing accessible to a broader academic audience, emphasizing both theoretical insights and practical impacts.

International Journal For Multidisciplinary Research•Aug 12, 2025•0 citations

Classical Computers

A mathematical model of classical computer was invented by Alan Turing and named “ Turing machine ” model, which is an idealized computer with a simple set of instructions and infinite memories. Soon after Turing’s model was proposed, John von Neumann developed a theoretical model for how to implement all the components in a computer to be fully capable as a Turing machine. In more practical way, we will make use of the circuit model, which is useful also in the study of quantum computation. A circuit may involve many inputs, outputs, many wires and many logic gates. These circuits will be implemented by semi-conductors, which have two functions as conductor and insulator and acts under given conditions as a high-speed switch that leads and stops electricity. Modern computers such as personal computers (PC) use integrated circuits (IC) of semiconductor. While the peculiar feature of semiconductor is based entirely on physics of quantum mechanics, we do not call these computers “quantum computers” but rather called “classical computers”, because logic gates are based on binary representations and any quantum state of atom or molecule is not used as a logic gate: in classical computers, the data are represented by two logical values 0 and 1 in the circuits using devices with high voltage/low voltage, current on/off, and/or direction of magnetization up/down.

WORLD SCIENTIFIC eBooks•Sep 24, 2020•0 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 will be capable of new modes of computation which today???s computers are not capable of. The quantum theory of computation is the general theory of computation. The Turing model can describe completely the functioning of the existing computers. However, this model is just the classical approximation of the general quantum model. \nTo understand the Quantum Computation we don't need to understand quantum physics in detail. This paper presents some basic notions of quantum theory as the underlying foundation for quantum computing. The purpose of listing these notions is only to show that quantum computing has a solid theoretical foundation in quantum mechanics. \nQuantum computing basic components are quantum gates that can be used to form quantum circuits. Quantum algorithms are using parallel computation based on quantum entanglement. Because of state superposition a quantum processor can use all input values at the same time. To explore the full potential of quantum parallelism, new algorithms have been expressed mathematically. Although practical quantum computing is still in its early stages, it can represent the future of computation. The application provides means to graphically design a quantum circuit using quantum gates and to simulate a quantum algorithm represented by a quantum circuit. The user can choose a gate or a quantum gate from a list of elements. The gates have a number or a range of input and output pins, and some configurable properties. The user can drag and drop quantum gates to the project panel and connect them with quantum wires. The user will be able to run the circuit and evaluate the results.
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.
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 represents a transformative approach to computation by leveraging the fundamental principles of quantum mechanics. Unlike classical computing, which operates on bits, quantum computing uses quantum bits or qubits that exist in superposition, enabling parallel processing of information. This paper introduces the foundational concepts of quantum computing—such as superposition, entanglement, and quantum gates—and explores how these principles differ from classical models. Further, it highlights the implications of quantum computing in modern physics, especially in areas like quantum simulation, cryptography, and quantum field theory. By avoiding complex mathematical derivations, this paper aims to make quantum computing accessible to a broader academic audience, emphasizing both theoretical insights and practical impacts.
A mathematical model of classical computer was invented by Alan Turing and named “ Turing machine ” model, which is an idealized computer with a simple set of instructions and infinite memories. Soon after Turing’s model was proposed, John von Neumann developed a theoretical model for how to implement all the components in a computer to be fully capable as a Turing machine. In more practical way, we will make use of the circuit model, which is useful also in the study of quantum computation. A circuit may involve many inputs, outputs, many wires and many logic gates. These circuits will be implemented by semi-conductors, which have two functions as conductor and insulator and acts under given conditions as a high-speed switch that leads and stops electricity. Modern computers such as personal computers (PC) use integrated circuits (IC) of semiconductor. While the peculiar feature of semiconductor is based entirely on physics of quantum mechanics, we do not call these computers “quantum computers” but rather called “classical computers”, because logic gates are based on binary representations and any quantum state of atom or molecule is not used as a logic gate: in classical computers, the data are represented by two logical values 0 and 1 in the circuits using devices with high voltage/low voltage, current on/off, and/or direction of magnetization up/down.
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.