A Qubit in 60 Seconds

A single glowing orb split between electric blue and violet representing qubit superposition

The best explanations make the unfamiliar feel obvious in retrospect.


This is part of the Hyperdrift Quantum Day series. This piece is the foundation — start here if quantum feels abstract.


A classical bit

A classical bit is a switch. It is either off (0) or on (1). At any given moment, it is exactly one of those two things. Your laptop, your phone, every server running the internet — all of it is built from billions of these switches flipping between two states.

Simple. Deterministic. Understandable.


A qubit

A qubit is also a switch. But it obeys quantum mechanics, which means it does not have to pick a state until you look at it.

Before measurement, a qubit exists in a superposition of 0 and 1 simultaneously. Not randomly flipping between them. Actually occupying both states at once, with a probability distribution describing how likely each outcome is when you finally measure it.

When you measure it, it collapses to 0 or 1 — just like a classical bit. But while it is unmeasured, it is doing something no classical bit can: holding multiple possible states at the same time.


Why that matters computationally

Consider searching a list of one million items for a specific value.

A classical computer checks them one by one (or in parallel with more hardware). A quantum algorithm can, in certain configurations, evaluate all million possibilities at once in superposition — and then use interference (another quantum property) to amplify the probability of the correct answer rising to the top.

This is not magic. It is a consequence of the wave-like nature of quantum states. You are running computation over a probability landscape and sculpting it so the right answer becomes overwhelmingly likely.


The three properties that make qubits powerful

1. Superposition A qubit is 0 and 1 at the same time until measured. N qubits can represent 2ⁿ states simultaneously. 300 qubits can represent more states than there are atoms in the observable universe.

2. Entanglement Two qubits can be entangled such that measuring one instantly determines the state of the other, regardless of physical distance. Einstein called it "spooky action at a distance." It allows quantum computers to correlate information across qubits in ways classical systems cannot.

3. Interference Quantum computations work by setting up waves of probability that interfere with each other — wrong answers cancel out, correct answers amplify. This is how algorithms like Shor's and Grover's actually function.


The catch

Qubits are extremely fragile. Any interaction with the environment — a stray photon, a temperature fluctuation, vibration — causes decoherence: the qubit loses its quantum state and collapses prematurely.

This is why quantum computers currently live in cryogenic chambers cooled to temperatures colder than outer space (~15 millikelvin). It is why error correction is one of the hardest problems in the field. And it is why Google's Willow chip getting below the error correction threshold in late 2024 was such a significant milestone.

Current quantum computers are NISQ devices — Noisy Intermediate-Scale Quantum. Powerful enough to demonstrate quantum advantage on specific problems. Not yet powerful enough to run Shor's algorithm against production RSA keys. That window is narrowing.


The 60-second version

  • A bit is 0 or 1.
  • A qubit is 0 and 1 simultaneously until measured.
  • Superposition lets quantum computers explore many possibilities at once.
  • Entanglement links qubits across computations.
  • Interference amplifies correct answers and cancels wrong ones.
  • The result: certain problems that would take classical computers longer than the age of the universe can be solved in minutes.
  • The catch: qubits are fragile. We are getting better at keeping them stable.

That is it. That is the whole thing.


What this means for software

If you are a developer, the practical implication is not that you need to understand quantum mechanics in depth. It is that certain mathematical assumptions your software depends on — specifically, the hardness of factoring large numbers and computing discrete logarithms — are no longer permanent guarantees.

The crypto breakdown explains exactly which algorithms are affected. The Web3 provocation makes the case for why the blockchain ecosystem should be worried.

And Intel tracks the developments that matter as quantum moves from lab to infrastructure.


Part of the Hyperdrift Quantum Day series. Read the full context or go straight to the crypto breakdown.

Get weekly intel — courtesy of intel.hyperdrift.io