QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 1

QUANTUM COMPUTING
Complete Study Guide

From Absolute Zero to Algorithm Mastery

Principles · Tensor Products · Entanglement

Deutsch-Jozsa · Bernstein-Vazirani · Simon's Algorithm

Foundation Self-Tests (Levels 1 & 2)

Build strong intuition. Solve the math. Ace any exam.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 2

■ Table of Contents
Everything in this guide, in order

Chapter 1 — Principles of Quantum Computation

• Qubit & Superposition
• Measurement
• Phase
• Interference
• Quantum Gates
• Quantum Parallelism
• Entanglement overview

Chapter 2 — Tensor Products — Deep Understanding

• Why tensor product?
• Mathematical rule
• Multi-qubit states
• Step-by-step examples

Chapter 3 — Entanglement — Complete Mastery

• Definition & detection
• Measurement behavior
• How to check (trick)
• Best analogies

Chapter 4 — Quantum Algorithms

• Deutsch-Jozsa Algorithm
• Bernstein-Vazirani Algorithm
• Simon's Algorithm
• Comparison table

Chapter 5 — Self-Test — Level 1 (Foundation)

• Section A: Conceptual
• Section B: Mathematical
• Section C: Tensor Product
• Section D: Entanglement
• Section E: High-Level Thinking

Chapter 6 — Self-Test — Level 2 (Advanced / Exam-Ready)

• Section A: Deep Conceptual
• Section B: Tricky Mathematics
• Section C: Gates Deep-Dive
• Section D: Multi-Qubit Thinking
• Section E: Entanglement
• Section F: High-Level + Bonus

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 3

CH 1
Principles of Quantum
Computation
The absolute foundation — master this before everything else.

1.1 What is a Qubit?

A classical bit is the simplest unit of information in classical computing. It can be either 0 or 1 —
nothing in between. A qubit (quantum bit) is the quantum equivalent, but it can exist in a
superposition of both 0 and 1 simultaneously until it is measured.

Mathematical Representation of a Qubit:

|ψ■ = α|0■ + β|1■

Where α and β are complex numbers called amplitudes.

Normalization condition: |α|2 + |β|2 = 1

• |α|2 = Probability of measuring 0 • |β|2 = Probability of measuring 1 • The amplitudes α,

β can be complex numbers — this is key to phase!

Why Complex Amplitudes?

Real numbers can be positive or negative. Complex numbers add an extra dimension — a phase
angle. Two states can have identical probabilities but completely different phases. This is invisible
during measurement but crucial for interference, which is the engine behind quantum speedup.

KEY INSIGHT:

A qubit stores MORE than just a probability. It stores amplitude information that carries
phase. Phase drives interference. Interference creates quantum advantage. Without
understanding phase, you cannot understand quantum algorithms.

1.2 Superposition
Superposition means a qubit exists in multiple states at the same time. But be careful — this is not
the same as saying 'it's 50% likely to be 0'. Superposition is a fundamentally different physical reality.

The most famous superposition state is created by the Hadamard gate:

H|0■ = (1/√2)(|0■ + |1■)

H|1■ = (1/√2)(|0■ − |1■)

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 4

Both states have 50% probability of measuring 0 or 1. But they are physically different
states because their phases differ. In the second state, the |1■ component has a
negative phase (−1).

COMMON MISTAKE:

Superposition is NOT the same as 'being randomly 0 or 1'. A coin spinning in the air is
random; it has a definite state you just don't know it. A qubit in superposition has NO
definite state — it truly is both simultaneously until measurement forces it to choose.

1.3 Measurement
When you measure a qubit, its superposition collapses into one of the basis states (0 or 1). The
probabilities are determined by the amplitudes:

P(0) = |α|2

P(1) = |β|2

After measurement, the qubit is no longer in superposition — it has collapsed to a definite

0 or 1. This is why measurement is irreversible and must be the LAST step.

1.4 Phase
Phase is an angle that determines how amplitudes interfere. Consider these two states:

State A: (1/√2)(|0■ + |1■) [phase = 0°]

State B: (1/√2)(|0■ − |1■) [phase = 180°]

Both give 50/50 when measured. But when passed through another Hadamard gate: •
State A → returns to |0■ • State B → returns to |1■ Phase encodes information invisibly.
Gates can manipulate phase. Measurement destroys phase information — you only see
probabilities.

