
At a Glance
Quantum computing processes information with qubits, which can exist in a blend of 0 and 1 until measured. A group of n qubits is described by 2^n numbers at once, and algorithms use interference to boost correct answers. In superconducting chips, each qubit switches by absorbing a microwave photon of energy E = h f.
- Basic unit
- Qubit (quantum bit)
- Key effects
- Superposition, entanglement, interference
- State size
- n qubits need 2n amplitudes
- Qubit energy
- E = hf (microwave photons for superconducting qubits)
- Main obstacle
- Decoherence: noise destroys quantum states
- Idea proposed
- Early 1980s, including Richard Feynman
On this page
- What Is Quantum Computing?
- Quantum Computing Explained Simply
- What Is a Qubit?
- How Do Superposition and Interference Help a Quantum Computer?
- What Role Does Entanglement Play?
- How Are Qubits Built?
- Why Do Quantum Computers Need to Be So Cold?
- What Is Decoherence and Why Is It the Biggest Problem?
- What Can Quantum Computers Be Used For?
- Where Did Quantum Computing Come From, and Where Is It Now?
- How Can You Learn the Physics Behind Quantum Computing?
- Common Misconceptions
- Key Facts
- Quiz
- FAQ
What Is Quantum Computing?
Ordinary computers store information as bits, each of which is either 0 or 1. Every app, photo and message on a phone is a long pattern of these two values, switched by billions of tiny transistors. A quantum computer replaces bits with qubits, and qubits follow the rules of quantum physics rather than everyday logic.
A qubit can be 0, 1, or a weighted blend of both called a superposition. Several qubits can also become entangled, so their results are linked in ways no set of separate bits can copy. A quantum algorithm steers these blended, linked states so that wrong answers cancel out and the right answer becomes likely when the qubits are finally measured.
Quantum computers are not simply faster versions of laptops. They are special-purpose machines that should beat classical computers on certain problems and offer no advantage on most everyday tasks.
Quantum Computing Explained Simply
Picture a coin. A normal bit is like a coin lying flat: heads or tails. A qubit is more like a coin spinning on the table. While it spins, it is not yet heads or tails, but it has a definite chance of landing on each side.
Now imagine many spinning coins whose spins are tied together, so that how one lands affects how the others land. A quantum computer nudges all those spins at once, in a careful pattern, before letting them fall. The trick is to arrange the nudges so the coins are much more likely to land showing the answer you want.
The catch is that the coins are very fragile. A tiny bump, a little heat or a stray signal makes them fall too early, and the calculation is ruined. Keeping qubits quiet is the hardest part of building a quantum computer.
What Is a Qubit?
A qubit is any quantum system with two distinct states that can be labeled 0 and 1. Its general state is written
The amplitudes carry more than probabilities. They also have a phase, a sense of where each part sits in its wave cycle, much like the wave function of a particle. Phases are what allow amplitudes to add up or cancel, and that is where quantum computing gets its power.
Measurement changes everything. Once a qubit is read, its superposition collapses to the result you saw, and the original amplitudes are gone. A quantum computer therefore cannot simply print out all the numbers it holds; it can only reveal one outcome per run.
| Property | Classical bit | Qubit |
|---|---|---|
| Possible states | 0 or 1 | 0, 1 or a superposition of both |
| Result when read | The stored value | 0 or 1, with set probabilities |
| Effect of reading | None | Collapses the superposition |
| Can be copied | Yes | No, an unknown state cannot be cloned |
| Linked behavior | Independent | Can be entangled with other qubits |
| Typical physical form | Transistor voltage | Superconducting circuit, ion, atom, photon or spin |
| Sensitivity to noise | Low | Very high |
| Source: Descriptive comparison of classical and quantum information · Retrieved October 2026 | ||
How Do Superposition and Interference Help a Quantum Computer?
Two qubits are described by four amplitudes, one each for 00, 01, 10 and 11. Three qubits need eight, and n qubits need 2n. That doubling means 50 qubits already involve more than a quadrillion amplitudes, as the table below shows, and storing them on an ordinary computer quickly becomes impossible.
A common myth says a quantum computer simply tries every answer at once. In reality, it applies a sequence of operations called quantum gates that make amplitudes interfere, just like overlapping waves. Paths leading to wrong answers are arranged to cancel, as in destructive interference, while paths leading to the right answer reinforce each other.
Designing that pattern is hard, which is why only some problems have known quantum shortcuts. Without a clever interference pattern, measuring a big superposition just gives a random answer.
| Qubits (n) | Amplitudes (2ⁿ) | Memory to store them on a classical computer |
|---|---|---|
| 1 | 2 | 32 bytes |
| 2 | 4 | 64 bytes |
| 10 | 1,024 | about 16 kilobytes |
| 20 | 1,048,576 | about 17 megabytes |
| 30 | about 1.07 billion | about 17 gigabytes |
| 40 | about 1.10 trillion | about 17.6 terabytes |
| 50 | about 1.13 quadrillion | about 18 petabytes |
| Source: Computed as 2ⁿ amplitudes × 16 bytes each (one complex number stored as two 64-bit values); decimal prefixes · Retrieved October 2026 | ||

