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

Cambridge University Press eBooks

Quantum bits and quantum gates

E. Desurvire

Published Feb 19, 2009• 0 citations
Publisher

Abstract

This chapter represents our first step into quantum information theory (QIT). The key to operating such a transition is to become familiar with the concept of the quantum bit, or qubit , which is a probabilistic superposition of the classical 0 and 1 bits. In the quantum world, the classical 0 and 1 bits become the pure states |0〉 and |1〉, respectively. It is as if a coin can be classically in either heads or tails states, but is now allowed to exist in a superposition of both! Then I show that qubits can be physically transformed by the action of unitary matrices , which are also called operators . I show that such qubit transformations, resulting from any qubit manipulation, can be described by rotations on a 2D surface, which is referred to as the Bloch sphere . The Pauli matrices are shown to generate all such unitary transformations. These transformations are reversible , because they are characterized by unitary matrices ; this property always makes it possible to trace the input information carried by qubits. I will then describe different types of elementary quantum computations performed by elementary quantum gates, forming a veritable “zoo” of unitary operators, called I , X , Y , Z , H , CNOT, CCNOT, CROSSOVER or SWAP, controlled- U , and controlled-controlled- U . These gates can be used to form quantum circuits , involving any number of qubits, and of which several examples and tools for analysis are provided. Finally, the concept of tensor product , as progressively introduced through the above description, is eventually formalized.

DOI
10.1017/cbo9780511803758.018

Related papers

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

Introduction to Quantum Computing

Walid E. Gomaa

This presentation provides a comprehensive overview of the foundational principles of quantum computation. It begins by contrasting classical and quantum information, highlighting how quantum bits (qubits) leverage superposition, entanglement, and interference to process information in ways that surpass classical limits. The document explains the four postulates of quantum mechanics: state space (qubits as unit vectors in a Hilbert space), time evolution (via unitary operators), measurement (probabilistic collapse of the state), and composite systems (tensor products of subsystems). Key concepts such as the Bloch sphere representation, quantum gates (e.g., Hadamard, CNOT, Pauli gates), and quantum circuits are discussed, illustrating how quantum operations manipulate qubit states. The presentation also covers quantum evolution, the gate model for computation, and the universality of certain gate sets, emphasizing the potential for quantum parallelism and the transformative impact of quantum computing on fields like cryptography and optimization.

•Nov 11, 2025•0 citations

Quantum gates

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

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.

CRC Press eBooks•Nov 6, 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

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 Computers

S. Rajasekar, R. Velusamy

In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.

CRC Press eBooks•Oct 5, 2022•0 citations
This chapter represents our first step into quantum information theory (QIT). The key to operating such a transition is to become familiar with the concept of the quantum bit, or qubit , which is a probabilistic superposition of the classical 0 and 1 bits. In the quantum world, the classical 0 and 1 bits become the pure states |0〉 and |1〉, respectively. It is as if a coin can be classically in either heads or tails states, but is now allowed to exist in a superposition of both! Then I show that qubits can be physically transformed by the action of unitary matrices , which are also called operators . I show that such qubit transformations, resulting from any qubit manipulation, can be described by rotations on a 2D surface, which is referred to as the Bloch sphere . The Pauli matrices are shown to generate all such unitary transformations. These transformations are reversible , because they are characterized by unitary matrices ; this property always makes it possible to trace the input information carried by qubits. I will then describe different types of elementary quantum computations performed by elementary quantum gates, forming a veritable “zoo” of unitary operators, called I , X , Y , Z , H , CNOT, CCNOT, CROSSOVER or SWAP, controlled- U , and controlled-controlled- U . These gates can be used to form quantum circuits , involving any number of qubits, and of which several examples and tools for analysis are provided. Finally, the concept of tensor product , as progressively introduced through the above description, is eventually formalized.
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 presentation provides a comprehensive overview of the foundational principles of quantum computation. It begins by contrasting classical and quantum information, highlighting how quantum bits (qubits) leverage superposition, entanglement, and interference to process information in ways that surpass classical limits. The document explains the four postulates of quantum mechanics: state space (qubits as unit vectors in a Hilbert space), time evolution (via unitary operators), measurement (probabilistic collapse of the state), and composite systems (tensor products of subsystems). Key concepts such as the Bloch sphere representation, quantum gates (e.g., Hadamard, CNOT, Pauli gates), and quantum circuits are discussed, illustrating how quantum operations manipulate qubit states. The presentation also covers quantum evolution, the gate model for computation, and the universality of certain gate sets, emphasizing the potential for quantum parallelism and the transformative impact of quantum computing on fields like cryptography and optimization.
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.
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.
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.
In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.