1.5 Interference
Interference is the mechanism that makes quantum computing powerful. Just like waves in physics —
two amplitudes can add up or cancel:

Type What Happens Effect

Constructive Amplitudes add (same sign) Higher probability
Destructive Amplitudes cancel (opposite sign) Lower / zero probability

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 5

THE QUANTUM COMPUTING PIPELINE:

1. Prepare superposition → explore ALL inputs simultaneously 2. Apply oracle / gates →

encode information into phase 3. Interference → amplify correct answers, cancel wrong
ones 4. Measure → extract the amplified answer

1.6 Quantum Gates

Quantum gates are the operations applied to qubits. Unlike classical logic gates, all quantum gates
are reversible (they are unitary matrices).

Gate Symbol Action Key Use

Hadamard H |0■ → (|0■+|1■)/√2 |1■ → (|0■−|1■)/√2 Create superposition
Pauli-X X |0■ → |1■ |1■ → |0■ Quantum NOT gate
Pauli-Z Z |0■ → |0■ |1■ → −|1■ Flip phase of |1■
CNOT CX Flips target if control = |1■ Create entanglement
Phase S S |1■ → i|1■ (90° phase shift) Phase rotation

Hadamard Gate — Matrix Form:

H = (1/√2) × [ [1, 1] , [1, −1] ]

Apply H to |0■ = [1, 0]T: Result = (1/√2)[1, 1]T = (1/√2)(|0■ + |1■) Apply H to |1■ = [0, 1]T:
Result = (1/√2)[1, −1]T = (1/√2)(|0■ − |1■)

Key property: H applied twice returns to the original state → H(H|ψ■) = |ψ■. This is used in all three
algorithms you will learn.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 6

CH 2 Tensor Products
How to combine multiple qubits into one quantum system.

2.1 Why Do We Need Tensor Products?

In classical computing, combining two bits is trivial — you just write them side by side: (0, 1). But in
quantum computing, each qubit is a vector. To represent a system of multiple qubits, we must
combine their vector spaces. This combination is called the tensor product (also written ⊗).

INTUITION:

Think of tensor product as 'quantum multiplication'. It takes all possible combinations of

two systems and creates a bigger system that represents all those combinations
simultaneously.

2.2 Mathematical Rule

For vectors a = [a, b]T and v = [c, d]T:

a ⊗ v = [a×c, a×d, b×c, b×d]T

Rule: Multiply EACH element of the first vector by the ENTIRE second vector. The result
has dimension = (dim of first) × (dim of second). For 2 qubits: 2 × 2 = 4 dimensions.

2.3 Step-by-Step Examples

Example 1: |0■ ⊗ |1■
|0■ = [1, 0]T |1■ = [0, 1]T

Step 1: 1 × [0, 1]T = [0, 1]T Step 2: 0 × [0, 1]T = [0, 0]T

|0■ ⊗ |1■ = [0, 1, 0, 0]T = |01■

Example 2: |1■ ⊗ |1■

|1■ = [0, 1]T |1■ = [0, 1]T

Step 1: 0 × [0, 1]T = [0, 0]T Step 2: 1 × [0, 1]T = [0, 1]T

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 7

|1■ ⊗ |1■ = [0, 0, 0, 1]T = |11■

Example 3: Superposition state ⊗ |0■

(1/√2)(|0■ + |1■) ⊗ |0■

Step 1: Distribute the tensor product (it is linear/distributive) = (1/√2)(|0■ ⊗ |0■ + |1■ ⊗
|0■) Step 2: Simplify notation = (1/√2)(|00■ + |10■)

Result: (1/√2)(|00■ + |10■)

Example 4: H|0■ ⊗ H|0■ (Most Important)

(1/√2)(|0■ + |1■) ⊗ (1/√2)(|0■ + |1■)

= (1/2)(|0■ + |1■)(|0■ + |1■) = (1/2)(|0■|0■ + |0■|1■ + |1■|0■ + |1■|1■) = (1/2)(|00■ +

|01■ + |10■ + |11■)

Result: (1/2)(|00■ + |01■ + |10■ + |11■)

This is ALL four possible 2-bit inputs in superposition simultaneously! With n qubits and H
applied to each, you get ALL 2n inputs at once. This is quantum parallelism.

2.4 General n-Qubit State

|Ψ■ = Σ αx |x■ for all x ∈ {0,1}n

