A real quantum computer
The quantum physics of the hardware performs the computational steps.
Start with a qubit. Then explore shared states and the idea behind quantum search. Illustrations help you get started; we explain the limits of each analogy.
Your learning path
Try an experiment. Continue when you are ready for the next idea.
A qubit measurement gives you 0 or 1. The coin toss shows why equal probabilities can produce different counts.
A classical bit has the value 0 or 1. A qubit can be in a superposition of both possibilities. The coin is a starting point: a measurement gives one outcome, with a probability we can calculate. Amplitudes distinguish this from a coin toss. Like waves, they can reinforce or cancel each other.
The real idea: before measurement, both amplitudes can contribute to the calculation. Measurement gives only one result. The program determines the probabilities.
The spinning is just a picture. A qubit does not have to physically rotate, and many qubits do not reveal every answer simultaneously. One measurement gives one bit string.
A covered coin cannot fully describe this difference. A qubit also has a relative phase. With suitable gates, it changes the probabilities of a later measurement. This interference makes superposition useful in quantum programs.
Explore interference
Two water waves can reinforce or cancel each other. Contributions in the quantum model combine in a similar way. Shift the waves relative to each other and compare the probabilities of 0 and 1.
The qubit starts in 0. We apply H, change the relative phase, then apply H again. The probability of 0 is cos²(phase / 2), and of 1 is sin²(phase / 2). Your browser calculates these values; it does not draw measurement samples.
The moving lights and curves are an illustration. They do not show particle trajectories or measured computation speed.
The animation compares a path-by-path search with a wave analogy. A quantum program can change amplitudes to suppress unwanted outcomes and amplify a target. This requires a suitable circuit. The preset animation timings are not measured computation times.
Amplitudes can reinforce or cancel each other. A search algorithm such as Grover uses interference to increase the probability of a match step by step. A measurement does not always succeed. Performance depends on the problem and the chosen gates.
The maze illustrates the idea but does not run Grover's algorithm. Try a calculated search in the combination-lock experiment.
Reveal the first coin and predict the second. Here, both show the same outcome. The explanation covers why entanglement means more than matching coins.
Two coins illustrate an entangled pair: one in Berlin and one in New York. In this example, measurements in the same basis give matching results. Each result on its own is random. The pair shares a quantum state; it sends no message. Matching coins illustrate correlation but do not, on their own, demonstrate entanglement.
Imagine a left glove and a right glove sent in separate parcels to Berlin and New York. Finding the left glove in Berlin tells you that New York has the right one. That is ordinary correlation: the contents were fixed when packed.
The quantum difference emerges when comparing different measurement settings. Entangled states can show correlations that no local model with predetermined glove properties reproduces. Our coin analogy shows just one setting, not that full test.
Bell tests distinguish quantum correlations from local models with predetermined outcomes. Experiments with entangled photons and violations of Bell inequalities were honoured with the 2022 Nobel Prize in Physics. They do not allow messages to travel faster than light.
The real idea: entangled systems can produce correlations over large distances. Experiments have repeatedly demonstrated this.
One coin does not send the other a message. The correlation becomes visible when the two result records are compared.
A quantum computer processes information using quantum systems, such as individual atoms or specialised electrical circuits. Its units of computation are called qubits.
An ordinary computer works with bits. A quantum program instead changes a shared quantum state. Possibilities can reinforce or cancel one another like waves. At the end, a measurement gives a classical result.
The quantum physics of the hardware performs the computational steps.
Our ordinary i9 calculates a mathematical model of these steps. This lets us try and test programs without owning a quantum computer.
The lock introduced one such program. Now we explore its basic ideas in order: a qubit, waves and shared states. The analogies help explain them; they are not a complete description of the physics.
Researchers operate superconducting qubits in refrigerators near absolute zero. The gold structure illustrates such a refrigerator. Other technologies use atoms or spins in diamond, for example. Our simulator lets you explore quantum programs without owning quantum hardware.
Researchers calculate molecular energies and properties. These models can support drug research. Further studies are needed to establish a medicine's safety and effectiveness.
Researchers use quantum models to study battery materials and catalysts, testing which methods improve on existing classical calculations.
For routes and delivery plans, researchers compare quantum algorithms with classical optimisers. A practical advantage must be demonstrated on a specific task.
Application status: Many proposed applications require larger, error-corrected quantum computers. Researchers are testing which tasks justify the effort. Here you can explore the underlying programs in a simulator.
Five questions, instant explanations. Wrong guesses are welcome.
Predict a result and let our computer simulate the quantum circuit.