Quantum Computing
Sample Study Notes
A concise introduction to qubits, superposition, entanglement, gates, algorithms, and
applications.
1. What Is Quantum Computing?
Quantum computing is a form of computation that uses principles of quantum mechanics to
process information. While classical computers use bits that are either 0 or 1, quantum
computers use quantum bits, or qubits.
2. Classical Bits vs Qubits
Concept Classical Computing Quantum Computing
Basic unit Bit Qubit
Possible state 0 or 1 Combination of 0 and 1 until
measured
Operations Logic gates Quantum gates
Scaling n bits represent one n-bit n qubits describe amplitudes
state at a time across 2^n basis states
3. Core Quantum Concepts
Superposition: A qubit can be described as a combination of the basis states |0> and |
1>. Measurement produces a classical outcome according to the state's probabilities.
Entanglement: Two or more qubits can share correlations that cannot be described
independently. Measuring one qubit can reveal information about the correlated system.
Interference: Quantum algorithms manipulate probability amplitudes so that useful
outcomes are strengthened and unwanted outcomes can cancel.
Measurement: Reading a qubit converts quantum information into a classical result.
Measurement generally changes the quantum state.
4. A Qubit in Simple Mathematical Form
A single qubit is commonly written as:
|ψ> = α|0> + β|1>
Here, α and β are probability amplitudes. Their squared magnitudes satisfy |α|² + |β|² = 1.
The probability of measuring 0 is |α|², while the probability of measuring 1 is |β|².
5. Quantum Gates
X gate: Similar to a classical NOT operation; it swaps |0> and |1>.
Hadamard (H) gate: Often used to create superposition from a basis state.
Quantum Computing — Sample Notes
Z gate: Changes the phase of the |1> component.
CNOT gate: A two-qubit controlled operation frequently used when creating
entanglement.
6. Simple Example: Creating an Entangled Pair
1. Start with two qubits in the state |00>.
2. Apply a Hadamard gate to the first qubit.
3. Apply a CNOT gate using the first qubit as the control and the second as the target.
4. The resulting ideal state is (|00> + |11>)/√2.
5. When measured, the results are correlated: ideally, you observe 00 or 11 with equal
probability.
7. Important Quantum Algorithms
Shor's algorithm: Factors large integers efficiently on a sufficiently capable fault-
tolerant quantum computer; this is important because widely used public-key systems
such as RSA rely on factoring being difficult for classical computers.
Grover's algorithm: Provides a quadratic speedup for unstructured search problems.
Quantum simulation: Uses quantum systems to model other quantum systems, with
potential applications in chemistry, materials, and physics.
Variational algorithms: Hybrid quantum-classical approaches that use parameterized
quantum circuits together with classical optimization.
8. Potential Applications
Cryptography and cryptanalysis
Drug and molecular simulation
Materials science
Optimization research
Machine-learning research
Financial modelling and risk research
9. Current Challenges
Noise and decoherence can destroy fragile quantum information.
Quantum error correction requires substantial physical-qubit overhead.
Hardware is difficult to scale while maintaining high-quality operations.
Many practical problems do not automatically become faster on a quantum computer.
Useful large-scale fault-tolerant quantum computing remains an active engineering and
research challenge.
10. Key Terms to Remember
Qubit — The basic unit of quantum information.
Superposition — A quantum state expressed as a combination of basis states.
Quantum Computing — Sample Notes
Entanglement — Non-classical correlations shared by quantum systems.
Quantum gate — An operation that changes a quantum state.
Quantum circuit — A sequence of quantum operations and measurements.
Decoherence — Loss of useful quantum behavior through interaction with the environment.
Quantum error correction — Techniques for protecting logical quantum information from
errors.
Quick Revision Summary
Remember: quantum computers are not simply faster classical computers. Their advantage
comes from carefully designed algorithms that exploit superposition, entanglement, and
interference for particular classes of problems.
Sample Review Questions
6. What is the difference between a classical bit and a qubit?
7. What does superposition mean?
8. How is entanglement different from ordinary correlation?
9. What does a Hadamard gate do?
10. Why is Shor's algorithm important to cryptography?
11. Name two major challenges facing quantum computing.
Quantum Computing — Sample Notes