For 2 qubits: |Ψ■ = α00|00■ + α01|01■ + α10|10■ + α11|11■ With n qubits → 2n states.
50 qubits → 250 ≈ 1015 states simultaneously!

CRITICAL MISCONCEPTION:

WRONG: |00■ means 'qubit 1 is in state |0■ AND qubit 2 is in state |0■ separately.'
RIGHT: |00■ is ONE combined state of the ENTIRE 2-qubit system. You cannot always
separate it into individual qubit states — that's what entanglement is about.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 8

CH 3
Entanglement — Deep
Understanding
The most non-intuitive and powerful feature of quantum systems.

3.1 What Is Entanglement?

Entanglement occurs when two (or more) qubits become so correlated that you cannot describe them
independently. The state of the whole system cannot be broken into individual qubit states.

PRECISE DEFINITION:

A multi-qubit state |Ψ■ is entangled if and only if it CANNOT be written as: |Ψ■ ≠ |ψ■■
⊗ |ψ■■ (for any single-qubit states |ψ■■ and |ψ■■)

3.2 The Four Bell States (Maximally Entangled)

The Bell states are the canonical examples of entanglement and appear constantly in quantum
algorithms:

Φ+ = (1/√2)(|00■ + |11■) ← Most common

Φ− = (1/√2)(|00■ − |11■)

Ψ+ = (1/√2)(|01■ + |10■)

Ψ− = (1/√2)(|01■ − |10■)

3.3 How to Detect Entanglement (The Factoring Test)

To check if a state is entangled, try to factor it into a product of single-qubit states. If you can factor it
— not entangled. If you cannot — entangled.

Test 1: |00■ + |10■ → NOT entangled

|00■ + |10■ = (|0■ + |1■) ⊗ |0■

✓ Factored successfully → NOT entangled.

Test 2: (1/√2)(|00■ + |11■) → ENTANGLED

Try to factor: (α|0■ + β|1■) ⊗ (γ|0■ + δ|1■)

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 9

Expansion gives: αγ|00■ + αδ|01■ + βγ|10■ + βδ|11■ Comparing with (1/√2)|00■ +

0|01■ + 0|10■ + (1/√2)|11■: • αδ = 0 → α=0 OR δ=0 • βγ = 0 → β=0 OR γ=0 • αγ ≠ 0 →
α≠0 AND γ≠0 • βδ ≠ 0 → β≠0 AND δ≠0 CONTRADICTION! No solution exists → cannot
be factored → ENTANGLED.

Test 3: (1/√2)(|01■ + |10■) → ENTANGLED

Try: αγ = 0, αδ ≠ 0, βγ ≠ 0, βδ = 0 αγ = 0 → α=0 or γ=0 But αδ ≠ 0 → α≠0, and βγ ≠ 0 →
γ≠0 Contradiction → ENTANGLED

Test 4: (1/2)(|00■ + |01■ + |10■ + |11■) → NOT entangled

(1/2)(|00■ + |01■ + |10■ + |11■) = (1/2)(|0■ + |1■)(|0■ + |1■) = [(1/√2)(|0■ + |1■)] ⊗
[(1/√2)(|0■ + |1■)]

✓ Factored → NOT entangled (product of two H|0■ states)

3.4 Measurement Behavior of Entangled States

When qubits are entangled, measuring one qubit instantly determines the state of the other —
regardless of physical distance.

For (1/√2)(|00■ + |11■):

• Measure qubit 1, get 0 → qubit 2 must be 0 (state collapses to |00■) • Measure qubit 1,
get 1 → qubit 2 must be 1 (state collapses to |11■) For (1/√2)(|01■ + |10■): • Measure
qubit 1, get 0 → qubit 2 must be 1 • Measure qubit 1, get 1 → qubit 2 must be 0

IMPORTANT TRUTH:

Entanglement is NOT faster-than-light communication. The outcomes are correlated, but

both outcomes are random — you cannot choose which result you get, so you cannot
send information. The correlation is real and verified, but it cannot be used for signaling.

3.5 How Entanglement is Created (H + CNOT)

Circuit: |0■ ——[H]——●—— qubit 1

|0■ ————————⊕—— qubit 2

Step 1: Start with |00■ Step 2: Apply H to qubit 1: (1/√2)(|0■ + |1■) ⊗ |0■ = (1/√2)(|00■ +
|10■) Step 3: Apply CNOT (flip qubit 2 if qubit 1 = 1): |00■ → |00■ (qubit 1 is 0, no flip)
|10■ → |11■ (qubit 1 is 1, flip qubit 2) Result: (1/√2)(|00■ + |11■) ← Bell state!

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 10

