Part I. Mental Model · Chapter 1
Computation Is Physical
A computer is a physical object before it is a mathematical one. This chapter builds the reflex the rest of the book depends on: whenever you hear a quantum claim, ask what stores the information, what transforms it, and what you are allowed to read at the end.
In this chapter 7 sections
Reader question. What concrete questions turn an abstract quantum-computing claim into an engineering claim?
Ask what physical system stores the state, which controlled transformations implement the computation, how noise acts during their duration, what measurement returns, and which classical baseline the entire process must beat.
- Current-vendor comparisons and commercial-advantage claims are outside this chapter.
- The scope is the operational contract shared by quantum theory and hardware implementation.
A bit occupies hardware
Ground symbolic information in distinguishable physical states.
Computation is a controlled physical process that represents and transforms information. A bit is a physical state—charge in a circuit, a magnetic domain, a voltage level—that we agree to read as 0 or 1. The symbols are conventional; the physics carrying them is not.
Classical engineering spent fifty years making the physics disappear. A modern laptop's bits are so stable that programmers can forget they are physical at all. Quantum computing offers no such luxury. The state is fragile, the control signals are analog, and the act of measurement changes what is left to measure. The physics is present from the first line of every quantum program, which is why this book starts here rather than with notation.
A useful first sentence about quantum computing is that it uses a different physical state space, and different allowed transformations, than an ordinary digital machine. “Strange” supplies no prediction; the state space does.
Evidence boundary. Computation is implemented by physical systems and constrained by physical law. [Richard P. Feynman] [National Academies of Sciences]
Four contracts define any computer
Specify state, transformations, I/O, and cost/error.
Every computational model, classical or quantum, answers the same four questions:
- State space. What configurations can the system be in?
- Allowed transformations. What operations can be applied to those configurations?
- Input and output rule. How does a problem get in, and how does an answer come out?
- Cost and error model. What does each operation cost, and what goes wrong?
For one classical bit, the state space is the set . For a register of bits it is the basis states, and a deterministic gate maps each basis state to another. Add randomness and you get probability distributions over basis states; still a classical model.
A quantum register keeps the same basis states but describes its condition with amplitudes over them. That is a richer description, and it is the source of everything quantum computing can do; but it comes with a catch that no amount of enthusiasm removes: you cannot read the amplitudes out. Measurement produces one classical record, drawn according to rules the amplitudes determine. The computation lives in the transformation; the answer you keep is classical.
So the physical version of the four questions becomes: What stores the state? Which transformations can you actually apply, at what error rate? What does the environment do to the state while you work? And what classical data does measurement produce? A claim that cannot answer these is not yet an engineering claim; it is a hope.
Evidence boundary. A viable quantum computer requires preparation/control, low enough error, measurement, and scalable system interfaces. [David P. DiVincenzo] [National Academies of Sciences]
Disassemble a qubit-count claim
Trace a concrete claim through storage, control, coupling, time, and readout.
Evidence boundary. Quantum state space and measurement rules differ from classical bits while outputs remain classical records. [Michael A. Nielsen] [John Preskill]
Notation contract: Use state space S, transformation T, measurement record y, runtime t, and error model E only after defining each operationally.
Where abstraction has not yet been earned
Explain why unstable interfaces leak device constraints upward.
If you come from software, read this chapter as a reminder that abstraction is earned. Classical computing gave you stable layers; transistor, gate, instruction set, language, service; each hiding the one below. Quantum computing is still fighting to stabilize the bottom layers, so the hiding does not work yet.
A useful mental model: a qubit is an API with unusually harsh implementation constraints. It exposes operations, but those operations come with latency, noise, topology restrictions, calibration drift, and readout limits. A quantum algorithm is not pseudocode; it is a request for a physical process that may or may not survive compilation and noise. And every serious quantum claim must end where it began; classical input, classical output, and a classical baseline to beat.
The claim worksheet
Turn the contracts into a reusable review artifact.
Physical-computation claim worksheet
| Field | Reader-visible record |
|---|---|
| Format | Fillable one-page ledger plus a completed device-claim example |
| Verification | Automated schema requires state carrier, controls, timing/noise, measurement record, algorithmic use, and named classical baseline. |
| Availability | Source-embedded acceptance record; no separate download is claimed |
{
"artifact": "Physical-computation claim worksheet",
"format": "Fillable one-page ledger plus a completed device-claim example",
"acceptance_test": "Automated schema requires state carrier, controls, timing/noise, measurement record, algorithmic use, and named classical baseline.",
"publication_state": "source-embedded contract and worked fixture"
}Scope boundary
- Current-vendor comparisons and commercial-advantage claims are outside this chapter.
- The scope is the operational contract shared by quantum theory and hardware implementation.
Depth commitment. Four computational contracts, one claim trace, and one completed worksheet.
Practice problem
Deconstruct a published or supplied quantum-device claim into the six physical contracts and identify the first missing measurement.
- Deliverable
- A claim worksheet with quoted source text and one evidence request per contract.
- Pass condition
- A rubric awards credit only when every assertion maps to a physical operation or record and the baseline is named.
Verification record
Expected solution form. Annotated exemplar plus contract-by-contract scoring rubric.
Model answer. A passing worksheet names a physical state carrier, preparation and control operations, interaction graph, duration and noise record, measurement output, algorithmic use, and classical baseline. The first blank or slogan-only field is the first missing measurement; qubit count alone fills none of the performance fields.
Model result and check. A schema validator rejects empty contracts; human verification checks each evidence request against the quoted claim.
Acceptance test. A rubric awards credit only when every assertion maps to a physical operation or record and the baseline is named.
Provenance
Sources and review
- Richard P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics. 1982primary paper
- National Academies of Sciences, Engineering, and Medicine. Quantum Computing: Progress and Prospects. National Academies Press. 2019consensus study report
- David P. DiVincenzo. The physical implementation of quantum computation. Fortschritte der Physik. 2000primary peer-reviewed perspective
- Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press. 2010textbook
- John Preskill. Lecture Notes for Physics 219: Quantum Computation. California Institute of Technology. 2018graduate lecture notes
The load-bearing claims in the chapter are mapped inline to this registered source set. A citation supports only the bounded claim beside it.