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 Transactions on Circuits and Systems I Fundamental Theory and Applications

Quantum computer simulator based on the circuit model of quantum computation

Ioannis G. Karafyllidis

Published Aug 1, 2005• 56 citations
Publisher

Abstract

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.

DOI
10.1109/tcsi.2005.851999

Related papers

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

Modeling quantum circuits

Margareta Vamos

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.

•Jan 1, 2011•1 citation

Simulation and validation of qubits based on Phase estimation algorithm

T Elanchezhiyan, Dheerendra Singh Tomar

After the advent of Quantum Physics, new opportunities were created for research and development in the world of science and technology.Quantum computation is one such emerging technology which allows for notable speed-ups compared to conventional computational methods.Here a quantum bit simulator is presented.This simulator is an engineering work, and no deep understanding of quantum mechanics is required from the user.The well-known phase estimation algorithm is presented using this simulator.The qubit simulator will be a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms

International Journal of Scientific and Research Publications•Jan 24, 2022•0 citations

Quick Quantum Circuit Simulation

Daniel Evans

Quick Quantum Circuit Simulation (QQCS) is a software system for computing the result of a quantum circuit using a notation that derives directly from the circuit, expressed in a single input line. Quantum circuits begin with an initial quantum state of one or more qubits, which are the quantum analog to classical bits. The initial state is modified by a sequence of quantum gates, quantum machine language instructions, to get the final state. Measurements are made of the final state and displayed as a classical binary result. Measurements are postponed to the end of the circuit because a quantum state collapses when measured and produces probabilistic results, a consequence of quantum uncertainty. A circuit may be run many times on a quantum computer to refine the probabilistic result. Mathematically, quantum states are 2n -dimensional vectors over the complex number field, where n is the number of qubits. A gate is a 2n ×2n unitary matrix of complex values. Matrix multiplication models the application of a gate to a quantum state. QQCS is a mathematical rendering of each step of a quantum algorithm represented as a circuit, and as such, can present a trace of the quantum state of the circuit after each gate, compute gate equivalents for each circuit step, and perform measurements at any point in the circuit without state collapse. Output displays are in vector coefficients or Dirac bra-ket notation. It is an easy-to-use educational tool for students new to quantum computing.

Journal of Computer Science Research•Sep 23, 2021•1 citation

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 logic gates and circuits

Vinod Kumar Khanna

A quantum gate is the quantum analog of the classical logic gate of digital computers. It is a basic structural unit of a quantum circuit which operates on a small number of qubits to deliver a predefined output. A quantum circuit is a graphical representation of the sequence of the quantum gates used and the measurements performed in a quantum computation. Various quantum logic gates, namely, the Hadamard, T phase, NOT, Pauli-X, controlled NOT (CNOT), controlled-Z, SWAP and controlled phase gates as well as higher-level Toffoli and Fredkin gates are described. Conventions of reading quantum circuit diagrams are explained. Operation of a quantum full adder consisting of registers and gates is discussed, elaborating the role of the NOT gate, the sum calculation with CNOTgates and the carry C-out calculation with Toffoli gates. A primary tool used for performing arithmetic operations on a quantum computer is the quantum Fourier transform (QFT). The QFT adder and multiplier circuits are presented.

Institute of Physics eBooks•Jan 1, 2025•0 citations
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.
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.
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.
After the advent of Quantum Physics, new opportunities were created for research and development in the world of science and technology.Quantum computation is one such emerging technology which allows for notable speed-ups compared to conventional computational methods.Here a quantum bit simulator is presented.This simulator is an engineering work, and no deep understanding of quantum mechanics is required from the user.The well-known phase estimation algorithm is presented using this simulator.The qubit simulator will be a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms
Quick Quantum Circuit Simulation (QQCS) is a software system for computing the result of a quantum circuit using a notation that derives directly from the circuit, expressed in a single input line. Quantum circuits begin with an initial quantum state of one or more qubits, which are the quantum analog to classical bits. The initial state is modified by a sequence of quantum gates, quantum machine language instructions, to get the final state. Measurements are made of the final state and displayed as a classical binary result. Measurements are postponed to the end of the circuit because a quantum state collapses when measured and produces probabilistic results, a consequence of quantum uncertainty. A circuit may be run many times on a quantum computer to refine the probabilistic result. Mathematically, quantum states are 2n -dimensional vectors over the complex number field, where n is the number of qubits. A gate is a 2n ×2n unitary matrix of complex values. Matrix multiplication models the application of a gate to a quantum state. QQCS is a mathematical rendering of each step of a quantum algorithm represented as a circuit, and as such, can present a trace of the quantum state of the circuit after each gate, compute gate equivalents for each circuit step, and perform measurements at any point in the circuit without state collapse. Output displays are in vector coefficients or Dirac bra-ket notation. It is an easy-to-use educational tool for students new to quantum computing.
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.
A quantum gate is the quantum analog of the classical logic gate of digital computers. It is a basic structural unit of a quantum circuit which operates on a small number of qubits to deliver a predefined output. A quantum circuit is a graphical representation of the sequence of the quantum gates used and the measurements performed in a quantum computation. Various quantum logic gates, namely, the Hadamard, T phase, NOT, Pauli-X, controlled NOT (CNOT), controlled-Z, SWAP and controlled phase gates as well as higher-level Toffoli and Fredkin gates are described. Conventions of reading quantum circuit diagrams are explained. Operation of a quantum full adder consisting of registers and gates is discussed, elaborating the role of the NOT gate, the sum calculation with CNOTgates and the carry C-out calculation with Toffoli gates. A primary tool used for performing arithmetic operations on a quantum computer is the quantum Fourier transform (QFT). The QFT adder and multiplier circuits are presented.