QUANTUM COMPUTING
Beginner Study Notes | Key Concepts • Examples • MCQs
Overview: Quantum computing processes information using quantum systems. It uses qubits and quantum operations; it
does not automatically outperform classical computers on every task.
1. Classical Bits and Qubits
• A classical bit stores 0 or 1.
• A qubit is described by a quantum state that can combine basis states |0■ and |1■.
• When measured in the computational basis, a qubit produces a definite result: 0 or 1.
• Quantum systems are described by amplitudes, from which measurement probabilities are calculated.
2. Superposition
A pure qubit state can be written as |ψ■ = α|0■ + β|1■. Here α and β are complex amplitudes, and |α|² + |β|² = 1.
Measurement probabilities are |α|² for 0 and |β|² for 1.
3. Entanglement
Entanglement is a quantum correlation between systems that cannot be fully described as independent states. It does not
allow information to be sent faster than light.
4. Quantum Gates
• X gate: Swaps the basis states |0■ and |1■, similar to a NOT operation on those states.
• Hadamard (H): Turns |0■ into an equal-amplitude superposition.
• Z gate: Changes the relative phase of the |1■ component.
• CNOT: Flips the target qubit when the control qubit is |1■; it can help create entanglement.
5. Measurement and Circuits
A quantum circuit is a sequence of gates applied to qubits. Measurement returns classical outcomes. Experiments are often
repeated because individual outcomes can be probabilistic.
Example: Start with |0■, apply an H gate, and measure. In an ideal experiment, many repeated runs give roughly half 0
outcomes and half 1 outcomes.
6. Potential Applications
• Quantum simulation of chemistry and materials.
• Some specialized sampling and optimization problems, depending on the algorithm and hardware.
• Research into quantum communication and sensing.
• Studying the implications of Shor's algorithm for some public-key cryptosystems.
Important: Real-world advantage depends on the task, algorithm, hardware quality, and error rates.
7. Noise and Error Correction
• Qubits can be affected by environmental noise and imperfect operations.
• Quantum error correction encodes logical information across multiple physical qubits.
• Error correction helps protect information without simply copying an unknown quantum state.
• Reliable large-scale quantum computing remains an active research and engineering challenge.
8. Essential Vocabulary
• Qubit: Basic unit of quantum information.
Beginner Study Notes | Key Concepts • Examples • MCQs
Overview: Quantum computing processes information using quantum systems. It uses qubits and quantum operations; it
does not automatically outperform classical computers on every task.
1. Classical Bits and Qubits
• A classical bit stores 0 or 1.
• A qubit is described by a quantum state that can combine basis states |0■ and |1■.
• When measured in the computational basis, a qubit produces a definite result: 0 or 1.
• Quantum systems are described by amplitudes, from which measurement probabilities are calculated.
2. Superposition
A pure qubit state can be written as |ψ■ = α|0■ + β|1■. Here α and β are complex amplitudes, and |α|² + |β|² = 1.
Measurement probabilities are |α|² for 0 and |β|² for 1.
3. Entanglement
Entanglement is a quantum correlation between systems that cannot be fully described as independent states. It does not
allow information to be sent faster than light.
4. Quantum Gates
• X gate: Swaps the basis states |0■ and |1■, similar to a NOT operation on those states.
• Hadamard (H): Turns |0■ into an equal-amplitude superposition.
• Z gate: Changes the relative phase of the |1■ component.
• CNOT: Flips the target qubit when the control qubit is |1■; it can help create entanglement.
5. Measurement and Circuits
A quantum circuit is a sequence of gates applied to qubits. Measurement returns classical outcomes. Experiments are often
repeated because individual outcomes can be probabilistic.
Example: Start with |0■, apply an H gate, and measure. In an ideal experiment, many repeated runs give roughly half 0
outcomes and half 1 outcomes.
6. Potential Applications
• Quantum simulation of chemistry and materials.
• Some specialized sampling and optimization problems, depending on the algorithm and hardware.
• Research into quantum communication and sensing.
• Studying the implications of Shor's algorithm for some public-key cryptosystems.
Important: Real-world advantage depends on the task, algorithm, hardware quality, and error rates.
7. Noise and Error Correction
• Qubits can be affected by environmental noise and imperfect operations.
• Quantum error correction encodes logical information across multiple physical qubits.
• Error correction helps protect information without simply copying an unknown quantum state.
• Reliable large-scale quantum computing remains an active research and engineering challenge.
8. Essential Vocabulary
• Qubit: Basic unit of quantum information.
