Back to Algorithms

Superdense Coding

Steps

Step1/4
Speed:

Circuit

100%
012345q0q1HHCX: control q0 → target q1ZZXXCX: control q0 → target q1HH
Step 1 of 4

Initial State

Both qubits start in |0⟩.

What's happening?

Alice and Bob each have one qubit. They will share entanglement before Alice sends her message.

Key Insight

The entanglement must be established beforehand.

Bloch Spheres

Note: Individual Bloch spheres cannot fully represent entangled states.

q0
Loading...
q1
Loading...

Probabilities

|00⟩
100.0%
|01⟩
|10⟩
|11⟩
TOTAL: 100.0% • 4 STATES

Statevector |ψ⟩

StateAmplitude|ψ|PhaseProb
|00⟩11.000
0
100%
|01⟩00.0000%
|10⟩00.0000%
|11⟩00.0000%
4 BASIS STATES • 1 NON-ZERO
Algorithm Overview
Intermediate2 qubitscommunication

Send 2 classical bits of information using only 1 qubit transmission.

Classical Approach

Classically, 1 bit can carry at most 1 bit of information. Superdense coding beats this limit by using pre-shared entanglement as a resource.

Quantum Advantage

Doubles the classical capacity of a quantum channel. While entanglement distribution has a cost, in scenarios where entanglement can be pre-distributed, this provides a genuine advantage.

Complexity

Circuit depth: 6, Gate count: 6 (4 single-qubit, 2 two-qubit)

Applications

  • Quantum communication
  • Quantum networks
  • Entanglement-assisted communication
  • Quantum channel capacity

Try it yourself

Want to experiment with this circuit? Open it in the Playground to modify and explore.

Open in Playground

Exercises and quizzes coming soon!