+- The Lumin Archive (https://theluminarchive.co.uk)
+-- Forum: The Lumin Archive — Core Forums (https://theluminarchive.co.uk/forumdisplay.php?fid=3)
+--- Forum: Computer Science (https://theluminarchive.co.uk/forumdisplay.php?fid=8)
+---- Forum: Quantum Computing (https://theluminarchive.co.uk/forumdisplay.php?fid=29)
+---- Thread: Quantum Computing — Qubits, Superposition, Entanglement & the Future of Computation (/showthread.php?tid=102)
Quantum Computing — Qubits, Superposition, Entanglement & the Future of Computation - Leejohnston - 11-13-2025
Quantum Computing — Qubits, Superposition, Entanglement & the Future of Computation
Quantum computing is one of the most advanced and exciting fields in modern computer science.
Instead of using classical bits (0 or 1), quantum computers use *qubits* — units of information that follow the laws of quantum physics.
This thread introduces the essential ideas behind quantum computing in a clear, beginner-friendly format.
-----------------------------------------------------------------------
1. Classical Bits vs Quantum Qubits
Classical bit:
• can be either 0 or 1
• used in all standard computers (phones, PCs, servers)
Quantum qubit:
• can be 0
• can be 1
• can be BOTH at the same time (superposition)
A qubit is represented as a state:
|ψ⟩ = α|0⟩ + β|1⟩
where α and β are complex numbers with total probability = 1.
-----------------------------------------------------------------------
2. Superposition — Computing Many States at Once
Superposition means a qubit can exist in multiple states simultaneously.
Example:
A classical bit is either:
• 0
• or 1
A qubit can be:
• 0
• 1
• or a combination of both
This allows quantum computers to process many possibilities at the same time.
-----------------------------------------------------------------------
3. Entanglement — Linking Qubits Together
Entanglement is a quantum phenomenon where qubits become linked so that the state of one instantly affects the other — even across long distances.
Entangled qubits allow:
• faster information transfer
• incredibly powerful quantum operations
• quantum teleportation
This property is key to quantum computing’s speed and power.
-----------------------------------------------------------------------
4. Quantum Gates — Operations on Qubits
Quantum gates are like logic gates in classical computing — but operate using quantum mechanics.
Important quantum gates:
• Hadamard (H): creates superposition
• Pauli-X: flips |0⟩ ↔ |1⟩
• Pauli-Z: phase flip
• CNOT: creates entanglement
• Toffoli: advanced multi-qubit control
• Phase Shift: controls phase angle
Quantum circuits apply these gates to perform calculations.
-----------------------------------------------------------------------
5. Measurement — Collapsing the Quantum State
When you *measure* a qubit:
• its superposition collapses
• it becomes either 0 or 1
This is why quantum algorithms rely on careful manipulation *before* measurement.
-----------------------------------------------------------------------
6. Why Quantum Computers Are Powerful
Quantum computers excel at:
• factoring extremely large numbers
• breaking classical encryption
• optimising complex systems
• simulating molecules & chemistry
• solving quantum physics problems
• accelerating machine learning
They are not “faster PCs” — they are machines built for *certain categories* of problems.
-----------------------------------------------------------------------
7. Quantum Algorithms (Beginner Overview)
Shor’s Algorithm
• factors large numbers quickly
• threatens RSA encryption
• huge milestone for cryptography
Grover’s Algorithm
• speeds up search problems
• quadratic speedup
Quantum Fourier Transform (QFT)
• key to many advanced algorithms
Variational Quantum Algorithms (VQE, QAOA)
• hybrid algorithms using classical + quantum computing
-----------------------------------------------------------------------
8. Quantum Hardware Types
Different physical systems can act as qubits:
• superconducting qubits (IBM, Google)
• trapped ions (IonQ, Honeywell)
• photonic qubits (light-based systems)
• topological qubits (experimental)
• silicon spin qubits
Each type has strengths and weaknesses — the field is still rapidly evolving.
-----------------------------------------------------------------------
9. Limitations & Challenges
Quantum computing is powerful, but not perfect.
Major challenges:
• qubit instability (decoherence)
• noise
• error correction is extremely difficult
• hardware is still very early
• algorithms must be carefully designed
Quantum computers aren’t going to replace classical ones — they complement them.
-----------------------------------------------------------------------
10. Practice Questions
1. What is the difference between a classical bit and a qubit?
2. Explain superposition in one sentence.
3. What does the CNOT gate do?
4. Why is entanglement important?
5. Name one major quantum algorithm and its purpose.
-----------------------------------------------------------------------
Summary
This introduction covered:
• qubits vs classical bits
• superposition
• entanglement
• quantum gates
• measurement
• why quantum computers are powerful
• important algorithms
• hardware types
• current limitations
Quantum computing is a frontier field — perfect for the curious minds of The Lumin Archive.