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

Oxford University Press eBooks

A Quantum Model of Computation

Phillip Kaye, Raymond Laflamme, Michele Mosca

Published Nov 16, 2006• 0 citations
Publisher

Abstract

In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50

DOI
10.1093/oso/9780198570004.003.0007

Related papers

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

Benjamin W. Schumacher, Michael D. Westmoreland

Quantum circuits If the state of a quantum system is a kind of information, then the dynamics of that system is a kind of information processing. This is the basic idea behind quantum computing , which seeks to exploit the physics of quantum systems to do useful information processing. In this chapter we will acquaint ourselves with a few of the ideas of quantum computing, using the idealized quantum circuit model. Then we will turn our attention to an actual quantum process, nuclear magnetic resonance , that can be understood as a realization of quantum information processing. In a quantum circuit, we have a set of n qubit systems whose dynamical evolution is completely under our control. We represent the evolution as a sequence of unitary operators, each of which acts on one or more of the qubits. Graphically, we represent the qubits as a set of horizontal lines, and the various stages of their evolution as a series of boxes or other symbols showing the structure of the sequence of operations. In such a diagram, time runs from left to right (see Fig. 18.1.). The n qubits form a kind of “computer,” and its overall evolution amounts to a “computation.” The key idea is that very complicated unitary operations on the n qubits can be built up step-by-step from many simple operations on one, two or a few qubits.

Cambridge University Press eBooks•Mar 25, 2010•1 citation

Quantum Gates and Circuits

Radhika Vathsan

We are now ready to see how computing with qubits can be done. In this book, we will mainly use the circuit model for computation which was first introduced by Deutsch [25]. We will represent by quantum “wires,” the qubits upon which manipulations. The length of the wire is to be interpreted as the time axis. Manipulations on qubits can be done using basic unitary operators that are the equivalents of logic “gates.” An algorithm, or a complete set of steps for achieving a processing task, is a combination of wires and gates representing a quantum circuit. This circuit must be thought of as a time sequence of events with every wire a way of representing qubit states, and with gates representing processing of those states.

CRC Press eBooks•Jul 21, 2015•3 citations

Self-Referential Quantum Circuits for Universal Computation

Jincheng Zhang

This paper explores a novel approach to quantum computation centered around self-referential quantum circuits. The core concept involves designing circuits that recursively incorporate themselves into their operational structure, effectively creating computational modules capable of self-replication. This is achieved through the strategic implementation of feedback loops and entanglement within the circuit architecture. The potential benefits of this paradigm include a reduction in circuit complexity and the possibility of constructing universal quantum computers from fundamentally simpler components. The theoretical framework presented herein outlines the key principles and mathematical underpinnings of this self-referential design, proposing a pathway toward more efficient and scalable quantum computation. The presented model uses the following notation: |ψ⟩ represents a quantum state, U(θ) represents a unitary operator with rotation angle θ, C represents a quantum circuit, and E represents the expectation value. Specifically, the expectation value of an observable A is denoted as E[A] = <ψ|A|ψ>, where |ψ> is the quantum state. The Hamiltonian of a quantum system is typically represented as H, and the time evolution of the state is governed by the Schrödinger equation: iℏ∂|ψ(t)⟩/∂t = H|ψ(t)⟩. Entanglement is represented by the Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Quantum gates, such as the Hadamard gate (H) and the CNOT gate (CN), are represented as unitary transformations. The circuit representation involves sequential application of gates, and the overall unitary transformation is the product of these gates. The circuit depth, denoted as d, represents the number of consecutive gate operations applied to a quantum state. The circuit complexity, denoted as C, is a measure of the number of gates required to implement a specific quantum algorithm. The circuit fidelity, denoted as F, quantifies the accuracy of a quantum circuit's output, ranging from 0 to 1. We define the quantum state preparation as |ψ⟩ = ∑i ci|i⟩, where ci are complex coefficients and |i⟩ are the computational basis states. The unitary transformation is defined as U|ψ⟩ = ∑i (Uici)|i⟩, where Ui are the matrix elements of the unitary operator U. The propagation of quantum states through a circuit is represented by the Schrödinger equation, and the final state is obtained by applying the unitary transformation to the initial state. The concept of quantum coherence, denoted as χ, represents the ability of a quantum system to maintain its superposition state. The fidelity of a quantum state is defined as the probability that a measurement will yield the expected outcome.

