Steven GellerQuantum Computing, End to End

Book contents

Current section

Part I. Mental Model

  1. Computation Is Physical
  2. Classical Information, Gates, Circuits, and Reversibility
  3. Probability vs Amplitude
  4. Qubits Without Mysticism
  5. Measurement and What It Does Not Mean
  6. Interference as the Engine of Quantum Algorithms
  7. Entanglement Without Faster-Than-Light Myths

Part I. Mental Model · Chapter 4

Qubits Without Mysticism

You can explain a qubit completely with one line of notation and one measurement rule — no parallel universes, no "0 and 1 at the same time." This chapter gives you that explanation, and the operational test that tells you whether any other explanation is honest.

In this chapter 7 sections

Reader question. What is a qubit in an operational model that predicts preparation, gates, and measurement without metaphor?

A pure qubit is a normalized ray in a two-dimensional complex state space: preparation fixes amplitudes up to global phase, unitary gates transform them, and a selected measurement returns one classical outcome with Born-rule probabilities.

Scope and non-goals.
  • Interpretations of quantum mechanics and metaphors about consciousness, parallel worlds, or wave-particle duality are outside scope.
  • Mixed states, tomography, and physical qubit modalities are deferred to their working chapters.
The whole life of one qubit The whole life of one qubit |0> H rotates amplitudes (|0> + |1>) / sqrt(2) real, internal, unobserved M measure in a chosen basis one bit: 0 or 1 P(0) = P(1) = 1/2 Everything before M is amplitude arithmetic. Everything after M is classical. The wire is the boundary.
Figure 4.1. Notice how little happens: one preparation, one gate, one measurement, one classical bit out. The superposition in the middle is real and it steers the outcome statistics; but it is never itself the output.

The smallest predictive definition

Introduce the state, normalization, and global-phase equivalence.

A qubit is a two-level quantum system used for computation. Relative to a chosen basis, its state is written as a superposition: ψ=α0+β1\lvert\psi\rangle=\alpha\lvert0\rangle+\beta\lvert1\rangle. The notation does not mean the qubit is a classical bit secretly holding two readable values. It means the state is carried by amplitudes over the basis states, and those amplitudes determine both measurement probabilities and future interference.

The popular phrase "both 0 and 1 at the same time" is too blunt to be useful. It hides the basis, the amplitudes, the normalization, the phase, and the measurement rule; which is to say, it hides everything that lets you calculate. When someone gives you that phrase, the charitable reading is that they know the sentence below and are saving time; the uncharitable reading is that they don't.

The sentence worth keeping is the one from this chapter's opening: a qubit is a normalized two-dimensional quantum state whose amplitudes are transformed by gates and sampled by measurement. It is plain, operational, and testable; and no experiment has ever demanded more poetry than that.

Evidence boundary. A pure qubit is represented by a normalized vector up to global phase in a two-dimensional complex Hilbert space. [John Watrous] [Michael A. Nielsen]

Preparation is a procedure, not a label

Tie |0>, |1>, and |+> to reproducible operations.

The computational basis consists of two column vectors, 0=(10)\lvert0\rangle=\begin{pmatrix}1\\0\end{pmatrix} and 1=(01)\lvert1\rangle=\begin{pmatrix}0\\1\end{pmatrix}. A general one-qubit pure state is a combination α0+β1\alpha\lvert0\rangle+\beta\lvert1\rangle with complex amplitudes satisfying α2+β2=1\lvert\alpha\rvert^2+\lvert\beta\rvert^2=1. Measurement in the computational basis returns 0 with probability α2\lvert\alpha\rvert^2 and 1 with probability β2\lvert\beta\rvert^2.

The basis is not a footnote. A state that looks spread out in one basis can be sharp in another; (0+1)/2(\lvert0\rangle+\lvert1\rangle)/\sqrt2 is a perfect 50-50 split in the computational basis and a single definite outcome in the Hadamard basis. Any explanation of a qubit that never names its measurement basis has left the most important variable unstated.