What Role Does Entanglement Play?
When qubits are entangled, the state of the group cannot be described by listing the state of each qubit separately. Measure one qubit of an entangled pair and you immediately know something about the other, even though neither had a definite value beforehand.
Entanglement is what lets the full set of 2n amplitudes matter. If qubits never became entangled, a classical computer could track each one on its own and simulate the machine easily. Quantum gates that act on two qubits at once, such as the controlled-NOT gate, are the tools that create and use entanglement during a calculation.
How Are Qubits Built?
Any well-behaved two-level quantum system can serve as a qubit, and several very different technologies are in use:
- Superconducting circuits. Tiny loops of metal cooled until they carry current with no resistance behave like artificial atoms with their own energy levels. The two lowest levels are 0 and 1, switched with microwave pulses.
- Trapped ions. Single charged atoms are held in place by electric fields in a vacuum, and lasers flip their internal states.
- Neutral atoms. Uncharged atoms are held in grids of focused laser beams and linked by exciting them to large, strongly interacting states.
- Photons. Light particles store information in properties such as polarization or path.
- Spin qubits. The spin of a single electron trapped in a semiconductor, similar to the chips in a regular computer, acts as the two states.
For a superconducting qubit the gap between 0 and 1 is set by the photon that bridges it, through
Many quantum computers flip their qubits with microwave or laser photons, and the energy each photon carries follows the Planck relation. Here it is with each symbol and its SI unit.
| Symbol | Quantity | SI unit |
|---|---|---|
| photon energy | joule (J) | |
| Planck constant (6.626 × 10⁻³⁴ J·s (exact: 6.62607015 × 10⁻³⁴)) | joule second (J·s) | |
| frequency | hertz (Hz) |
Rearranged to find another variable:
Example 1 Energy of a qubit's microwave photon
A superconducting qubit switches between its 0 and 1 states when it absorbs a microwave photon of frequency 5.0 GHz. Using h = 6.626 070 15 × 10⁻³⁴ J·s and 1 eV = 1.602 176 634 × 10⁻¹⁹ J, what is the photon energy in microelectronvolts?
- Given:
- Planck constant:
- frequency:
- Planck constant:
- Formula:
- Substitute:
- Answer:
That is roughly a hundred-thousandth of the energy of a visible-light photon, so even faint heat can disturb the qubit.

