Sunday, November 22, 2026Sun, Nov 22

Moon: waxing gibbous, 93% litAurora: quiet

Español

Space, Earth and the natural world, explained.

What Is Quantum Computing? How It Works in Plain English

Quantum computers use qubits, which hold a mix of 0 and 1, to speed up certain problems. This covers how they work and their limits.

Detailed close-up of electronic microchips on a circuit board.
Photo: Jakub Pabis / Pexels

Quantum computing is a way of processing information with the rules of quantum physics. Instead of bits that are always 0 or 1, a quantum computer uses qubits, which can hold a blend of both until they are measured. For a small set of problems this lets the machine reach answers far faster than any ordinary computer, but for everyday tasks it offers no advantage.

How is a qubit different from a regular bit?

A regular bit is a switch that is either off (0) or on (1). Every file, photo and web page on a laptop is a long string of those two values.

A qubit is a tiny physical system, such as a single atom, an ion, a particle of light or a small superconducting circuit cooled close to absolute zero. Its state is described by probabilities for 0 and 1 at once, a property called superposition. When you measure the qubit, you get a single 0 or 1, and the probabilities decide which one you see.

Two or more qubits can also become entangled, which means their results are correlated in a way that no pair of ordinary bits can copy. Entanglement and superposition together are the raw material of quantum algorithms.

How does a quantum computer actually compute?

A program for a quantum computer is a sequence of operations called gates, which change the probabilities attached to each possible outcome. The goal is to arrange the gates so that wrong answers cancel each other out (a wave effect called interference) and the right answer becomes the most likely result when you measure.

The machine does not try every answer at once and pick the best one, a common misunderstanding. It works only when a clever algorithm shapes the interference so that the useful answer stands out. Most problems have no known algorithm that does this, which is why quantum computers are not simply faster versions of laptops.

What can quantum computers do better?

Researchers have identified a few problem types where quantum methods are expected to beat classical ones.

  • Simulating molecules and materials, since atoms themselves follow quantum rules and are hard to model on ordinary machines. This matters for chemistry, batteries and drug research.
  • Factoring very large numbers, which Shor’s algorithm could do much faster than known classical methods. Much of today’s internet encryption relies on that task being hard.
  • Searching unsorted data, where Grover’s algorithm gives a smaller speedup than the factoring case.
  • Certain optimization and sampling problems, where the benefit is still being studied.

Sorting email, running a spreadsheet, streaming video and browsing the web would not run faster on a quantum machine.

Why are quantum computers so hard to build?

Qubits are fragile. Heat, stray radiation, vibration and even the act of looking at them can disturb their state, an effect called decoherence. When that happens, the stored information is lost or scrambled.

Because of this, many designs run in vacuum chambers or refrigerators colder than outer space. Gate operations also make small errors, and those errors pile up as a program gets longer.

The standard remedy is quantum error correction, which spreads one reliable logical qubit across many physical qubits and checks for faults along the way. It works in principle and has been shown in small experiments, but a machine large enough to run long, useful programs still requires many more qubits than current devices contain.

Does quantum computing threaten encryption?

A large, error-corrected quantum computer running Shor’s algorithm could break widely used public-key encryption such as RSA. Machines that big do not exist today. Even so, security agencies take the risk seriously, because data stolen now could be decrypted later.

The US National Institute of Standards and Technology (NIST) has run a public process to choose new encryption methods, called post-quantum cryptography, that run on ordinary computers and are designed to resist quantum attacks. Organizations are moving toward these standards gradually.

What kinds of quantum computers exist?

Several hardware approaches compete, each with trade-offs in speed, error rate and ease of scaling up.

  • Superconducting circuits are fast and use techniques borrowed from chip manufacturing, but they need extreme cooling.
  • Trapped ions hold their state for a long time and have low error rates, but operations are slower.
  • Neutral atoms held by laser beams can be arranged in large arrays.
  • Photonic machines use particles of light and can operate at room temperature in parts of the system.

No approach has clearly won. Current devices are often called noisy intermediate-scale machines, because they have limited qubits and make errors that cannot yet be fully corrected.

Common questions

Will quantum computers replace regular computers?

No. They are specialized tools for particular problems, probably used alongside classical machines, which would handle the rest of a task. Ordinary computers remain better for nearly everything people do daily.

Can I use a quantum computer today?

Some companies and research labs offer cloud access to small quantum machines for learning and experiments. The results are mostly of scientific and educational interest, because current devices are too small and error-prone for most practical jobs.

Is quantum computing the same as quantum mechanics?

Quantum mechanics is the physics theory that describes atoms and light. Quantum computing is an application of that theory, in which engineers control quantum systems to carry out calculations.

Site editor: Nikita Sheikin

Prepared by The Science Beat with AI-assisted drafting and automated fact checks — see our editorial policy. Spotted an error? Tell us.