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.
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.
This chapter delineates the theoretical and operational foundations of quantum gates, marking the radical transition from deterministic Boolean logic to the probabilistic, unitary formalism of quantum mechanics, and explores the mathematical elegance of gates as reversible operators acting within Hilbert space, where the preservation of probability amplitude fundamentally distinguishes them from irreversible classical counterparts. The discussion traverses the historical evolution of quantum computing, referencing pivotal contributions from Feynman to the Solovay–Kitaev theorem, while addressing the physical imperatives of gate fidelity and fault tolerance. Detailed analysis is provided for essential single-qubit components, including the Hadamard gate’s role in generating superposition and the Pauli group’s geometric rotations on the Bloch sphere. Furthermore, this chapter examines the Controlled-NOT gate as the critical enabler of entanglement and quantum parallelism. By synthesizing matrix algebra with physical implementation challenges—ranging from decoherence to the no-cloning theorem—this chapter establishes the necessary framework for understanding universal gate sets. Ultimately, it provides a rigorous yet accessible roadmap for constructing the complex quantum circuits that underpin advanced algorithms and error-correction protocols.
With the anticipated end of Moore’s law for integrated circuits [3, 4] fast approaching and continued advances in low-power electronics, interest in quantum computing has increased. This shifts the focus from deterministic logical circuits to potentially more powerful circuits based on controllable quantum systems. In this column, we present a mathematical tour of the quantum circuit model, beginning with reversible logic circuits and expanding to quantum circuits, gates, and measurement. We highlight quantum mechanical phenomena such as superposition, entanglement, and measurement, review the Gottesman-Knill theorem, which states that some subclasses of quantum operations can be simulated efficiently on a classical computer, and describe sets of quantum gates that are universal for quantum computation.
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.
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.
Abstract The standard stabilizer formalism provides a setting to show that quantum computations restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman–Knill theorem. This work analyzes the mathematical structure behind this theorem to find possible generalizations and derivation of constraints required for constructing a non-trivial generalized Clifford group. We prove that if the closure of the stabilizing set is dense in the set of SU(d) transformations, then the associated Clifford group is trivial, consisting only of local gates and permutations of subsystems. This result demonstrates the close relationship between the density of the stabilizing set and the simplicity of the corresponding Clifford group. We apply the analysis to investigate stabilization with binary observables for qubits and find that the formalism is equivalent to the standard stabilization for a low number of qubits. Based on the observed patterns, we conjecture that a large class of generalized stabilizer states are equivalent to the standard ones. Our results provide better insights into the structure of Gottesman–Knill-type results, consequently allowing us to draw a sharper line between quantum and classical computation.
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.