Why Do Quantum Computers Need to Be So Cold?
Heat is random energy, and random energy can flip a qubit or scramble its phase. At room temperature the typical thermal energy is about 26 meV, more than a thousand times larger than the tiny energy gap of a superconducting qubit. To keep heat from swamping the qubits, the chips sit inside dilution refrigerators at around 10 to 20 thousandths of a kelvin, colder than deep space.
Cold also matters for the metal itself. The circuits only become superconducting well below a few kelvin, and extra cooling removes stray particles of heat that would otherwise wander through the chip. Other designs, such as trapped ions and neutral atoms, avoid the large refrigerator but still need laser cooling and an ultra-high vacuum.
Example 2 Which qubit frequency matches the fridge's thermal energy?
A dilution refrigerator holds a quantum chip at 20 mK (0.020 K). Using the Boltzmann constant k_B = 1.380 649 × 10⁻²³ J/K and h = 6.626 070 15 × 10⁻³⁴ J·s, at what frequency, in gigahertz, would a photon carry the typical thermal energy k_B T?
- Given:
- Planck constant:
- k_B:
- T:
- Planck constant:
- Formula:
- Substitute:
- Answer:
Because this is far below a typical 5 GHz qubit frequency, stray heat at 20 mK is rarely enough to flip a qubit by accident.
Example 3 Wavelength of the control signal
The control pulses for a qubit are microwaves at 5.0 GHz traveling at c = 299 792 458 m/s in free space. What is their wavelength?
- Given:
- speed of light in vacuum:
- frequency:
- speed of light in vacuum:
- Formula:
- Substitute:
- Answer:
A wavelength of a few centimeters is why qubit chips are wired with microwave cables and resonators of similar size.
What Is Decoherence and Why Is It the Biggest Problem?
Decoherence is the gradual loss of a qubit's quantum behavior as it interacts with its surroundings. Vibrations, stray fields, heat and imperfect control all leak information out of the qubit, and its superposition decays toward an ordinary, uncertain 0 or 1. The time this takes is called the coherence time, and every calculation must finish well within it.
Even inside a well-shielded machine, gates are not perfect, so errors pile up during long calculations. The answer is quantum error correction: spreading one reliable logical qubit over many physical qubits and constantly checking for mistakes without measuring the data itself. It works in principle, but it may take hundreds or thousands of physical qubits for each dependable logical one.
The graph below shows an illustrative exponential loss of quantum coherence over time.

