Abstract This chapter introduces the four postulates of quantum mechanics: state space, evolution, and composition – which are associated with isolated quantum mechanical systems, and measurement, which defines what happens when information is extracted from a quantum mechanical system. Several important theoretical results concerning measurement are given, including the violation of the Bell inequalities, which establishes the profoundly non-classical nature of entanglement. This chapter also introduces qubits, which constitute the building blocks for the majority of quantum algorithms, and the Bloch sphere is presented as a convenient way of picturing a single-qubit state.
Abstract This chapter introduces the four postulates of quantum mechanics: state space, evolution, and composition – which are associated with isolated quantum mechanical systems, and measurement, which defines what happens when information is extracted from a quantum mechanical system. Several important theoretical results concerning measurement are given, including the violation of the Bell inequalities, which establishes the profoundly non-classical nature of entanglement. This chapter also introduces qubits, which constitute the building blocks for the majority of quantum algorithms, and the Bloch sphere is presented as a convenient way of picturing a single-qubit state.
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 builds the formal structure of quantum mechanics on the basis of five postulates. These postulates unify and formalize the concepts of matrix and wave mechanics introduced in Chapter 1. The first three postulates provide the framework for mathematical modelling of isolated systems and observables. The fourth postulate establishes relationship between theoretical description and experimental observations. Describing time evolution of a system is the content of the fifth postulate. The formalism is then extended to describe a composite system in terms of its constituent subsystems. The formalism for describing a subsystem of a composite system, leading to the concept of density operator, is developed in Chapter 6. Postulate 1: On Representing an Isolated System An isolated system is described by a vector in the Hilbert space. The vectors differing only by a multiplying constant represent the same physical state. A vector representing the state of a system is also referred to as a state vector. The implications of this postulate are • The concept of the Hilbert space has been introduced in Chapter 2. Following the notation therein, the state of an isolated system according to the postulate in question is represented by a ket . A particular state is characterized by a label inside the ket. Thus, stands for a particular state of a given system.
In general, all forms of information processing can be considered in a quantum mechanical context, including for example communication, channel capacities, and the quantum limits to information extraction. In this chapter we introduce the basic features of quantum information processing. We first present qubits as abstractions of two-level addressable quantum systems, before generalizing this concept to higher-dimensional qudit systems, and continuous variables. We introduce the stabilizer formalism towards the beginning of our discussion as a convenient way to track quantum information. In Section 2.2 we derive the no-cloning theorem, which leads us to cryptography, teleportation, and quantum repeaters. Section 2.3 describes quantum computing with qubits. We start with a brief description of the circuit model, and use it to define cluster states and the one-way model. We study the properties of cluster states and discuss error correction. In the last section we introduce quantum computing over continuous variables. Quantum information Classically, information is carried by ‘bits’, which are physical systems that have two (macroscopic) states denoted by 0 and 1. These bits are described classically, which immediately raises the question of how we should extend this information-theoretic description to the quantum mechanical case. This will lead to the quantum unit of information, the quantum bit or ‘qubit’. 2.1.1 Classical and quantum bits We can define the qubit as a two-dimensional quantum system, which means that the state space of the system is a two-dimensional complex Hilbert space ℋ.
Abstract This chapter reviews all the rules of quantum mechanics and their mathematical notation. It also considers quantum entanglement, a fundamental resource in quantum information. There are four basic postulates of quantum mechanics, that indicate how to represent physical systems, how to represent observations, how to carry out measurements, and how systems evolve when “not measured”. Before describing the laws of quantum mechanics, their mathematical background is first described, along with a Mach Zehnder interferometer experiment in which the (strange) readings on the detectors can be explained by quantum mechanics. This chapter also discusses the Dirac notation, qubits, Hilbert spaces, projective measurements and operations, unitary operations, eigenvectors and eigenvalues, spectral decomposition, applications of the spectral theorem, Dirac notation shorthands, and mixed states.
Quantum computing represents a fundamentally new paradigm in information processing, in which information is encoded and manipulated using two-level quantum systems known as qubits, whose evolution is governed by the principles of quantum mechanics. This chapter presents a structured introduction to the theoretical foundations of quantum computation, beginning with the limitations of classical computation and the physical constraints that motivate the need for a quantum model of computation. We develop the mathematical framework required to describe quantum information, introducing qubits as state vectors in Hilbert space and examining the roles of superposition, measurement, and unitary evolution. Single-qubit operations are presented through the Pauli and Hadamard gates, along with their geometric interpretation on the Bloch sphere. Building on this formalism, the discussion is extended to multi-qubit systems using tensor products, and quantum entanglement is introduced as a non-classical correlation fundamental to quantum information processing. The chapter then explores quantum algorithms, focusing on Grover’s unstructured search algorithm, to demonstrate how superposition, interference, and entanglement can be harnessed to achieve computational advantages over classical approaches. Finally, the chapter discusses applications of quantum computation, including quantum simulation, cryptography, search and optimization problems, and near-term hybrid quantum algorithms such as the Variational Quantum Eigensolver (VQE)and the Quantum Approximate Optimization (QAO) Algorithm, highlighting their relevance in the noisy intermediate-scale quantum (NISQ) era.
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.