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

Birkhäuser Boston eBooks

Basics of Quantum Computation

A. O. Pittenger

Published Jan 1, 2001• 14 citations
Publisher

Abstract

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.

DOI
10.1007/978-1-4612-1390-1_2

Related papers

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 Computing I

Muhammad Suhail Zubairy

A remarkable application of quantum mechanical concepts of coherent superposition and quantum entanglement is a quantum computer which can solve certain problems at speeds unbelievably faster than the conventional computer. In this chapter, the basic principles and the conditions for the implementation of the quantum computer are introduced and the limitations imposed by the probabilistic nature of quantum mechanics and the inevitable decoherence phenomenon are discussed. Next the basic building blocks, the quantum logic gates, are introduced. These include the Hadamard, the CNOT, and the quantum phase gates. After these preliminaries, the implementation of the Deutsch algorithm, quantum teleportation, and quantum dense coding in terms of the quantum logic gates are discussed. It is also shown how the Bell states can be produced and measured using a sequence of quantum logic gates.

Oxford University Press eBooks•May 7, 2020•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

Lecture Notes on Quantum Algorithms

Muhammad Faryad

These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.

arXiv:2507.11565•Jul 14, 2025•1 citation

Quantum Computing Fundamentals

Robert Hundt

This chapter introduces the fundamental concepts and rules of quantum computing. In parallel, it develops an initial, easy-to-understand Python code base for building and simulating small-scale quantum circuits and algorithms. The chapter details single qubits, superposition, quantum states with many qubits, operators, including a sizable set of important single-qubit gates and controlled gates. The Bloch sphere and the quantum circuit notation are introduced. Entanglement follows, that fascinating “spooky action at a distance,” as Einstein called it. The chapter then discusses maximally entangled Bell states, the no-cloning and no-deleting theorems, local and global phases, and uncomputation. The quantum postulates are discussed briefly as preparation for the discussion on measurements.

Cambridge University Press eBooks•Nov 20, 2025•0 citations

A Review On Quantum Technologies: From Fundamentals To Applications

Sudheshwar Singh

In this section we provide a broad overview of the basic principles of quantum mechanics and how they enable modern quantum technologies. The starting point is the concept of superposition, which allows quantum systems to be in multiple states at the same time and forms the basis of quantum computation using qubits and parallel processing of information. The conversation then turns to quantum entanglement, a non-classical effect that creates strong correlations between particles, and has applications in secure communication and quantum teleportation. Also mentioned is the quantum coherence, which preserves phase relations between quantum states and makes it possible for quantum systems to function correctly. But it is also emphasized that quantum coherence is fragile to environmental perturbations. This chapter also covers quantum measurement, taking into account the probabilistic nature of quantum mechanics, and how the act of observation results in the collapse of a quantum state to a definite outcome. These principles together constitute the theoretical basis of quantum computing, where quantum gates and algorithms and qubits take advantage of superposition, entanglement and interference to offer computational benefits over classical systems. The most important algorithms like Shor’s and Grover’s algorithms that demonstrate a considerable speed-up in solving the problem are discussed along with different models of quantum computing, such as gate, adiabatic and measurement-based models. Furthermore, the section reviews some physical realizations of quantum systems, such as superconducting qubits, trapped ions, photonic systems and topological qubits, with their advantages and difficulties. Overall, this discussion shows how the basic principles of quantum mechanics are the foundation for the development of advanced quantum technologies, while also dealing with the practical difficulties that arise in their implementation.

Nanotechnology Perceptions•Nov 10, 2014•0 citations
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 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.
A remarkable application of quantum mechanical concepts of coherent superposition and quantum entanglement is a quantum computer which can solve certain problems at speeds unbelievably faster than the conventional computer. In this chapter, the basic principles and the conditions for the implementation of the quantum computer are introduced and the limitations imposed by the probabilistic nature of quantum mechanics and the inevitable decoherence phenomenon are discussed. Next the basic building blocks, the quantum logic gates, are introduced. These include the Hadamard, the CNOT, and the quantum phase gates. After these preliminaries, the implementation of the Deutsch algorithm, quantum teleportation, and quantum dense coding in terms of the quantum logic gates are discussed. It is also shown how the Bell states can be produced and measured using a sequence of quantum logic gates.
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.
These notes begin in Chapter 1 with a review of linear algebra and the postulates of quantum mechanics, leading to an explanation of single- and multi-qubit gates. Chapter 2 explores the challenge of constructing arbitrary quantum states from given initial states, and introduces circuits for building oracles. Chapter 3 presents foundational algorithms such as entanglement creation, quantum teleportation, Deutsch-Jozsa, Bernstein-Vazirani, and Simon's algorithm. Chapters 4 and 5 cover algorithms based on the quantum Fourier transform, including phase estimation, period finding, factoring, and logarithm computation. These chapters also include complexity analysis and detailed quantum circuits suitable for implementation in code. Chapter 6 introduces Grover's algorithm for quantum search and amplitude amplification, including its realization via Hamiltonian simulation and a method for derandomization. Chapter 7 discusses basic techniques for Hamiltonian simulation, such as Lie-Trotter decomposition, sparse Hamiltonians, and the linear combination of unitaries. It also provides example circuits for simulating Hamiltonians expressed as linear combinations of Pauli operators. Chapter 8 introduces variational quantum algorithms, and Chapter 9 presents an algorithm for simulating fermionic many-particle systems, with an emphasis on molecular Hamiltonians. It also outlines the key transformations needed to map a molecular Hamiltonian to a form suitable for simulation on a quantum computer.
This chapter introduces the fundamental concepts and rules of quantum computing. In parallel, it develops an initial, easy-to-understand Python code base for building and simulating small-scale quantum circuits and algorithms. The chapter details single qubits, superposition, quantum states with many qubits, operators, including a sizable set of important single-qubit gates and controlled gates. The Bloch sphere and the quantum circuit notation are introduced. Entanglement follows, that fascinating “spooky action at a distance,” as Einstein called it. The chapter then discusses maximally entangled Bell states, the no-cloning and no-deleting theorems, local and global phases, and uncomputation. The quantum postulates are discussed briefly as preparation for the discussion on measurements.
In this section we provide a broad overview of the basic principles of quantum mechanics and how they enable modern quantum technologies. The starting point is the concept of superposition, which allows quantum systems to be in multiple states at the same time and forms the basis of quantum computation using qubits and parallel processing of information. The conversation then turns to quantum entanglement, a non-classical effect that creates strong correlations between particles, and has applications in secure communication and quantum teleportation. Also mentioned is the quantum coherence, which preserves phase relations between quantum states and makes it possible for quantum systems to function correctly. But it is also emphasized that quantum coherence is fragile to environmental perturbations. This chapter also covers quantum measurement, taking into account the probabilistic nature of quantum mechanics, and how the act of observation results in the collapse of a quantum state to a definite outcome. These principles together constitute the theoretical basis of quantum computing, where quantum gates and algorithms and qubits take advantage of superposition, entanglement and interference to offer computational benefits over classical systems. The most important algorithms like Shor’s and Grover’s algorithms that demonstrate a considerable speed-up in solving the problem are discussed along with different models of quantum computing, such as gate, adiabatic and measurement-based models. Furthermore, the section reviews some physical realizations of quantum systems, such as superconducting qubits, trapped ions, photonic systems and topological qubits, with their advantages and difficulties. Overall, this discussion shows how the basic principles of quantum mechanics are the foundation for the development of advanced quantum technologies, while also dealing with the practical difficulties that arise in their implementation.