CH 4 Quantum Algorithms
Deutsch-Jozsa · Bernstein-Vazirani · Simon's Algorithm

4.1 Deutsch–Jozsa Algorithm

The Problem
You are given a black-box function (oracle) f : {0,1}n → {0,1} that is promised to be either:

• CONSTANT: outputs the same value (all 0s or all 1s) for every input • BALANCED:
outputs 0 for exactly half the inputs, 1 for the other half GOAL: Determine which type f is
— using as few calls to f as possible.

Classical vs Quantum Complexity

Approach Queries Needed Worst Case
Classical (deterministic) Up to 2<super>n-1</super> + 1 Exponential
Quantum (Deutsch-Jozsa) Exactly 1 O(1)

Algorithm Steps
Step 1: Initialize

|0■⊗n|1■ — n input qubits in |0■, 1 ancilla in |1■

Step 2: Hadamard

Apply H to ALL qubits → put inputs in superposition of all 2n inputs, ancilla in

(|0■−|1■)/√2

Step 3: Oracle U_f

Apply oracle — encodes f into phase via phase kickback trick

Step 4: Hadamard

Apply H again to the first n qubits — interfere the phases

Step 5: Measure

Measure the first n qubits

Reading the Result

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 11

• All measured qubits = 0 → f is CONSTANT • Any measured qubit = 1 → f is BALANCED

Why? If f is constant, all phase information cancels via interference and the state returns
to |0...0■. If balanced, the phases partially survive.

THE KEY INSIGHT:

Quantum advantage comes from INTERFERENCE — not just parallelism. The oracle
runs once on all inputs simultaneously, then interference separates constant from
balanced in one measurement.

4.2 Bernstein–Vazirani Algorithm

The Problem
Given oracle f(x) = s · x (mod 2) where s is a hidden n-bit string and x · s is the bitwise dot
product: x · s = x1s1 ⊕ x2s2 ⊕ ... ⊕ xnsn GOAL: Find the hidden string s.

Approach Queries Needed

Classical n queries (query each bit of s separately)
Quantum (BV) 1 query (find all bits simultaneously)

Algorithm Steps (identical circuit structure to Deutsch-Jozsa!)

Step 1: Initialize

|0■⊗n|1■ — n input qubits in |0■, 1 ancilla in |1■

Step 2: Hadamard

Apply H to ALL qubits → put inputs in superposition of all 2n inputs, ancilla in

(|0■−|1■)/√2

Step 3: Oracle U_f

Apply oracle — encodes f into phase via phase kickback trick

Step 4: Hadamard

Apply H again to the first n qubits — interfere the phases

Step 5: Measure

Measure the first n qubits

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 12

Measuring the first n qubits directly gives s! Why? The phase kickback encodes each bit
of s into the phase of the corresponding qubit. After the final Hadamard, those phases
convert to bit values.

KEY INSIGHT:

Quantum systems store information in PHASE, not just amplitude. The dot product s·x
gets encoded into phase. The final Hadamard decodes the phase → reveals s directly.

4.3 Simon's Algorithm

