# Quantum Computing Explained Simply

Quantum computing leverages **quantum mechanical phenomena** to process information in fundamentally new ways:

## Core Principles

### 1. Qubits (Quantum Bits)
- Unlike classical bits (0 or 1), qubits can exist in **superposition** (both 0 and 1 simultaneously)
- Represented as vectors on the Bloch sphere
- Enables exponential parallelism: n qubits → 2^n states

### 2. Entanglement
- Quantum correlation where qubits share state instantaneously
- "Spooky action at a distance" (Einstein)
- Enables quantum teleportation and dense coding

### 3. Quantum Gates
- Unitary operations manipulating qubits
- Common gates: Hadamard (H), Pauli (X, Y, Z), CNOT (entanglement)
- Reversible operations (unlike classical NAND gates)

## Practical Applications

| Area | Quantum Advantage | Timeline |
|------|-------------------|----------|
| Cryptography | Breaking RSA (Shor's algorithm) | 10-15 years |
| Drug Discovery | Molecular simulation | 5-10 years |
| Optimization | Traveling salesman problems | 3-7 years |
| Machine Learning | Quantum neural networks | Research phase |

## Current Limitations
```python
# Example quantum circuit in Qiskit
from qiskit import QuantumCircuit, Aer, execute

# Create 2-qubit circuit
qc = QuantumCircuit(2, 2)
qc.h(0)          # Hadamard gate on qubit 0
qc.cx(0, 1)      # CNOT creates entanglement
qc.measure([0, 1], [0, 1])

# Simulate
simulator = Aer.get_backend('qasm_simulator')
result = execute(qc, simulator, shots=1024).result()
counts = result.get_counts(qc)
print(f"Bell state measurements: {counts}")

Key Takeaway: Quantum computing isn't just "faster" computing—it's a different computational paradigm that solves specific problems intractable for classical computers."