Fundamentals of Quantum Concepts
Open in the Padhaiko app1.1 Classical versus Quantum computation
Information processing is inextricably tied to the laws of physical reality. Classical computation is founded upon the laws of classical mechanics and Boolean logic, while quantum computation harnesses the foundational principles of quantum mechanics—namely linear superposition, interference, and entanglement—to process information in ways that are fundamentally unattainable by classical Turing machines.
In classical digital computers, the basic indivisible unit of information is the bit (binary digit), which strictly exists in one of two mutually exclusive physical states: (e.g., low voltage, ) or (e.g., high voltage, ). A register of classical bits represents exactly one deterministic integer out of possible configurations at any single instant in time.
In contrast, the fundamental unit of quantum information is the qubit (quantum bit). A qubit is a two-level quantum system described by a state vector residing in a two-dimensional complex Hilbert space . By the principle of linear superposition, a qubit can exist simultaneously as a linear combination of its basis states and :
An -qubit quantum register spans a -dimensional complex Hilbert space . Such a register can store a simultaneous superposition of all basis strings:
| Aspect | Classical Computation | Quantum Computation |
|---|---|---|
| Fundamental Unit | Classical bit ( or ) | Quantum bit / qubit () |
| State Space Dimension | bits store exactly one of states | qubits span a -dimensional complex Hilbert space |
| Physical Operations | Boolean logic gates (AND, OR, NOT, NAND); often irreversible | Unitary transformations (); strictly reversible (except measurement) |
| Information Duplication | Arbitrary copying and fan-out freely permitted | Prohibited by the fundamental No-Cloning Theorem |
| Parallelism Mechanism | Physical replication of processors (multi-core / distributed) | Quantum parallelism via coherent superposition of basis states in qubits |
| Interference | Absent; probabilities sum additively | Constructive and destructive interference of probability amplitudes |
| Core Complexity Class | (deterministic polynomial) and (bounded-error probabilistic) | (bounded-error quantum polynomial-time) |
Extended Church-Turing Thesis and Quantum Advantage
The classical Extended Church-Turing Thesis (ECTT) asserts that any physically realizable computational model can be efficiently simulated on a standard probabilistic Turing machine with at most a polynomial slowdown. Quantum computation presents the only known physically grounded challenge to the ECTT:
- Shor's Algorithm: Factors an -bit integer in operations on a quantum computer, whereas the fastest known classical algorithm (the General Number Field Sieve) requires sub-exponential time .
- Grover's Algorithm: Searches an unstructured database of items in queries, establishing a provable quadratic quantum speedup over the optimal classical lower bound .
1.2 Qubits, superposition, measurement
Mathematical Formulation of a Qubit
Qubit, State Vector, and Normalization
A qubit is a mathematical object corresponding to a unit vector in a two-dimensional complex Hilbert space . The standard orthonormal basis for this space, called the computational basis, is designated by the Dirac ket vectors:
Any arbitrary pure state of a qubit is represented as a linear superposition:
where the coefficients are complex probability amplitudes. Because the total probability of all mutually exclusive measurement outcomes must equal unity, the state vector must satisfy the normalization condition:
The Superposition Principle
The superposition principle states that if and are physically valid configurations of a quantum system, any normalized linear combination is also a physically realizable quantum state. Unlike classical probabilities, the amplitudes and can take negative or complex values, allowing quantum amplitudes to interfere constructively (increasing probability) or destructively (canceling probability).
Two canonical equal-superposition states created by applying the Hadamard gate to computational basis states are:
Quantum Measurement and Born's Rule
Born Rule and State Collapse
When a qubit in state is measured in the computational basis :
- Measurement Outcome: The measurement yields only a single classical discrete bit: either or .
- Born's Rule: The probability of observing outcome is the squared modulus of amplitude , and the probability of observing outcome is the squared modulus of amplitude :
- Wavefunction Collapse (Projection): Measurement is fundamentally invasive. If the measurement yields , the state vector instantly collapses to ; if it yields , it collapses to :
Subsequent immediate measurements of the same qubit will yield the identical outcome with probability .
Global Phase vs. Relative Phase
Consider two states: and , where . The factor is called an overall or global phase. For any measurement operator , the expectation value satisfies:
Therefore, a global phase has no observable physical consequences and can be disregarded.
In contrast, in the state , the angle is the relative phase between the basis states. The relative phase cannot be eliminated and has profound physical effects, dictating whether interference in subsequent gates will be constructive or destructive (for example, distinguishing from ).
1.3 Postulates of quantum mechanics
The mathematical framework of quantum computation is rigorously formulated through four foundational postulates (Nielsen & Chuang):
The Four Postulates of Quantum Mechanics
The operational principles governing any closed or measured quantum system are summarized as follows:
- Postulate 1 (State Space): Associated with any isolated physical system is a complex vector space equipped with an inner product (a Hilbert space ). The state of the system is completely described by a unit vector such that .
- Postulate 2 (Evolution): The state transition of a closed quantum system over a discrete time step is described by a unitary operator acting on :
In continuous time, the evolution is governed by the Schrödinger equation:
where is Planck's reduced constant and is a Hermitian operator known as the Hamiltonian of the system.
- Postulate 3 (Quantum Measurement): Quantum measurements are described by a set of measurement operators acting on . The index refers to the measurement outcomes that may occur. The measurement operators satisfy the completeness equation:
If the state of the quantum system is immediately before the measurement, then the probability that outcome occurs is:
and the post-measurement state of the system is:
- Postulate 4 (Composite Systems): The state space of a composite physical system composed of distinct subsystems is the tensor product of the individual state spaces:
If system is prepared in state , the joint state of the composite system is:
| Postulate | Physical Entity | Mathematical Formalism | Core Constraint |
|---|---|---|---|
| Postulate 1 | State of a System | Unit vector in Hilbert space | (Normalization) |
| Postulate 2 | Dynamic Evolution | Unitary operator or Hamiltonian | ; (Reversibility) |
| Postulate 3 | Measurement / Readout | Operator collection | ; |
| Postulate 4 | Multipartite System | Tensor product | Joint state spans product space |
1.4 Dirac notation and Bloch sphere
Dirac (Bra-Ket) Notation
Paul Dirac introduced bra-ket notation to express vectors, linear functionals, and operators in Hilbert space:
- Ket Vector (): Denotes a column vector representing a quantum state:
- Bra Vector (): The Hermitian conjugate (conjugate transpose) of , representing a dual row vector:
- Inner Product (Bracket ): The scalar product mapping two vectors to a complex scalar:
- Orthonormality of computational basis: , , , .
- Outer Product (): Constructs a linear operator (matrix):
- Completeness Relation (Resolution of Identity): For any orthonormal basis :
The Bloch Sphere
Every single pure qubit state can be parameterized up to an unobservable global phase using two real spherical angles and :
Bloch Sphere Representation and Bloch Vector
Setting and , any pure single-qubit state can be written uniquely as:
where:
- represents the polar angle (colatitude) from the positive -axis.
- represents the azimuthal angle (longitude) in the -plane from the positive -axis.
This defines a point on the surface of a three-dimensional unit sphere called the Bloch sphere. The corresponding unit Bloch vector has coordinates:
with Euclidean norm for all pure states.
| Quantum State | Dirac Notation | Polar Angle | Azimuthal Angle | Bloch Vector | Location on Sphere |
|---|---|---|---|---|---|
| Undefined () | North Pole () | ||||
| Undefined () | South Pole () | ||||
| Positive -axis | |||||
| Negative -axis | |||||
| Positive -axis | |||||
| Negative -axis |
Worked Examples
1.1
A quantum state is given by , where is a real, positive normalization constant.
- Determine the exact value of .
- Calculate the probability of measuring outcome and outcome in the computational basis.
- State the post-measurement state vector if the measurement result is .
Evaluating the Normalization Factor : By Postulate 1 of quantum mechanics, any physical state vector must have unit norm :
Equating to :
Thus, the fully normalized state vector is:
Calculating Measurement Probabilities: According to Born's rule, the measurement probabilities are the absolute squares of the respective probability amplitudes:
Checking total probability:
Post-Measurement State: If the measurement yields result , the state collapses instantaneously into the corresponding basis state:
- Normalization constant:
- Probabilities: ,
- Post-measurement state for outcome :
1.2
Consider the normalized quantum state:
- Find the Bloch sphere spherical coordinates .
- Calculate the Cartesian components of the corresponding Bloch vector .
Finding the Polar Angle : The general Bloch representation is:
Matching the coefficient of :
Consequently:
Finding the Azimuthal Angle : Matching the coefficient of :
Multiplying both sides by :
Therefore:
Computing Cartesian Components : Using the spherical-to-Cartesian transformations:
Verification of unit length:
- Bloch angles: radians (), radians ()
- Bloch vector:
1.3
For the quantum state :
- Compute the expectation value of the Pauli-Z operator, .
- Compute the expectation value of the Pauli-X operator, .
Expectation Value of Pauli : The Pauli-Z matrix is . Its action on the computational basis vectors is and . Applying to :
Taking the inner product with :
Action of Pauli on the State: The Pauli-X matrix is , acting as a bit-flip: and . Applying to :
Expectation Value of Pauli : Taking the inner product :
- (or )
- (or )
Practice Exercises
Practice Exercises — Fundamentals of Quantum Concepts
A quantum system is prepared in the state:
- Verify that the state is properly normalized by computing .
- Calculate the probability of obtaining outcome and outcome if measured in the computational basis.
Verifying Normalization: The norm of the state vector is given by the inner product :
Since :
The state is strictly normalized.
Calculating Probabilities: By Born's rule:
- Normalization verified:
- Probabilities: ,
A qubit is in the state:
- Determine the Bloch sphere angles .
- Write down the corresponding Cartesian Bloch vector .
Determining the Polar Angle : Comparing with :
Determining the Azimuthal Angle : Since :
Therefore:
Computing the Cartesian Bloch Vector: Using the parameterization :
Thus , which corresponds to the state situated along the positive -axis on the equator of the Bloch sphere.
- Angles: radians (), radians ()
- Bloch vector: (along the axis)
A qubit in the state is measured using projective measurement operators and .
- Calculate the probabilities and using Postulate 3 of quantum mechanics.
- Determine the post-measurement state vector for each outcome.
Calculating Probabilities via Projectors: Under Postulate 3, for projective measurements , the probability of outcome is given by :
Evaluating Post-Measurement Collapsed States: By Postulate 3, the post-measurement state is :
For outcome :
For outcome :
- Probabilities: ,
- Post-measurement states: For outcome , ; for outcome ,
In computational basis Dirac notation:
- Write the matrix representations for the outer products , , , and .
- Show that (completeness) and (Pauli-X bit-flip operator).
Matrix Representations of Outer Products: With , , , and :
Proving Completeness and Pauli-X Equivalence: Summing the diagonal outer products:
Summing the off-diagonal outer products:
- Outer products:
- Verified: and
Explain the operational difference between global phase and relative phase. Specifically:
- Explain why and represent the same physical state.
- Explain why is physically distinguishable from , and calculate the inner product .
Global Phase Equivalence of and : Notice that . Here, is an overall global phase factor. The density matrix for is:
The density matrix for is:
Because density matrices encode all measurable statistical properties of a quantum system, any measurement outcome on and yields identical probability distributions. Hence, they describe the exact same physical state.
Physical Distinguishability of Relative Phase in : In , the phase factor applies only to the basis state. This is a relative phase. Evaluating the inner product:
Because , and are mutually orthogonal states in Hilbert space. A measurement in the Hadamard basis will distinguish them with certainty ( probability).
- differs only by an unobservable global phase factor , yielding identical density matrices .
- has a relative phase of between and , making it strictly orthogonal to with , allowing deterministic discrimination in the basis.