What is quantum computing?

Fill a basin with water and let it settle. Now drop two small stones in at the same moment.

Rings spread out from each stone and meet in the middle. Where two high points meet, the water rises higher. Where a high point meets a low point, the water goes flat. Nothing was added and nothing was taken away, and the waves simply added up in some places and cancelled out in others.

A quantum computer runs on that idea, and it sets up a sum as a set of waves. Then it arranges for the wrong answers to cancel out and the right answer to grow. That is the whole trick.

What is a qubit?

A normal computer stores everything as bits, and a bit is a light switch. It is off, written as 0, or on, written as 1. Every photo, song and message on your phone is a long line of those switches.

A quantum computer uses a qubit instead. A qubit can hold a mix of 0 and 1 at the same time. The mix has a size and a timing, much as a wave has a height and a rhythm. When you finally look at a qubit, the mix ends and you read a plain 0 or 1.

The mix is called superposition. Our guide to the qubit goes deeper into it.

How does it work, step by step?

1. Set the qubits to a known start, usually all 0.
2. Put them into a mix that covers many possible answers at once.
3. Apply gates. A gate is an operation that nudges the mix, and it can tie qubits together so they act as one.
4. Steer the waves so that wrong answers cancel and the right one grows.
5. Measure. You get back one string of 0s and 1s.
6. Run the whole thing many times and see which answer keeps coming back.

Step four is the hard part, because writing a quantum program means finding a way to make the right answer likely. If you cannot do that, the machine just hands you noise.

Does it try every answer at once?

No. That picture is popular and it is wrong.

A machine with many qubits does hold a huge number of possibilities at the same time. However, you never get to read them, because one measurement gives you one answer. The whole art lies in the cancelling, and holding many possibilities is the easy half.

Therefore a quantum computer will never be a faster version of your laptop. It is a different tool, useful for a short list of jobs.

What is it good at?

Three areas are widely agreed.

The first is chemistry and materials. Molecules obey quantum rules already, and a quantum machine can copy those rules directly. Therefore it may model a catalyst, a battery material or a fertiliser reaction more cheaply than a normal computer can.

The second is factoring. Shor’s algorithm, named after Peter Shor, can find the prime factors of a very large number far faster than any known ordinary method. That matters because much of the safety on the internet rests on factoring being slow.

The third is searching an unsorted pile. Grover’s algorithm cuts the number of tries to roughly the square root of the usual number. That is a real gain, and a modest one.

What is it bad at?

Almost everything else. A quantum computer will not open your email faster or run a spreadsheet.

Qubits are also very delicate, because heat, stray light and small knocks push them out of their mix. This loss has a name. It is called decoherence, and it happens fast. Every extra qubit and every extra step adds more chances for an error to creep in.

The answer to that is quantum error correction, which spreads one steady qubit across many shaky ones. It works, and it costs a great deal of hardware.

Why are the machines so cold?

It depends on the design.

The most common design uses tiny superconducting loops on a chip. Those loops only behave as qubits when they are extremely cold, colder than deep space. The chip sits inside a large fridge that cools it in stages. The gold chandelier you see in photographs is that fridge, and the computer itself is the small chip at the bottom.

Other designs work in other ways. Some hold single atoms in place with lasers, and some use single particles of light. These do not all need the same deep cold, and each design trades speed against steadiness.

Where does it stand as of 2026?

Machines exist, and you can rent time on them over the internet. However, they are still noisy and still small in the way that counts.

Watch the number of steady, error-corrected qubits rather than the raw qubit count. That steady number is still very low. Progress on error correction has been real over the past few years. Several groups have now shown that a larger code can beat a smaller one.

Treat any claim of a broken code or a solved industry problem with care. Ask what the machine actually ran, and then ask whether a normal computer could have done the same job in a reasonable time.

What should you do about it?

For most people the honest answer is: nothing yet, with one exception.

The exception is encryption. Data stolen today can be stored and opened years later, once a big enough machine exists. That is why the move to post-quantum cryptography has already started, long before the machines are ready.

Here is one thing to check this month. List what you or your employer store that must stay secret for ten years or more. Medical records, legal files and long contracts all qualify, and those are the files to protect first.

Just Out Tech explains new research in plain language. This article was drafted with AI assistance and checked by a human against the original source.