ExperimentsExperiment 1 · Foundations
Classical Bits
Flip bits and watch 2ⁿ combinations appear.
- 1. Learn
- 2. Watch
- 3. Interact
- 4. Predict
- 5. Run
- 6. Observe
- 7. Record
- 8. Answer
- 9. Research
① What is the problem?
How does a computer store information using only 0s and 1s?
② How does a classical computer approach it?
Each bit is a switch that is definitely 0 or definitely 1. Many bits together encode numbers, letters and pictures.
③ How does the quantum approach differ?
A qubit can hold a superposition — but measuring it still gives one bit. This experiment builds the classical baseline first.
④ What is happening mathematically?
n bits have 2ⁿ possible patterns. The pattern bₙ₋₁…b₁b₀ represents the number Σ bᵢ·2ⁱ.
⑤ What does the simulation show?
Each bit flipping between 0 and 1, the decimal value, and how the number of combinations doubles for every extra bit.
⑥ What did we learn?
Adding one bit doubles the number of patterns. A classical register holds exactly one pattern at a time.
⑦ What can you experiment with?
Use 4 bits and count up from 0000 to 1111. How many steps did it take? Predict the count for 8 bits.