Evidence boundary. Unitary gates transform the state and projective measurement produces classical outcomes according to the Born rule. [Michael A. Nielsen] [John Preskill]

A gate changes future statistics

Trace H and Z without claiming both answers are readable.

Evidence boundary. A single qubit measurement produces one classical outcome rather than revealing its amplitudes. [Michael A. Nielsen] [National Academies of Sciences]

ψ=α0+β1,α2+β2=1,ψeiϕψ\lvert\psi\rangle=\alpha\lvert0\rangle+\beta\lvert1\rangle,\quad \lvert\alpha\rvert^2+\lvert\beta\rvert^2=1,\quad \lvert\psi\rangle\sim e^{i\phi}\lvert\psi\rangle(4.1)

Notation contract: State |ψ>=α|0>+β|1>, |α|²+|β|²=1; states differing by e^{iφ} are physically equivalent; basis always named.

One shot, one classical record

State exactly what measurement provides and removes.

A qubit resembles none of the familiar escapes; not a nullable Boolean, not a fuzzy Boolean, not a hidden pair of values. It is a state object with strict transformation and observation rules: gates transform the state, measurement samples from it and changes what information remains available afterward.

The closest lesson from ordinary practice is interface discipline. Know which operations are legal, which data can be observed, which data stays internal, and what failure modes exist. Quantum software that ignores these boundaries produces explanations that sound plausible in a meeting and fail under calculation; and the calculation always arrives eventually, because someone has to compile the circuit.

Metaphors tested against an experiment

Reject only descriptions that fail the phase-sensitive test.

Operational qubit card

Acceptance contract for Operational qubit card
FieldReader-visible record
FormatInteractive prepare-transform-measure card plus downloadable state trace
VerificationTests assert normalization, global-phase equivalence, one-bit shot outputs, and phase-sensitive repeated statistics.
AvailabilitySource-embedded acceptance record; no separate download is claimed
{
  "artifact": "Operational qubit card",
  "format": "Interactive prepare-transform-measure card plus downloadable state trace",
  "acceptance_test": "Tests assert normalization, global-phase equivalence, one-bit shot outputs, and phase-sensitive repeated statistics.",
  "publication_state": "source-embedded contract and worked fixture"
}

Scope boundary

  • Interpretations of quantum mechanics and metaphors about consciousness, parallel worlds, or wave-particle duality are outside scope.
  • Mixed states, tomography, and physical qubit modalities are deferred to their working chapters.

Depth commitment. One definition, three operations, one falsification circuit, and a scored explanation exercise.

Practice problem

Evaluate three popular qubit explanations by deriving one experimental prediction from each and rejecting those that cannot distinguish |+> from |->.

Deliverable
A three-row explanation/prediction/verdict table with one explicit circuit.
Pass condition
The solution applies H then Z-basis measurement and requires opposite deterministic predictions for |+> and |->.

Verification record

Expected solution form. Operational prediction table plus exact circuit trace.

Model answer. The normalized-vector explanation predicts that |+> and |-> differ after H; a hidden pre-existing Z bit does not. A Bloch-vector explanation makes the same single-qubit prediction but does not generalize as a list of independent arrows for entangled registers.

Model result and check. A statevector fixture validates the predictions; the rubric rejects explanations with no falsifiable output.

Acceptance test. The solution applies H then Z-basis measurement and requires opposite deterministic predictions for |+> and |->.

Provenance

Sources and review

  1. John Watrous. The Theory of Quantum Information. Cambridge University Press / University of Waterloo. 2018textbook
  2. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press. 2010textbook
  3. John Preskill. Lecture Notes for Physics 219: Quantum Computation. California Institute of Technology. 2018graduate lecture notes
  4. National Academies of Sciences, Engineering, and Medicine. Quantum Computing: Progress and Prospects. National Academies Press. 2019consensus study report

The load-bearing claims in the chapter are mapped inline to this registered source set. A citation supports only the bounded claim beside it.

Cite this chapter