Interactive
Quantum Calculators
Reading about superposition and entanglement only gets you so far — these ten tools let you actually manipulate the numbers behind quantum mechanics and watch the results update in real time. No quantum hardware, no software installation, just the underlying math made interactive.
Each tool below includes a guided "try this" example connecting the calculation back to a real concept, algorithm, or piece of hardware covered elsewhere on this site — use them alongside the Learning Center for the best results.
1. Qubit-to-States Converter
Every qubit you add doesn't just add one more possibility — it doubles the total number of states the system can represent in superposition. This slider shows exactly how fast that growth becomes unmanageable for classical computers.
2^5 possible states
32
At this size, a classical computer can easily list every possible state — this is roughly the scale of a simple classical lookup table.
Try this
Drag the slider to 53 (if the range allowed it) — that's roughly the qubit count Google's Sycamore processor used in its 2019 quantum supremacy claim. The resulting state count is part of why that demonstration was considered significant, even though the task itself had no practical application. See the full algorithm writeup for context.
2. Probability Amplitude Calculator
A qubit's state |ψ⟩ = α|0⟩ + β|1⟩ is defined by two numbers called amplitudes. Squaring an amplitude gives you the probability of measuring that outcome. Because total probability must equal 100%, |α|² + |β|² always equals 1 — so adjusting α here automatically determines β.
P(measure 0)
50.0%
P(measure 1)
50.0%
|ψ⟩ = 0.707|0⟩ + 0.707|1⟩
This is almost exactly an equal superposition — the same state a Hadamard gate produces from |0⟩, and the starting point of most quantum algorithms.
Try this
Set α to exactly 0.707 (≈ 1/√2) — this is the famous equal superposition state a single Hadamard gate produces, giving a perfect 50/50 split. It's the opening move of nearly every quantum algorithm on this site, including Grover's Algorithm.
4. Mini Quantum Circuit Builder
Build a tiny quantum circuit by stacking gates on a single qubit starting in state |0⟩, and watch the resulting probabilities update live. Real quantum circuits chain together exactly this kind of gate sequence — see our Quantum Circuit entry for the full picture.
P(measure 0)
100.0%
P(measure 1)
0.0%
Try this
Add H then Z then H again. You'll land on |1⟩ with 100% probability — this exact three-gate sequence (H–Z–H) behaves like an X gate, a neat example of how different gate sequences can produce identical results.
5. Decoherence Time Visualizer
Every qubit gradually loses its quantum state through decoherence. This tool models that decay using a simplified exponential curve based on a qubit's T₁ time — the characteristic time scale at which a qubit tends to lose its state.
Probability state survives intact
67.0%
Comparable to trapped-ion systems like IonQ Forte, which boast coherence times far longer than superconducting qubits.
Try this
Set elapsed time equal to T₁ exactly. The survival probability will always land at about 36.8% (1/e) — this is the actual mathematical definition of T₁: the time at which a qubit's signal has decayed to about a third of its original strength. Compare this against real hardware on our Hardware Database.
3. Bell State Measurement Simulator
Two qubits are prepared in the entangled Bell state |Φ+⟩ = (1/√2)(|00⟩ + |11⟩). Neither qubit has a definite value before measurement — but the moment you measure Qubit A, Qubit B's outcome is instantly determined too, no matter how far apart they are.
Qubit A
?
Qubit B
?
Click the button a few times — notice the two qubits always agree, even though each individual outcome is random.
What this proves (and doesn't)
This correlation is real and has been confirmed experimentally countless times — but it cannot be used to send information faster than light. To even notice the correlation, someone has to physically bring the two results together and compare them, which takes ordinary, slower-than-light communication. See our Entanglement entry for the full explanation of why.
6. Quantum Random Number Generator
Measuring a qubit in equal superposition produces a genuinely unpredictable 0 or 1 — not a number calculated from a hidden formula, the way classical "random" numbers are. This is the basis of real commercial quantum random number generators.
Quantum vs classical "random"
Classical software random number generators use a deterministic mathematical formula — given the same starting "seed," they produce the exact same sequence every time, making them predictable in principle. A quantum measurement has no such seed — the outcome is fundamentally undetermined until measured, per the measurement collapse process, not just difficult to predict.
7. Encryption Breaking Time Estimator
Adjust an RSA-style key length and see the qualitative gap between classical brute-force difficulty and Shor's Algorithm's polynomial scaling on a large, error-corrected quantum computer.
Classical computer
~2.1 million years
Large quantum computer
~2.4 hours
Important caveat
These numbers are illustrative of the exponential-vs-polynomial gap discussed in our Quantum Complexity Theory article — not a precise hardware benchmark. No quantum computer today is anywhere close to large or reliable enough to run Shor's Algorithm at these key sizes. See our Harvest Now, Decrypt Later entry for why this matters today anyway.
8. Qubit Infrastructure Cost Estimator
A playful, order-of-magnitude estimate of what it might cost to build a superconducting quantum processor with a given qubit count — dilution refrigerator plus per-qubit control electronics.
Rough estimated infrastructure cost
$3.5M
Dilution refrigerator
$2.0M
Control electronics
$1.5M
This is a rough illustration, not a real quote
Real costs vary enormously by qubit quality, fabrication yield, and vendor — this tool exists to build intuition for why a dilution refrigerator is a large fixed cost regardless of qubit count, while control electronics scale with each additional qubit. Compare this intuition against Rigetti's Novera, the first commercially purchasable QPU.
9. Step-by-Step Bell State Builder
Walk through exactly how a Bell state gets built, one gate at a time — the same H + CNOT sequence used in our Your First Qiskit Circuit tutorial.
Step 1 of 4
Start: |00⟩
Both qubits begin in the |0⟩ state.
10. Which Algorithm Fits My Problem?
Answer one question to get pointed toward the right starting point in our 50-algorithm database.
What does your problem mostly involve?
Keep exploring