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

Wiley eBooks

Basic Concepts of Qubits

Artyom M. Grigoryan, Sos S. Agaian

Published Feb 10, 2025• 0 citations
Publisher

Abstract

This chapter describes the basic concept and operations, called gates, on qubits. It explains the mathematical model of the qubit. The chapter presents the vision of a multiplicative qubit group using qubit multiplication and division operations. One can even solve quadratic equations with qubits. In the theory of quantum computation, a quantum bit, which is called a qubit, may be in two states, 0 and 1. Mathematically, a single qubit is defined as a linear combination of these basis states with given amplitudes a 0 and a 1 . Any quantum system with only two states can be considered as a qubit. A qubit can only be measured once, and only one of its states will be the result of the measurement. The chapter provides a list of single qubit gates and their description. It illustrates two circuits for preparation of the single qubit without and with a global phase.

DOI
10.1002/9781394265183.ch2

Related papers

Fundamentals of Quantum Computation

This chapter briefly describes the basic concepts and principles of quantum computing. Firstly, the concepts of qubit, quantum coherence, quantum decoherence, quantum entanglement, quantum density operators, linear operators, inner products, outer products, tensor products, Hermite operators, and unitary operators are described. Then, the four basic assumptions of quantum mechanics are introduced, focusing on the measurement assumptions of quantum mechanics. Finally, the definition of commonly used quantum logic gates is given including single qubit gates, double qubit gates, and multiple qubit gates. These contents provide the necessary theoretical basis for subsequent chapters.

Advances in computer and electrical engineering book series•Aug 26, 2020•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

Basics of Quantum Computation

A. O. Pittenger

In this chapter we build on the basic model developed in Chapter 1 by extending the notation to handle quantum systems with multiple qubits. With that terminology in place, we can illustrate the ideas which are basic to quantum algorithms and can confirm theoretically that the unitary transformations we need can be implemented as a sequence of operations involving only one or two qubits. Quantum algorithms can be constructed using a small number of quantum gates, and we discuss those gates next. We then use quantum gates to construct an addition subroutine and complete the chapter with a teleportation subroutine, which is the first illustration of the potential importance of entanglement for communication.

Birkhäuser Boston eBooks•Jan 1, 2001•14 citations

Quantum bits and quantum gates

E. Desurvire

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.

Cambridge University Press eBooks•Feb 19, 2009•0 citations

Quantum Computation

Jaden Pieper, Manuel E. Lladser

A quantum computer is a machine that exploits quantum phenomena to store information and perform computations.\nThe chief goal of this article is to provide a brief but comprehensive introduction to quantum computing. It overviews some mathematical underpinnings of quantum computation for readers with only a basic knowledge of linear algebra and probability. However, it does not attempt to be exhaustive nor make an exposition of quantum physics. It further does not attempt to stay current with physical implementations of quantum computers.\nAfter providing a brief historical background, the article introduces the notion of a quantum bit (qubit) and the linear operators (gates) that act on these. It then addresses systems of multiple qubits and their corresponding gates. Along the way, the article covers the essential concepts of separable systems, as well quantum interference and decoherence. It also describes how to represent gates as quantum circuits. To conclude, it explains the underpinnings of two simple but insightful quantum algorithms. A final section suggests further readings for those who wish to delve deeper into quantum computing.

Scholarpedia•Jan 1, 2018•1 citation

Quantum Background

Van Meter Rodney

In order to understand the operation and importance of quantum networks, one must learn about the general principles upon which quantum computers are founded. This chapter reviews the basic concepts needed to understand quantum computing and communication, with emphasis on manipulating qubits and grasping the key idea of entanglement through the example of Bell pairs. It begins with quantum mechanics, presenting Dirac's ket notation, with a few notes on linear algebra, then states Schrödinger's equation and Hamiltonian dynamics as a fact. It then informally defines a qubit, discusses its state-vector, and Bloch sphere representations and corresponding manipulations. Two-qubit gates are explained, along with the three-qubit Toffoli and Fredkin gates. The chapter covers Bell pairs, their experimental demonstration and the no-cloning theorem. When system decoherence sets in, measurement of the system probably will not produce the desired results, causing the failure of our quantum algorithm.

Wiley eBooks•Apr 14, 2014•2 citations
This chapter describes the basic concept and operations, called gates, on qubits. It explains the mathematical model of the qubit. The chapter presents the vision of a multiplicative qubit group using qubit multiplication and division operations. One can even solve quadratic equations with qubits. In the theory of quantum computation, a quantum bit, which is called a qubit, may be in two states, 0 and 1. Mathematically, a single qubit is defined as a linear combination of these basis states with given amplitudes a 0 and a 1 . Any quantum system with only two states can be considered as a qubit. A qubit can only be measured once, and only one of its states will be the result of the measurement. The chapter provides a list of single qubit gates and their description. It illustrates two circuits for preparation of the single qubit without and with a global phase.
This chapter briefly describes the basic concepts and principles of quantum computing. Firstly, the concepts of qubit, quantum coherence, quantum decoherence, quantum entanglement, quantum density operators, linear operators, inner products, outer products, tensor products, Hermite operators, and unitary operators are described. Then, the four basic assumptions of quantum mechanics are introduced, focusing on the measurement assumptions of quantum mechanics. Finally, the definition of commonly used quantum logic gates is given including single qubit gates, double qubit gates, and multiple qubit gates. These contents provide the necessary theoretical basis for subsequent chapters.
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.
In this chapter we build on the basic model developed in Chapter 1 by extending the notation to handle quantum systems with multiple qubits. With that terminology in place, we can illustrate the ideas which are basic to quantum algorithms and can confirm theoretically that the unitary transformations we need can be implemented as a sequence of operations involving only one or two qubits. Quantum algorithms can be constructed using a small number of quantum gates, and we discuss those gates next. We then use quantum gates to construct an addition subroutine and complete the chapter with a teleportation subroutine, which is the first illustration of the potential importance of entanglement for communication.
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.
A quantum computer is a machine that exploits quantum phenomena to store information and perform computations.\nThe chief goal of this article is to provide a brief but comprehensive introduction to quantum computing. It overviews some mathematical underpinnings of quantum computation for readers with only a basic knowledge of linear algebra and probability. However, it does not attempt to be exhaustive nor make an exposition of quantum physics. It further does not attempt to stay current with physical implementations of quantum computers.\nAfter providing a brief historical background, the article introduces the notion of a quantum bit (qubit) and the linear operators (gates) that act on these. It then addresses systems of multiple qubits and their corresponding gates. Along the way, the article covers the essential concepts of separable systems, as well quantum interference and decoherence. It also describes how to represent gates as quantum circuits. To conclude, it explains the underpinnings of two simple but insightful quantum algorithms. A final section suggests further readings for those who wish to delve deeper into quantum computing.
In order to understand the operation and importance of quantum networks, one must learn about the general principles upon which quantum computers are founded. This chapter reviews the basic concepts needed to understand quantum computing and communication, with emphasis on manipulating qubits and grasping the key idea of entanglement through the example of Bell pairs. It begins with quantum mechanics, presenting Dirac's ket notation, with a few notes on linear algebra, then states Schrödinger's equation and Hamiltonian dynamics as a fact. It then informally defines a qubit, discusses its state-vector, and Bloch sphere representations and corresponding manipulations. Two-qubit gates are explained, along with the three-qubit Toffoli and Fredkin gates. The chapter covers Bell pairs, their experimental demonstration and the no-cloning theorem. When system decoherence sets in, measurement of the system probably will not produce the desired results, causing the failure of our quantum algorithm.