What Can Quantum Computers Be Used For?
Researchers expect the largest benefits in a few specific areas:
- Simulating nature. Molecules and materials are quantum systems, so a quantum computer can model them naturally. This could help design catalysts, batteries and medicines.
- Factoring. Shor's algorithm, published in 1994, can factor large numbers efficiently on a large error-corrected machine, which would break some of today's public-key encryption.
- Searching. Grover's algorithm speeds up searching an unsorted list, though only by a square-root factor rather than exponentially.
- Optimization and sampling. Some scheduling, finance and machine-learning problems may benefit, though clear advantages there are still being studied.
Because of the factoring threat, new encryption methods designed to resist quantum attacks have already been standardized and are being rolled out.
Where Did Quantum Computing Come From, and Where Is It Now?
In the early 1980s, physicists including Richard Feynman pointed out that simulating quantum systems on ordinary computers becomes hopeless as they grow, and suggested building computers out of quantum parts instead. During the 1990s, the discovery of Shor's and Grover's algorithms and the first error-correcting codes turned the idea into a serious field.
Today's machines contain from dozens to more than a thousand physical qubits, but they are still noisy and limited by decoherence. Researchers have shown carefully chosen tasks where quantum hardware outpaces classical simulation, and early demonstrations of error-corrected logical qubits. A large, fault-tolerant quantum computer able to run Shor's algorithm on real encryption keys does not yet exist.
How Can You Learn the Physics Behind Quantum Computing?
Quantum computing rests on a handful of core ideas: superposition, measurement, entanglement and interference. Our classical vs quantum physics comparison is a good starting point, followed by the pages on superposition and entanglement linked above. For the photon side of qubit control, try the photon energy calculator with a few gigahertz frequencies, and use the electromagnetic spectrum worksheets to place microwaves among the other bands of light.
Common Misconceptions
Myth: A quantum computer tries every possible answer at the same time and picks the right one.
Physics: Measuring a superposition gives just one random outcome. The speedup comes from interference patterns that make the right answer likely, and only some problems allow such patterns.
Myth: Quantum computers will replace ordinary computers.
Physics: They are special-purpose machines. For email, video and most everyday software, classical computers are faster, cheaper and far more reliable.
Myth: A qubit is secretly 0 or 1, and we just do not know which.
Physics: A superposition is not hidden ignorance. Its amplitudes can interfere, which produces results that no hidden 0-or-1 value could explain.
Myth: More qubits automatically means a more powerful quantum computer.
Physics: Qubit quality matters as much as quantity. Error rates, coherence times and how well the qubits connect decide what a machine can actually compute.
Key Facts
- Quantum computing processes information with qubits, which can hold a superposition of 0 and 1.
- Measuring a qubit always gives 0 or 1, with probabilities set by its amplitudes.
- Describing n qubits takes 2ⁿ amplitudes, so 50 qubits involve more than a quadrillion numbers.
- Quantum algorithms use interference to cancel wrong answers and strengthen right ones; they do not simply try every answer.
- Superconducting qubits switch with microwave photons of a few gigahertz and run near 10 to 20 thousandths of a kelvin.
- Decoherence, the leak of quantum behavior into the environment, is the main obstacle to large quantum computers.
- Quantum computers are expected to excel at simulating molecules, factoring and certain searches, not everyday computing.
Quick Quiz: How Well Do You Know Quantum Computing Basics?
6 questions. Tap an answer to check it.
What can a qubit be before it is measured?
A qubit can hold a weighted blend of 0 and 1 until it is measured.
How many amplitudes are needed to describe 3 qubits?
n qubits need 2ⁿ amplitudes, and 2³ = 8.
What happens when you measure a qubit in superposition?
Measurement gives a single outcome and destroys the original superposition.
Why are superconducting quantum chips cooled to about 20 thousandths of a kelvin?
At such low temperatures thermal energy is far smaller than the qubit energy gap.
What is the main effect quantum algorithms use to reach the right answer?
Amplitudes for wrong answers cancel while those for the right answer reinforce.
Which task is a quantum computer expected to do especially well?
Molecules are quantum systems, so quantum hardware can model them naturally.
Frequently Asked Questions
What is quantum computing in simple terms?
Quantum computing is a way of computing that uses the rules of quantum physics. Instead of bits that are only 0 or 1, it uses qubits that can be in a blend of both until they are measured. By linking qubits and making their possibilities interfere like waves, a quantum computer can solve certain problems much faster than a normal computer.
What is a qubit?
A qubit, or quantum bit, is the basic unit of quantum information. It is a physical system with two states labeled 0 and 1, such as two energy levels of a tiny superconducting circuit or two states of a trapped atom. Unlike a normal bit, it can be in a superposition of both states, described by two amplitudes that set the odds of each result.
How is a quantum computer different from a regular computer?
A regular computer stores definite 0s and 1s in transistors and processes them one logical step at a time. A quantum computer stores information in qubits that can be in superposition and entangled with one another, and it uses interference to reach answers. It is not faster at everything, only at certain problems where those quantum effects give a real shortcut.
Why do quantum computers need to be so cold?
Heat is random motion that can flip qubits or scramble their delicate quantum states. Superconducting qubits have very small energy gaps, so even a little thermal energy disturbs them. Cooling the chip to around 10 to 20 thousandths of a kelvin makes thermal energy much smaller than the qubit's energy gap, and it also keeps the circuits superconducting.
What can quantum computers do that normal computers cannot?
For certain tasks they could be dramatically faster. The best-known examples are simulating molecules and materials, factoring very large numbers with Shor's algorithm, and speeding up some searches with Grover's algorithm. In principle a normal computer can solve the same problems, but for large cases it would need impractically long times or impossible amounts of memory.
Can quantum computers break encryption?
A large, error-corrected quantum computer running Shor's algorithm could break widely used public-key methods such as RSA, which rely on factoring being hard. No existing machine can do this yet. To prepare, new post-quantum encryption standards that resist known quantum attacks have been published, and organizations have begun switching to them.
What is decoherence in quantum computing?
Decoherence is the loss of a qubit's quantum behavior caused by unwanted contact with its environment, such as heat, vibration or stray electromagnetic signals. It turns a useful superposition into an ordinary random mix. Every quantum calculation must finish before decoherence ruins it, which is why engineers isolate qubits carefully and develop error correction.
How many qubits does a useful quantum computer need?
It depends on the task and on qubit quality. Some chemistry simulations might need a few hundred high-quality logical qubits, while breaking modern encryption is estimated to require thousands of logical qubits. Since each logical qubit may need hundreds or more physical qubits for error correction, useful machines could require from hundreds of thousands to millions of physical qubits.
Sources
Constants come from NIST CODATA 2022 (public domain) and unit definitions from the BIPM SI Brochure (CC BY 4.0). Text, diagrams and illustrations are original work by Physics Tribune.








