What Is Quantum Computing, Really?
- Define a decision problem
- Run a circuit
- Measure and verify
A quantum computer is a machine that processes information using controlled quantum states. That definition sounds distant from everyday computing, but the useful question is familiar: what information do we represent, what operations can we perform, and what answer can we read at the end?
You do not need to understand a laboratory refrigerator before exploring those questions. You do need to separate three things that often get mixed together: the mathematics of a quantum algorithm, the equipment that might execute it, and evidence that it helps with a particular task. This first article builds that distinction using a small planning problem you can inspect yourself.
Start with a decision you can write down
Imagine six possible backup links for a network. For each link, you choose yes or no. A classical program could store those decisions as six bits: 1 means install the link, and 0 means leave it out. There are 64 possible six-bit strings, from choosing nothing to choosing everything.
Suppose the budget allows exactly two links. Most strings are now invalid; only 15 satisfy the budget. Before discussing quantum computing, we already have the ingredients of an optimization problem: candidate answers, a constraint, and a score describing which valid answer we prefer.
This is the instance used by our Resilience Lab. Its small size is deliberate. We can check every candidate with an ordinary computer, which gives us a reference answer against which to examine the experiment.
What changes when the information is quantum?
A qubit is a quantum system with two chosen basis states, conventionally labelled 0 and 1. Its mathematical state can be a superposition of those basis states. When measured in that basis, it gives a classical outcome, 0 or 1, according to probabilities determined by its amplitudes. IBM's introduction to single quantum systems introduces this state-vector description.
The important word is amplitudes. Quantum operations change these quantities, including their relative phases. The computer does not simply keep a hidden ordinary answer and reveal it later. The rules for evolving amplitudes allow interference, where contributions to an outcome can reinforce or cancel each other.
For a beginner, this suggests a better question than “How many answers are being tried at once?” Ask: “How does this sequence of operations change the probabilities of useful measured outcomes?” That question connects the physics to something an experiment can actually report.
Why “it tries every answer” is misleading
Six qubits have 64 computational basis states, but measuring the register once produces one six-bit result. It does not print 64 answers or reveal every amplitude. If an algorithm creates a distribution that rarely produces useful answers, the size of its state description has not solved the problem.
Consider our budget again. A completely uniform distribution would put equal probability on all 64 strings. Only 15 meet the two-link constraint. Merely making a superposition therefore does not ensure a valid selection, much less the best one.
A useful algorithm needs additional structure. It must use the problem to change the state, then extract useful information through measurement. Different algorithms do this in different ways. There is no single “quantum mode” that automatically improves every computation.
A circuit is a recipe for changing the state
A quantum circuit specifies operations, called gates, and measurements. It is a description of a computation, rather like a recipe specifies a sequence of actions. The same circuit can be studied mathematically, simulated on a conventional machine, or implemented on compatible quantum hardware.
Those are different execution environments. A classical simulator calculates the quantum state using ordinary arithmetic. Hardware must physically prepare, control and measure quantum systems. An ideal simulation omits physical imperfections unless a noise model is deliberately added. IBM's quantum circuit introduction explains the connection between circuits and mathematical operations.
Our browser labs use an ideal statevector simulator. They implement the circuit mathematics locally; your laptop does not become a quantum processor. That makes the labs useful for learning and checking small examples, while leaving hardware performance as a separate question.
Why classical computing remains in the picture
Our experiments use QAOA, a method in which a classical optimizer chooses circuit angles. The simulator runs a circuit with those angles, calculates an objective expectation, and returns a value to the optimizer. After a bounded search, the experiment samples the resulting distribution.
That loop is hybrid: classical work and quantum-circuit work have distinct jobs. The original QAOA paper introduces the algorithmic approach. Our implementation and toy constraints are our own bounded teaching example; results from other problems do not establish a performance guarantee for this one.
The classical part is also responsible for checking the answer. A low circuit energy is insufficient if the selected network links violate the original budget. We verify the actual selection and show a separately computed exact baseline.
What would count as convincing evidence?
Imagine an experiment reports the best possible two-link selection. That is interesting, but incomplete. How often did valid selections appear? How many measurements were taken? Did the optimizer use many circuit evaluations? What was the runtime, and what did the classical baseline require?
The small instance lets an ordinary exhaustive solver inspect all 64 candidates. Matching its answer does not establish quantum advantage. It shows that the experiment found an answer we can independently identify as optimal for this toy model.
A credible larger comparison would need a defined task, suitable classical methods, comparable accuracy, resource accounting and reproducible measurements. The word quantum on a result panel cannot replace those details. NIST's quantum computing overview provides broader context for the field and its challenges.
Read your first result with three questions
Open the lab and start a run. First, identify what the bits mean: here they represent backup-link decisions. Next, inspect feasibility: exactly two links must be selected. Finally, compare the best feasible observed sample with the separately labelled classical optimum.
Keep the invalid outcomes in view. Their presence is information about the distribution, not an inconvenience to hide. A penalty can encourage a constraint without making every measurement satisfy it.
If you can explain the input decisions, the valid-answer rule and the meaning of the comparison, you have learned something more useful than a slogan about computing power. You are reading a quantum experiment as an experiment: a model, a procedure, an observation and a set of limits.
Continue with qubits, superposition and entanglement, or explore the Quantum Hub before following the hands-on guide later in this series.