A quantum measurement can use fewer qubits by giving one a second job
Explainer: A worked example shows how a measurement helper can become part of the quantum output, using fewer qubits at once but more stages.
Reading tools for text size, copying, printing and your reading list

A quantum computer can sometimes save hardware by making one do two jobs: help carry out a measurement, then become part of the quantum result. The trick is scheduling, not squeezing extra storage into a qubit.[3][4]
A theoretical study by Soham Sau and Michal Sedlák, published in Quantum on November 10, gives a general construction for such adaptive measurements. The work first appeared as a preprint in December 2025. This week's development is journal publication, not a new experiment.[1][2]
A quantum measurement produces more than a number. It also changes the quantum system left behind. A “quantum instrument” describes both, so replacing one implementation with another must preserve the outcome probabilities and the corresponding output states.[3]
Consider a worked example calculated by QubitWire: one input qubit, a two-qubit output and four possible measurement labels. Choose an instrument whose state change for each label is represented by a single matrix. The standard one-step construction adds three qubits: one for the enlarged output and two for the four-way measurement record.[3][4]
An adaptive construction needs just one added qubit. It helps obtain the first binary result, is reset, and helps obtain the second. Those two recorded bits distinguish four labels. After another reset, an operation chosen from the recorded results makes that qubit part of the two-qubit output. This third stage involves no measurement. The total falls from four qubits to two, with three stages instead of one. This is an ideal resource calculation, not a measured hardware saving.[4]
The output preserves the specified measurement’s state change; it does not create a second copy of the input.[3][4]
Reusing measurement helpers is not new: a 2008 paper already described binary-tree generalized measurements. Sau and Sedlák’s broader framework includes the state left behind and cases where the quantum output grows.[5][4]
The practical catch is the extra control work. IBM's hardware documentation identifies classical decision latency and limited qubit coherence as constraints on adaptive circuits. Reset and readout must also work reliably. Sau and Sedlák assume error-free operations and do not establish a general gate-count saving.[6][7]
For readers comparing quantum machines, the useful question is therefore not just how many qubits a task needs. It is how many must exist at once, what extra steps reuse demands, and whether the final output still meets the same accuracy target.[6][7]