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

CRC Press eBooks

Qubits, Gates, and Circuits

Eduardo R. Mucciolo

Published Aug 6, 2025• 0 citations
Publisher

Abstract

Before we start to discuss quantum bits (“qubits” for short), let us spend some time reviewing classical bits, which we will simply call bits, and the types of operations one can perform with them.
DOI
10.1201/9781003485124-5

Related papers

Quantum bits and quantum gates

Jonathan A. Jones, Dieter Jaksch

Classical information processing is performed using bits , which are just two-state systems, with the two states called 0 and 1. By grouping bits togetherwe can represent arbitrary pieces of information, and by manipulating these bits we can perform arbitrary computations. The corresponding basic element used in quantum information is the quantum bit, or qubit . This is simply a quantum system with two orthonormal basis states, which we shall call |0⧽ and |1⧽. There are many possible physical implementations of a qubit, such as spin states of electrons or atomic nuclei, charge states of quantum dots, atomic energy levels, vibrational states of groups of atoms, polarization states of photons, or paths in an interferometer. At this stage the physical implementation is not important: the idea of a qubit is to abstract the discussion away from physical details. Taking the standard approach of quantum information theory, we shall begin by not worrying too much about the properties of these states, or even what their energies are; we shall simply assume that they are eigenstates of the system's Hamiltonian with known eigenvalues (that is, known energies). This approach allows us to concentrate on the fundamental properties of the system, without considering all the tedious details. We can in principle perform classical information processing on our quantum system by using the two states |0⧽ and |1⧽ as our logical states 0 and 1 and proceeding in the usual fashion, giving rise to the field of reversible computing , which will be explored briefly in Part II. This, however, misses the point.

Cambridge University Press eBooks•Jul 19, 2012•0 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 Gates, Quantum Circuit and Quantum Computa- tion

Mikio Nakahara

Now that we have introduced qubits to store information, it is time to consider operations acting on them. If they are simple, these operations are called gates, or more precisely quantum gates, in analogy with those in classical logic circuits. More complicated quantum circuits are composed of these simple gates. A collection of quantum circuits for executing a complicated algorithm, a quantum algorithm, is a part of a quantum computation.

CRC Press eBooks•Mar 11, 2008•1 citation

The Qubit and Quantum State

Johnny Hooyberghs

Now that you have a basic idea on what quantum computing is all about, let’s dive a little deeper into the logical qubit, its implementation, and the actual quantum state it should represent.

Apress eBooks•Dec 8, 2021•0 citations

Creating subgroups of U(2w) for quantum-minus computers

Alexis De Vos, Michiel Boes

Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S 2 w ; quantum computers on w qubits are isomorphic to the (Lie) unitary group U(2 w ). We investigate and classify groups X which represent computers intermediate between classical reversible computers and quantum computers. Such intermediate groups X may exist in three flavours: finite groups of order larger than (2 w )!, infinite but discrete groups, and Lie groups of dimension smaller than (2 w ). For our purpose, we start from 1-qubit transformations, represented by 2 × 2 unitary matrices. We call this group the creator. Its members are called gates and act on one qubit. Controlled gates are quantum circuits acting on w qubits, such that the 1-qubit transformation (applied to a particular qubit) depends on the state of the w − 1 other qubits. The controlled gates generate the group X of 2 w × 2 w matrices, called the creation. We discuss all creators of order up to 8. Additionally a creator of order 16 and one of order 192 are discussed.

Journal of Physics Conference Series•Mar 1, 2011•1 citation

Classical Bits and Classical Gates

Binayak Samadder Choudhury, Soumen Samanta

In this chapter, a review of concepts of classical bits and gates. It is required for a correlation with the corresponding quantum concepts given in later chapters. References [ 54 , 55 , 147 , 155 ] are useful for an in-depth study on the subjects of the chapter.

Chapman & Hall/CRC eBooks•Dec 10, 2025•0 citations
Classical information processing is performed using bits , which are just two-state systems, with the two states called 0 and 1. By grouping bits togetherwe can represent arbitrary pieces of information, and by manipulating these bits we can perform arbitrary computations. The corresponding basic element used in quantum information is the quantum bit, or qubit . This is simply a quantum system with two orthonormal basis states, which we shall call |0⧽ and |1⧽. There are many possible physical implementations of a qubit, such as spin states of electrons or atomic nuclei, charge states of quantum dots, atomic energy levels, vibrational states of groups of atoms, polarization states of photons, or paths in an interferometer. At this stage the physical implementation is not important: the idea of a qubit is to abstract the discussion away from physical details. Taking the standard approach of quantum information theory, we shall begin by not worrying too much about the properties of these states, or even what their energies are; we shall simply assume that they are eigenstates of the system's Hamiltonian with known eigenvalues (that is, known energies). This approach allows us to concentrate on the fundamental properties of the system, without considering all the tedious details. We can in principle perform classical information processing on our quantum system by using the two states |0⧽ and |1⧽ as our logical states 0 and 1 and proceeding in the usual fashion, giving rise to the field of reversible computing , which will be explored briefly in Part II. This, however, misses the point.
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.
Classical reversible computers on w bits are isomorphic to the (finite) symmetric group S 2 w ; quantum computers on w qubits are isomorphic to the (Lie) unitary group U(2 w ). We investigate and classify groups X which represent computers intermediate between classical reversible computers and quantum computers. Such intermediate groups X may exist in three flavours: finite groups of order larger than (2 w )!, infinite but discrete groups, and Lie groups of dimension smaller than (2 w ). For our purpose, we start from 1-qubit transformations, represented by 2 × 2 unitary matrices. We call this group the creator. Its members are called gates and act on one qubit. Controlled gates are quantum circuits acting on w qubits, such that the 1-qubit transformation (applied to a particular qubit) depends on the state of the w − 1 other qubits. The controlled gates generate the group X of 2 w × 2 w matrices, called the creation. We discuss all creators of order up to 8. Additionally a creator of order 16 and one of order 192 are discussed.