(Note: sometimes incorrectly written as 'Simmons' — the correct name is Simon's Algorithm)

The Problem
Given oracle f : {0,1}n → {0,1}n with a HIDDEN period s: f(x) = f(y) if and only if y = x ⊕ s
(XOR with s) • If s = 0...0, then f is one-to-one (injective) • Otherwise, every output value
has exactly 2 inputs that map to it GOAL: Find the hidden string s.

Approach Queries Needed Complexity

Classical (best) O(2<super>n/2</super>) Exponential
Quantum (Simon's) O(n) expected Polynomial

Algorithm Steps
Step 1: Prepare superposition

Apply H⊗n to |0■⊗n → get all 2n inputs in superposition. Prepare second register |0■⊗n.

Step 2: Apply oracle

Oracle maps |x■|0■ → |x■|f(x)■. The second register now holds f values.

Step 3: Measure second register

Collapse to some value f(x0). First register collapses to (|x0■ + |x0⊕s■)/√2 — a

superposition of the two inputs that produce the same output.

Step 4: Apply H again

Apply H⊗n to first register → get a uniform superposition over all y such that y·s = 0 (mod
2).

Step 5: Measure & repeat

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 13

Each measurement gives one linear equation y·s = 0 (mod 2). Repeat n-1 times to get n-1
independent equations.

Step 6: Solve linear system

Classical Gaussian elimination on the n-1 equations → solve for s.

KEY INSIGHTS:

1. Simon's was the FIRST algorithm to show exponential quantum speedup 2. It directly
inspired Shor's factoring algorithm 3. The quantum part gives linear equations; classical
post-processing solves them 4. This hybrid (quantum + classical) approach is typical in
quantum algorithms

4.4 Algorithm Comparison Table

Algorithm Problem Classical Quantum Speedup
Deutsch-Jozsa Constant vs Balanced function
2<super>n-1</super>+1 queries
1 query Exponential
Bernstein-VaziraniFind hidden string s via dot product n queries 1 query Linear
Simon's Find hidden period/string s (XOR structure)
O(2<super>n/2</super>) O(n) Exponential

WHAT ALL THREE ALGORITHMS SHARE:

1. SUPERPOSITION — explore all inputs simultaneously 2. PHASE ENCODING —

oracle encodes answer into phase (phase kickback) 3. INTERFERENCE — amplify
correct answer, cancel wrong answers 4. MEASUREMENT — extract the result in O(1) or
O(n) steps

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 14

CH 5 Self-Test — Level 1: Foundation

Test your basic understanding. Try without notes. Be honest.

Time: 45–60 minutes | Don't rush | Explain in your own words

Section A — CONCEPTUAL
Q1: Explain what 'quantum' means in physics. Why is it different from classical physics?

Answer:

Quantum physics deals with discrete energy levels and probability amplitudes, not
continuous values. Classical systems have definite states; quantum systems exist in
superposition until measured.

Q2: What is a qubit? Explain amplitude, probability, and normalization.

Answer:

|ψ■ = α|0■ + β|1■. Amplitudes α, β are complex numbers. Probabilities = |α|² and |β|².
Normalization: |α|² + |β|² = 1 (probabilities must sum to 1).

Q3: What is superposition? Why is it NOT 'just 50% 0 and 50% 1'?

Answer:

Superposition means the qubit has no definite value — it is truly both at once. A coin
mid-flip is random but has a definite (unknown) state. A qubit in superposition has NO
definite state. The phase also matters — H|0■ and H|1■ have same probabilities but
different phases and different behaviors.

Q4: What happens during measurement? Why is it different from classical reading?

Answer:

Measurement collapses the superposition irreversibly to 0 or 1. Classical reading doesn't

change the state. Quantum measurement destroys the superposition — you cannot
'undo' it.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 15

Q5: What is phase? Why do two states with the same probability behave differently?

Answer:

Phase is the angle (argument) of the complex amplitude. H|0■ = (|0■+|1■)/√2 and H|1■
= (|0■−|1■)/√2 have 50/50 probabilities but different phases, causing different
interference behavior.

Q6: Explain constructive and destructive interference and why they matter.

Answer:

Constructive: amplitudes add → higher probability. Destructive: amplitudes cancel →

lower/zero probability. Interference lets quantum algorithms amplify correct answers and
eliminate wrong ones.

Q7: Differences between a classical bit and a qubit.

Answer:

Classical bit: 0 or 1, definite, no phase. Qubit: superposition, amplitude, phase, collapses

on measurement. Qubit carries more information but can only output 1 bit on
measurement.

Section B — MATHEMATICAL
Q8: Given |ψ■ = (3/5)|0■ + (4/5)|1■, find probabilities.

Answer:

P(0) = (3/5)² = 9/25 = 0.36. P(1) = (4/5)² = 16/25 = 0.64. Check: 0.36 + 0.64 = 1. ✓

Q9: Is |ψ■ = 0.6|0■ + 0.6|1■ a valid qubit state?

Answer:

|0.6|² + |0.6|² = 0.36 + 0.36 = 0.72 ≠ 1. NOT VALID. The normalization condition fails.

Q10: Write the vector form of |ψ■ = α|0■ + β|1■.

Answer:

[α, β]■ where |0■ = [1,0]■ and |1■ = [0,1]■

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 16

Q11: Apply X gate to |0■.

Answer:

X|0■ = |1■. (X flips the qubit — quantum NOT gate)

Q12: Apply Z gate to |1■.

Answer:

Z|1■ = −|1■. (Z flips the phase of |1■, leaves |0■ unchanged)

Q13: Apply H gate to |0■.

Answer:

H|0■ = (1/√2)(|0■ + |1■) = (1/√2)[1, 1]■

Q14: What is the difference between H|0■ and H|1■?

Answer:

H|0■ = (1/√2)(|0■+|1■): both amplitudes positive. H|1■ = (1/√2)(|0■−|1■): |1■ amplitude

is negative (phase flipped). Same measurement probabilities — different phases —
different behavior under further gates.

Section C — TENSOR PRODUCT

Q15: Compute |0■ ⊗ |0■.

Answer:

|0■ ⊗ |0■ = [1,0]■ ⊗ [1,0]■ = [1,0,0,0]■ = |00■

Q16: Compute |1■ ⊗ |0■.

Answer:

|1■ ⊗ |0■ = [0,1]■ ⊗ [1,0]■ = [0,0,1,0]■ = |10■

Q17: Expand (1/√2)(|0■+|1■) ⊗ |1■.

Answer:

(1/√2)(|0■⊗|1■ + |1■⊗|1■) = (1/√2)(|01■ + |11■)

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 17

Q18: Expand (1/√2)(|0■+|1■) ⊗ (1/√2)(|0■+|1■).

Answer:

(1/2)(|0■+|1■)(|0■+|1■) = (1/2)(|00■ + |01■ + |10■ + |11■)

Section D — ENTANGLEMENT
Q19: Is (1/√2)(|00■+|10■) entangled? Justify.

Answer:

NOT entangled. Factor: (1/√2)(|0■+|1■) ⊗ |0■. Since it can be written as a product of

single-qubit states, it is separable.

Q20: Is (1/√2)(|00■+|11■) entangled? Justify.

Answer:

YES — ENTANGLED. Cannot factor: αγ = 1/√2, αδ = 0, βγ = 0, βδ = 1/√2 is a

contradiction. No factorization exists.

Q21: Explain entanglement in your own words (no memorized definition).

Answer:

Two qubits are entangled when knowing the outcome of one immediately tells you the
outcome of the other — because they share a combined quantum state that cannot be
described as two independent states.

Q22: What happens when you measure one qubit in an entangled state?

Answer:

The entire joint state collapses. If you measure qubit 1 and get 0, qubit 2 is instantly in the
state determined by the entanglement — e.g., in (1/√2)(|00■+|11■), measuring qubit 1 =
0 forces qubit 2 = 0 immediately.

Section E — HIGH-LEVEL THINKING

Q23: Why is superposition alone not enough for quantum advantage?

Answer:

Superposition creates parallelism (evaluate all inputs at once), but measuring gives only
ONE random answer. Without interference to amplify the correct answer, we gain
nothing. Interference is what converts superposition into useful computation.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 18

Q24: What role does phase play in computation?

Answer:

Phase carries information invisibly (not visible in single measurements). Gates

manipulate phase. Interference uses phase differences to amplify or cancel amplitudes.
Phase is the hidden mechanism behind quantum speedup.

Q25: Explain the full flow: Superposition → Gate → Interference → Measurement.

Answer:

Superposition: prepare all inputs at once. Gates (oracle): encode the function's answer
into phases. Interference: correct answer's phases constructively add; wrong answers
cancel. Measurement: the amplified correct answer is extracted with high probability.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 19

CH 6
Self-Test — Level 2: Advanced /
Exam-Ready
Tricky questions that reveal real depth. 60–90 minutes. No notes.

Section A — DEEP CONCEPTUAL

Q1: Why do we square amplitudes to get probability? What would go wrong otherwise?

Answer:

Probability must be real and non-negative. Amplitudes can be complex. |α|² is always real
and ≥ 0. If we used amplitudes directly, negatives would give impossible negative
probabilities. Squaring also gives the Born rule — the experimentally verified connection
between quantum math and real measurements.

Q2: Explain: what information is stored in α and β, and why does phase matter even if
probabilities are the same?

Answer:

α and β encode both the magnitude (probability = |.|²) AND the phase (angle in complex
plane). Two states with the same |α|² and |β|² but different phases are physically different.
Phase differences cause different interference — they determine how states evolve under
further gates. Measurement loses phase; interference uses it.

Q3: Explain: 'Quantum computing uses amplitudes, not probabilities'.

Answer:

Probabilities are always positive and can only add. Amplitudes can be negative/complex
and can cancel (destructive interference). This cancellation is impossible with classical
probabilities. Quantum algorithms manipulate amplitudes to cancel wrong paths and
reinforce correct ones — then convert to probabilities only at the final measurement step.

Q4: Why is measurement irreversible?

Answer:

The act of measurement forces the quantum system to 'choose' a definite state. The
superposition collapses — the phase information and the undetermined nature are
permanently lost. There is no way to recover the original superposition after
measurement. This is why measurement must always be the LAST step.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 20

Q5: Can two different quantum states give the same measurement probabilities? If yes,
how?

Answer:

YES. Example: (1/√2)(|0■+|1■) and (1/√2)(|0■−|1■) both give P(0)=P(1)=0.5. They differ
only in the phase of the |1■ component. They produce different results when passed
through further gates — but single measurement cannot distinguish them.

Q6: Why is superposition alone NOT enough for speedup?

Answer:

Superposition gives all inputs at once, but measurement gives one random output — no
better than random guessing. You need interference to make the RIGHT answer appear
with high probability. Speedup comes from amplifying correct answers via interference,
not from parallelism alone.

Section B — TRICKY MATHEMATICS

Q7: Given |ψ■ = (1/√3)|0■ + √(2/3)|1■, find probabilities.

Answer:

P(0) = |1/√3|² = 1/3 ≈ 0.333. P(1) = |√(2/3)|² = 2/3 ≈ 0.667. Check: 1/3 + 2/3 = 1 ✓

Q8: Is |ψ■ = (1/√2)|0■ + (1/√2)|1■ valid?

Answer:

|(1/√2)|² + |(1/√2)|² = 1/2 + 1/2 = 1 ✓ VALID.

Q9: If α = (1/√2) + i(1/√2), find |α|².

Answer:

|α|² = α·α* = [(1/√2)+i(1/√2)][(1/√2)−i(1/√2)] = (1/√2)² + (1/√2)² = 1/2 + 1/2 = 1.

Q10: If two amplitudes for the same state are +0.5 from path A and −0.5 from path B, what
is the final probability?

Answer:

Total amplitude = +0.5 + (−0.5) = 0. Probability = |0|² = 0. Complete destructive

interference — state has ZERO probability of being measured. This is how quantum
algorithms eliminate wrong answers.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 21

Section C — GATES DEEP DIVE

Q11: Apply X gate to (1/√2)(|0■+|1■).

Answer:

X[(1/√2)(|0■+|1■)] = (1/√2)(X|0■+X|1■) = (1/√2)(|1■+|0■) = (1/√2)(|0■+|1■). The state

is UNCHANGED — it is an eigenstate of X.

Q12: Apply Z gate to (1/√2)(|0■+|1■).

Answer:

Z[(1/√2)(|0■+|1■)] = (1/√2)(Z|0■+Z|1■) = (1/√2)(|0■+(−|1■)) = (1/√2)(|0■−|1■). The Z

gate flips the phase of the |1■ component.

Q13: Apply H twice: H(H|0■). What do you observe?

Answer:

H|0■ = (1/√2)(|0■+|1■). H[(1/√2)(|0■+|1■)] = (1/√2)[H|0■+H|1■] =

(1/√2)[(1/√2)(|0■+|1■)+(1/√2)(|0■−|1■)] = (1/2)[2|0■] = |0■. H is its own inverse: H² = I.

Q14: Why does Hadamard introduce phase?

Answer:

H maps |1■ → (|0■−|1■)/√2 — the |1■ component gets a negative sign. This phase
difference is what makes H|0■ and H|1■ distinguishable under interference. Phase
introduction is essential for encoding information that interference can later decode.

Section D — MULTI-QUBIT THINKING

Q15: How many states for 3 qubits? 4 qubits?

Answer:

3 qubits: 2³ = 8 states. 4 qubits: 2■ = 16 states. General: n qubits → 2■ states.

Q16: Write the general form of a 2-qubit system.

Answer:

|Ψ■ = α■■|00■ + α■■|01■ + α■■|10■ + α■■|11■ where Σ|α■■|² = 1.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 22

Q17: Expand |1■ ⊗ (1/√2)(|0■+|1■).

Answer:

|1■ ⊗ (1/√2)(|0■+|1■) = (1/√2)(|1■⊗|0■ + |1■⊗|1■) = (1/√2)(|10■+|11■)

Q18: Expand (1/√2)(|0■−|1■) ⊗ |0■.

Answer:

(1/√2)(|0■⊗|0■ − |1■⊗|0■) = (1/√2)(|00■−|10■)

Section E — ENTANGLEMENT ADVANCED

Q19: Is (1/2)(|00■+|01■+|10■+|11■) entangled? Justify.

Answer:

NOT entangled. Factor: (1/2)(|0■+|1■)(|0■+|1■) = [(1/√2)(|0■+|1■)] ⊗ [(1/√2)(|0■+|1■)]

= H|0■ ⊗ H|0■. This is a product state.

Q20: Is (1/√2)(|01■+|10■) entangled?

Answer:

YES — ENTANGLED (Bell state Ψ■). Try αγ=0, αδ=1/√2, βγ=1/√2, βδ=0. From αγ=0: α=0
or γ=0. But αδ≠0 → α≠0, and βγ≠0 → γ≠0. Contradiction.

Q21: Find if (1/√2)(|00■+|11■) can be factored.

Answer:

Cannot be factored — ENTANGLED (Bell state Φ■). Full proof in Chapter 3, Section 3.3.

Q22: Why can entangled states NOT be separated?

Answer:

Because the correlations in an entangled state are non-local — they exist across the
entire system. The mathematical structure (no valid α, β, γ, δ satisfies all amplitude
requirements) reflects the physical reality that the qubits share ONE quantum state, not
two independent ones.

Section F — HIGH LEVEL + BONUS

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 23

Q23: Explain how interference helps in computation.

Answer:

Interference allows quantum algorithms to set up amplitude cancellations (destructive) on

wrong answers and amplitude reinforcement (constructive) on correct ones. After
interference, measuring gives the right answer with high probability — turning a quantum
random walk into a directed computation.

Q24: Why is phase invisible in measurement but still important?

Answer:

Measurement gives |amplitude|² — the phase is lost. But BEFORE measurement, phase
differences cause interference. Gates use phase to route amplitudes. The phase is the
hidden 'information carrier' that drives the algorithm — invisible to the output but essential
to the process.

Q25: Full pipeline: State → Gate → Phase → Interference → Measurement.

Answer:

State: initialize |0...0■. Gates (Hadamard): create superposition — all inputs at once.
Oracle: encode f(x) into phase of each |x■ component. Interference (Hadamard again):
phases constructively add for correct answer, cancel for wrong ones. Measurement:
correct answer appears with high probability.

Q26: What happens if you apply H to both qubits of |00■?

Answer:

H|0■ ⊗ H|0■ = [(1/√2)(|0■+|1■)] ⊗ [(1/√2)(|0■+|1■)] = (1/2)(|00■+|01■+|10■+|11■). All

4 inputs in equal superposition.

Q27: Why does this create 'all inputs at once'?

Answer:

The equal superposition state has amplitude 1/2 for each of the 4 basis states. When the
oracle runs on this state, it implicitly evaluates f(00), f(01), f(10), f(11) simultaneously in
one operation — quantum parallelism.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 24

Q28: After superposition, why can't we just measure and get the answer?

Answer:

Measuring the superposition gives one RANDOM input — no better than random
guessing classically. You need interference first to amplify the amplitude of the correct
answer and suppress wrong ones. Measurement must come AFTER interference, not
before.

From Basics to Mastery | Algorithms & Self-Test

QUANTUM COMPUTING — COMPLETE STUDY GUIDE Page 25

■ Self-Evaluation Guide
Use this to honestly assess where you stand.

Score Level What it Means Next Step

90–100% MASTERY Ready for advanced algorithms (Shor, Grover)
Move to Shor's Algorithm
70–89% STRONG Algorithm-ready; minor gaps in phase/entanglement
Review weak sections, then algorithms
50–69% MEDIUM Concepts ok, math slow, some confusion Re-read chapters 2–3, redo test
Below 50% BUILDING Memorizing answers, confused in tensor/measurement
Re-read from Chapter 1, slow down

FINAL MASTER PRINCIPLE — REMEMBER THIS ALWAYS:

Every quantum algorithm uses the same engine: SUPERPOSITION → explore all inputs
at once PHASE ENCODING → oracle writes answer into phase INTERFERENCE →
correct answer amplified, wrong answers cancelled MEASUREMENT → extract the
amplified correct answer Master these four steps and you understand ALL quantum
algorithms.

From Basics to Mastery | Algorithms & Self-Test