Quantum Teleportation
Steps
Circuit
Initial State
All three qubits start in |0⟩.
What's happening?
We have three qubits: q0 (state to teleport), q1 (Alice), q2 (Bob). Alice and Bob may be far apart.
Key Insight
Teleportation requires pre-shared entanglement between Alice and Bob.
Bloch Spheres
Note: Individual Bloch spheres cannot fully represent entangled states.
Probabilities
Statevector |ψ⟩
| State | Amplitude | |ψ| | Phase | Prob |
|---|---|---|---|---|
| |000⟩ | 1 | 1.000 | 0 | 100% |
| |001⟩ | 0 | 0.000 | — | 0% |
| |010⟩ | 0 | 0.000 | — | 0% |
| |011⟩ | 0 | 0.000 | — | 0% |
| |100⟩ | 0 | 0.000 | — | 0% |
| |101⟩ | 0 | 0.000 | — | 0% |
| |110⟩ | 0 | 0.000 | — | 0% |
| |111⟩ | 0 | 0.000 | — | 0% |
Algorithm Overview
Transfer a quantum state from one qubit to another using shared entanglement.
Classical Approach
Classically, you cannot copy an unknown state (no-cloning theorem applies to quantum too). Teleportation doesn't copy — it transfers the state, destroying the original. It also doesn't allow faster-than-light communication since classical bits must be sent.
Quantum Advantage
Teleportation enables quantum state transfer without physically moving the qubit. Combined with entanglement distribution, it forms the basis of quantum networks and distributed quantum computing.
Complexity
Circuit depth: 7, Gate count: 7 (3 single-qubit, 4 two-qubit)
Applications
- •Quantum networks
- •Distributed quantum computing
- •Quantum repeaters
- •Quantum error correction
- •Quantum internet
Try it yourself
Want to experiment with this circuit? Open it in the Playground to modify and explore.
Open in PlaygroundExercises and quizzes coming soon!