•Sep 4, 2026•0 citations

Quantum information processing

Stephen Mark Barnett

We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.

Oxford University Press eBooks•May 28, 2009•11 citations
In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50
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 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.
Quantum circuits If the state of a quantum system is a kind of information, then the dynamics of that system is a kind of information processing. This is the basic idea behind quantum computing , which seeks to exploit the physics of quantum systems to do useful information processing. In this chapter we will acquaint ourselves with a few of the ideas of quantum computing, using the idealized quantum circuit model. Then we will turn our attention to an actual quantum process, nuclear magnetic resonance , that can be understood as a realization of quantum information processing. In a quantum circuit, we have a set of n qubit systems whose dynamical evolution is completely under our control. We represent the evolution as a sequence of unitary operators, each of which acts on one or more of the qubits. Graphically, we represent the qubits as a set of horizontal lines, and the various stages of their evolution as a series of boxes or other symbols showing the structure of the sequence of operations. In such a diagram, time runs from left to right (see Fig. 18.1.). The n qubits form a kind of “computer,” and its overall evolution amounts to a “computation.” The key idea is that very complicated unitary operations on the n qubits can be built up step-by-step from many simple operations on one, two or a few qubits.
We are now ready to see how computing with qubits can be done. In this book, we will mainly use the circuit model for computation which was first introduced by Deutsch [25]. We will represent by quantum “wires,” the qubits upon which manipulations. The length of the wire is to be interpreted as the time axis. Manipulations on qubits can be done using basic unitary operators that are the equivalents of logic “gates.” An algorithm, or a complete set of steps for achieving a processing task, is a combination of wires and gates representing a quantum circuit. This circuit must be thought of as a time sequence of events with every wire a way of representing qubit states, and with gates representing processing of those states.
This paper explores a novel approach to quantum computation centered around self-referential quantum circuits. The core concept involves designing circuits that recursively incorporate themselves into their operational structure, effectively creating computational modules capable of self-replication. This is achieved through the strategic implementation of feedback loops and entanglement within the circuit architecture. The potential benefits of this paradigm include a reduction in circuit complexity and the possibility of constructing universal quantum computers from fundamentally simpler components. The theoretical framework presented herein outlines the key principles and mathematical underpinnings of this self-referential design, proposing a pathway toward more efficient and scalable quantum computation. The presented model uses the following notation: |ψ⟩ represents a quantum state, U(θ) represents a unitary operator with rotation angle θ, C represents a quantum circuit, and E represents the expectation value. Specifically, the expectation value of an observable A is denoted as E[A] = <ψ|A|ψ>, where |ψ> is the quantum state. The Hamiltonian of a quantum system is typically represented as H, and the time evolution of the state is governed by the Schrödinger equation: iℏ∂|ψ(t)⟩/∂t = H|ψ(t)⟩. Entanglement is represented by the Bell state |Φ⁺⟩ = (|00⟩ + |11⟩)/√2. Quantum gates, such as the Hadamard gate (H) and the CNOT gate (CN), are represented as unitary transformations. The circuit representation involves sequential application of gates, and the overall unitary transformation is the product of these gates. The circuit depth, denoted as d, represents the number of consecutive gate operations applied to a quantum state. The circuit complexity, denoted as C, is a measure of the number of gates required to implement a specific quantum algorithm. The circuit fidelity, denoted as F, quantifies the accuracy of a quantum circuit's output, ranging from 0 to 1. We define the quantum state preparation as |ψ⟩ = ∑i ci|i⟩, where ci are complex coefficients and |i⟩ are the computational basis states. The unitary transformation is defined as U|ψ⟩ = ∑i (Uici)|i⟩, where Ui are the matrix elements of the unitary operator U. The propagation of quantum states through a circuit is represented by the Schrödinger equation, and the final state is obtained by applying the unitary transformation to the initial state. The concept of quantum coherence, denoted as χ, represents the ability of a quantum system to maintain its superposition state. The fidelity of a quantum state is defined as the probability that a measurement will yield the expected outcome.
We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.