Abstract In this chapter, we shift our perspective from seeing the unitary evolution of a quantum state as a physical process that ‘just happens’ to instead seeing it as an executable operation in a programmable computer. To do this, we introduce the quantum circuit (or gate) model, which subsequently allows us to present and analyse quantum algorithms and quantum communication protocols. The universality of quantum computing – that every quantum mechanical system (composed of qubits) can be represented as such – is established, as is the closely related notion of universal gatesets. The chapter also briefly introduces some important topics in quantum compilation, in which some quantum circuit is rewritten as a functionally equivalent alternative that is more suitable (in some sense) for running on a particular quantum computer.
Abstract In this chapter, we shift our perspective from seeing the unitary evolution of a quantum state as a physical process that ‘just happens’ to instead seeing it as an executable operation in a programmable computer. To do this, we introduce the quantum circuit (or gate) model, which subsequently allows us to present and analyse quantum algorithms and quantum communication protocols. The universality of quantum computing – that every quantum mechanical system (composed of qubits) can be represented as such – is established, as is the closely related notion of universal gatesets. The chapter also briefly introduces some important topics in quantum compilation, in which some quantum circuit is rewritten as a functionally equivalent alternative that is more suitable (in some sense) for running on a particular quantum computer.
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.
Abstract In this chapter, we describe the circuit model of quantum computation, focusing on the initialization of a set of qubits, their unitary evolution, and final projective measurement. We outline Di Vincenzo’s criteria for constructing a functional quantum computer. We describe single-qubit gates and measurements, and we present two-qubit gates. We prove that single-qubit gates and a particular two-qubit gate, the CNOT gate, are universal for quantum computation. In the last part of the chapter, we present the Clifford group of unitary transformations that stabilize the Pauli group, and the Gottesman-Knill theorem.
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 chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.