A qubit is simply 0 and 1 simultaneously
A qubit has amplitudes and phase; measurement does not reveal both basis values.
Qubits, phase, interference, entanglement, gates and measurement explained progressively—without claiming that a quantum computer simply tries every answer.
A quantum computer prepares qubits in a controlled quantum state, transforms that state with gates, uses phase and entanglement to create interference, and measures samples from the resulting probability distribution. It does not expose every possible answer. A successful algorithm is designed so unwanted computational paths tend to cancel and useful outcomes become more likely. Repeated measurements provide classical data, which is usually processed by a classical computer. Noise limits today’s circuits, so large algorithms will require quantum error correction.
A classical bit has a definite value, 0 or 1. A qubit can be described by two complex amplitudes associated with the computational basis states. Their squared magnitudes determine measurement probabilities, and together they must be normalised.
Before measurement, the amplitudes are part of one quantum state. Saying the qubit is “both 0 and 1” can be shorthand, but it becomes misleading if it suggests that both values can simply be read out. One computational-basis measurement produces one classical bit.
The relative signs and complex phases of amplitudes are essential.
Place qubits in a known initial state, usually the computational zero state.
A gate such as Hadamard creates a superposition of basis possibilities.
Other gates change amplitudes and phase according to the problem.
Later operations combine paths so some amplitudes reinforce and others cancel.
Measurement draws an outcome; repeated runs estimate the final distribution.
Two or more qubits are entangled when their joint state cannot be written as separate independent states for each qubit. Measuring one can be correlated with measurement of another even when neither had a definite individual value beforehand.
Entanglement is a computational resource in many protocols, but it does not permit faster-than-light messaging. Local measurement outcomes are random; correlations become visible only when ordinary classical information is compared.
| Component | Role | Example |
|---|---|---|
| State preparation | Initialises a known input | Reset qubits to |0⟩ |
| Single-qubit gate | Rotates a qubit state and changes phase | Hadamard or parameterised rotation |
| Entangling gate | Creates interactions between qubits | CNOT, CZ or native ion interaction |
| Circuit | Ordered sequence implementing an algorithm | State preparation, oracle and interference steps |
| Measurement | Converts selected quantum observables to classical outcomes | Repeated bit strings or expectation estimates |
A qubit has amplitudes and phase; measurement does not reveal both basis values.
Measurement exposes limited information. Algorithms must engineer interference.
Correlations do not enable controllable faster-than-light communication.
State reconstruction requires many measurements and scales poorly.
Known advantages apply only to selected problem structures and cost models.
Interference, entanglement, algorithm design and efficient input/output all matter.
Qubits interact unintentionally with their environment and suffer imperfect control and measurement. Errors accumulate as circuits become larger and deeper. Repeating a noisy computation cannot repair systematic loss of the intended distribution.
Quantum error correction encodes logical information across physical qubits and repeatedly measures error syndromes. It can in principle support arbitrarily long computation below suitable thresholds, but it introduces major hardware and classical-decoding overhead.
Its state can contain amplitudes associated with many basis states, but measurement cannot retrieve them all. The algorithm must make useful outcomes more probable through interference.
For certain problems, quantum algorithms use structure, interference and entanglement to require fewer operations than known classical algorithms. Hardware overhead and data movement can reduce practical gains.
Measurement is probabilistic. Repeated shots estimate probabilities, expectation values or the frequency of candidate answers.
Small circuits and some protocols can, but scalable speedups often involve correlations or other non-classical resources. Entanglement alone is not sufficient for advantage.
A quantum gate is a controlled reversible transformation of one or more qubits. Gates change amplitudes and relative phases, and sequences of gates form quantum circuits.
21 min read
Algorithms28 min read
Fundamentals18 min read
QuantumNews separates demonstrated results from vendor targets and forecasts. Technical claims are checked against primary research, official documentation and disclosed benchmark conditions. Metrics from different hardware architectures are not treated as directly interchangeable.
14 July 2026 — Initial detailed editorial draft created for review.
Found an error or newer technical evidence? Contact the QuantumNews editorial team.