Steven GellerQuantum Computing, End to End

Book contents

Current section

Part VII. Hardware Architecture

  1. The Full Quantum Computer Stack
  2. Superconducting Qubits
  3. Trapped Ions
  4. Neutral Atoms
  5. Photonics
  6. Silicon Spin Qubits
  7. Cat Qubits and Bosonic Encodings
  8. Topological Qubits and Evidence Standards
  9. Cryogenics, Control, Packaging, and Manufacturing
  10. Quantum-Centric Supercomputing and Hybrid Workflows

Part VII. Hardware Architecture · Chapter 61

Topological Qubits and Evidence Standards

Topological qubits promise the best deal in quantum computing — hardware that protects itself from noise — at the highest evidentiary price in the field. This chapter is about paying that price correctly: knowing what has been measured, what has been interpreted, and what is still narrative.

Artifact
In this chapter 17 sections

Require a device-specific alternative-hypothesis analysis, reproducible material/transport signatures, a defined two-level encoding, initialization/readout, controlled operations with errors, nonlocal or topological protection evidence, and an architecture/resource path; each rung is necessary and no lower rung inherits the name qubit automatically.

This chapter sets an evidence ladder and does not declare that any current program has or has not reached a rung without newly registered primary evidence. A zero-bias feature, material signature, or roadmap simulation is not by itself braiding, protected operation, or a logical qubit.

Topological-qubit evidence ladder with inference gatesMaterial and transport signatures lead through reproducibility, qubit initialization and readout, controlled protection, and architecture; each transition requires a discriminating test.signalreproduceinit + readprotected oparchitecturealternativesindependent dataoperation errorresource closureprohibited leap:lower rung≠ scalable qubit
Figure 61.1. Topological-claim evidence ladder and alternative-hypothesis ledger: The ladder prevents a transport feature, reproduced device, initialized qubit, protected operation, and architecture from collapsing into one claim.

Write the claimed primitive before reading the signal

State the proposed encoding, excitation, control operation, readout, protection mechanism, and alternative explanations.

Every other qubit in this part of the book fights noise actively: isolate the device, cool it, shield it, measure its errors, correct them. Topological approaches try to delete whole categories of error at the physical level. The idea is to store quantum information in collective properties of a specially engineered material — properties that depend on the global topology of the state rather than on any local detail. Local noise, which is what nature mostly offers, then cannot tell the encoded states apart well enough to corrupt them.

Topological approaches seek nonlocal protection but require staged device and operation milestones before scalable computing claims. [majorana-evidence-review] [fu-kane-majorana]

Topological protection begins as a conditional theory claim

In a topological model, quantum information is encoded in global degrees of freedom so sufficiently local perturbations cannot directly distinguish or corrupt it. Operations may be represented by braiding or measurement sequences whose result depends on topology rather than microscopic path details. Kitaev's anyon construction supplies a foundational theoretical account [kitaev-anyons]. A physical roadmap must still show that the proposed material and device realize the necessary low-energy system, maintain parity, initialize and read states, and implement operations within a useful error budget.

The phrase “topological qubit” should therefore be decomposed into claims. Is the evidence for a material phase, a localized bound state, non-Abelian statistics, a controllable two-level system, a protected operation, or a scalable architecture? Each sits on a different rung. A result on one rung can motivate the next experiment without licensing the conclusion at the top.

Language audit: Search summaries for verbs such as “proves,” “confirms,” and “realizes,” then require the direct observable and excluded alternative beside each. When the control does not exclude ordinary mechanisms, use conditional language and name the unresolved explanation. Precision about uncertainty is not hostility to the research; it is what makes a later advance legible.

Device signatures need discriminating controls

Build a claim table pairing each observable with mundane alternatives and decisive experimental controls.

The upside is as large as any in quantum computing. If the physical qubit arrives with intrinsic protection, the enormous overhead of quantum error correction shrinks, and the path from one qubit to a useful machine shortens by orders of magnitude. The risk is symmetric. The underlying physics is subtle, the device signatures are easy to confuse with mundane effects, and the distance from an interesting measurement to a working logical qubit spans several layers of proof, each of which has to be earned.

Physical implementation still requires initialization, controlled operations, measurement, and scalable connection. [kitaev-anyons]

Transport features have ordinary alternatives

Zero-bias conductance features and related signatures in hybrid nanowire devices were important early evidence consistent with Majorana bound states [mourik-majorana-signatures]. Similar features can also arise from disorder, smooth confinement, quantum dots, Andreev bound states, heating, or measurement artifacts. A strong claim packet specifies the observable, device configuration, parameter range, preprocessing, and all alternatives considered.

Demand controls that discriminate rather than merely reproduce the headline shape: dependence on magnetic field, gate voltage, temperature, tunnel coupling, device length, and nonlocal probes; stability across sweeps; and replication across independently fabricated devices. Preserve negative and ambiguous devices. Selecting one favorable trace after exploring many settings changes the statistical question and must be disclosed.

Reproduction strengthens only the same rung

Separate repeated devices, independent analysis, and independent laboratories from a shift to qubit operations.

So this chapter takes no side on whether topological qubits will win. It teaches a posture instead: disciplined curiosity. Know what would count as evidence, what would weaken the thesis, and which rung of the ladder comes next. High-upside research is worth tracking; it is not worth confusing with an engineering path.

A material or transport signature and an operational qubit are distinct evidence classes. [majorana-evidence-review] [mourik-majorana-signatures]

Material signature, parity control, and qubit operation are separate rungs

A candidate bound-state signature is below demonstrated parity-state preparation and measurement. Parity control is below coherent manipulation. Coherent manipulation is below an operation whose error is protected by the claimed mechanism. For every rung, list prerequisite rungs, direct observable, alternative hypothesis, discriminating control, and forbidden inference. The evidence-roadmap literature is useful precisely because it refuses to collapse these steps [majorana-evidence-review].

At the operation rung, require sequences that distinguish topological behavior from a calibrated but ordinary two-level system. Test path deformation or another invariance implied by the mechanism, while tracking poisoning, leakage, initialization, and measurement. A finite device has splitting and thermal processes; protection is quantitative and conditional, not an on/off label.

A qubit contract begins at initialization and readout

Demand a two-level system, state preparation, measurement, calibration, and quantified error.

Grade topological claims with the same score used throughout this part: decision score = claim quality + proof progress − risk − kill criteria pressure . Claim quality carries unusual weight here. A well-formed claim distinguishes an observed physical signal from the interpretation of that signal, an interpretation from an independent reproduction, a reproduced device from a defined qubit, a defined qubit from demonstrated operations, and operations from a scaling architecture. Sloppy claims compress all six layers into one sentence.

Full-stack resource and control assumptions remain necessary even if a physical degree of freedom supplies intrinsic protection. [full-stack-review]

Replication must include devices, cooldowns, and analysis

Repeating a sweep on the same tuned device measures short-term repeatability. Stronger replication uses new tunings, cooldowns, devices, wafers, laboratories, and analysis pipelines. Report denominators at each level: devices fabricated, devices measured, devices meeting prespecified criteria, and traces included. A replication that depends on undisclosed tuning judgment does not establish manufacturing control.

Analysis should be blinded or prespecified where practical. State thresholds before examining the decisive dataset, separate exploratory from confirmatory measurements, and include uncertainty from calibration and model choice. Independent reanalysis of raw data can expose whether a feature survives background subtraction or alternate fitting. “Consistent with” is appropriate when alternatives remain; it should not be paraphrased downstream as “demonstrates.”

Operations must demonstrate the proposed protection

Require controllable gates or braiding-equivalent operations and an error signature tied to topology.

For the money question, think in expected value: EVPr(technical success)VCwaitCcapital\operatorname{EV}\approx\Pr(\mathrm{technical\ success})V-C_{\mathrm{wait}}-C_{\mathrm{capital}} . The value term is legitimately large — that is what makes the field interesting. The discipline lives in the probability term, which should move when evidence arrives and only then, and in the cost terms, which are real whether or not the physics cooperates. A decision to fund, monitor, or walk away is a statement about all four terms, not a mood about one of them.

Any claim about current topological-qubit status needs new primary experimental sources beyond this registered milestone roadmap. [majorana-evidence-review]

The architecture adds unprotected operations

Even if a non-Abelian platform supplies protected operations, initialization, measurement, magic-state preparation or other universality mechanisms, classical feedback, and coupling between modules may not share the same protection. Resource estimates must label protected and unprotected primitives separately. A low error assigned to a braid cannot be applied to measurement or state injection without evidence.

Poisoning time, operating temperature, energy gap, control duration, readout fidelity, and device yield jointly determine whether the protected primitive is useful. The Fu–Kane proposal is primary theory for realizing Majorana physics through superconducting proximity at a topological-insulator surface [fu-kane-majorana]; implementation claims require device-specific evidence rather than inheritance from the model.

Architecture and resource estimates close the gap

Trace control, coupling, fabrication, decoding, and scaling assumptions without letting simulations validate missing hardware.

Suppose a memo must evaluate a topological program. A weak memo notes that the upside is enormous and concludes the decision is obvious — obvious yes or obvious no, depending on the author's temperament. A strong memo walks the ladder:

Topological approaches seek nonlocal protection but require staged device and operation milestones before scalable computing claims. [majorana-evidence-review] [fu-kane-majorana]

Classify a claim packet with explicit prohibited conclusions

For each supplied exhibit, record its rung and one conclusion it cannot support. A transport peak may support “candidate signature under these settings” and prohibit “braiding demonstrated.” Reproduction in several devices may support improved robustness and prohibit “protected qubit.” A parity-lifetime measurement may support a control timescale and prohibit “universal operation.” An architectural simulation may support conditional resource exploration and prohibit “hardware milestone.”

Then identify the alternative hypothesis with the highest remaining explanatory power and design the next discriminating experiment. The experiment should specify expected observations under both hypotheses and an analysis threshold. “More data” is not a discriminating plan. A nonlocal correlation, fusion-rule test, controlled parity sequence, or operation invariant may be valuable only when the apparatus and assumptions needed to interpret it are written in advance.

One rule for the claim packet

Every exhibit must be accompanied by the strongest supported sentence and a stronger prohibited sentence. Reviewers then score the evidence, alternative hypothesis, control, and replication independently. Disagreement is preserved rather than averaged into artificial certainty. The packet advances a rung only when the decisive observable and prespecified control are present; roadmap simulation or repeated publicity cannot substitute for the missing experiment.

Make alternative explanations compete quantitatively

An evidence ladder is strongest when a candidate interpretation is evaluated beside explicit alternatives under the same observations. List which control changes temperature, field, geometry, tunnel coupling, poisoning environment, or measurement protocol; state the predicted response for the proposed topological mechanism and for leading non-topological explanations. A feature that persists is informative only if persistence discriminates among those models.

Reproduction should preserve device recipe, selection rules, analysis code, excluded data, uncertainty, and the exact claimed rung. Independent observation of a transport signature strengthens that signature; it does not supply initialization, a calibrated two-level space, controlled operations, or protected scaling. Advancement requires a new operational test with its own failure modes.

At the architecture rung, connect the candidate primitive to control lines, readout, coupling, fabrication yield, timing, and error correction. If a simulation supplies an unmeasured gap, poisoning rate, or operation error, label the result conditional on that input. The prohibited inference field is essential: it records the attractive next claim that the current evidence does not yet support.

Claim-to-source ledger

Topological approaches seek nonlocal protection but require staged device and operation milestones before scalable computing claims. [majorana-evidence-review] [fu-kane-majorana]

Physical implementation still requires initialization, controlled operations, measurement, and scalable connection. [kitaev-anyons]

A material or transport signature and an operational qubit are distinct evidence classes. [majorana-evidence-review] [mourik-majorana-signatures]

Full-stack resource and control assumptions remain necessary even if a physical degree of freedom supplies intrinsic protection. [full-stack-review]

Any claim about current topological-qubit status needs new primary experimental sources beyond this registered milestone roadmap. [majorana-evidence-review]

Topological-claim evidence ladder and alternative-hypothesis ledger

Format: Machine-readable claims with rung, observable, alternative explanation, control experiment, reproduction status, source IDs, uncertainty, and prohibited inference.

Artifact acceptance contract
inputoutputreject when
assumptions, units, source/date, workloadraw and derived values, uncertainty, commandunits or comparison scope are missing
synthetic fixture labeled syntheticdeterministic record and PASS lineattributed to real hardware
named baselinesame task and denominatormetric or evidence class differs
RUNGS = {1:{"signal","alternative","control"}, 2:{"signal","alternative","control","replication"}, 3:{"signal","alternative","control","replication","encoding","initialize","readout"}, 4:{"signal","alternative","control","replication","encoding","initialize","readout","gate","error"}}
def highest(packet, current=False):
    if current and not {"source", "date"} <= packet.keys():
        raise ValueError("current claim lacks primary source/date")
    return max([0] + [rung for rung, fields in RUNGS.items() if fields <= packet.keys()])
def authorize(packet, claim):
    rung = highest(packet)
    if claim == "logical operation" and rung < 4:
        raise ValueError("operation exceeds evidence")
    return claim, rung
packet = {"signal":1,"alternative":"disorder","control":"field sweep","replication":2,"simulation":"roadmap","source":"primary-X","date":"2026-01-01"}
baseline = highest(packet, current=True)
counterfactual = highest({**packet, "encoding":1,"initialize":1,"readout":1,"gate":1,"error":.01}, current=True)
try:
    authorize(packet, "logical operation")
    raise AssertionError("signal promoted to operation")
except ValueError:
    blocked = True
try:
    highest({key:value for key, value in packet.items() if key == "signal"}, current=True)
    raise AssertionError("undated current claim accepted")
except ValueError:
    undated_rejected = True
assert baseline == 2 and counterfactual == 4
assert blocked and undated_rejected
print(f"PASS: 61 evidence ladder signal_rung={baseline} operation_rung={counterfactual} promotion_blocked={blocked} undated_rejected={undated_rejected}")

Verification: Every rung transition requires its own evidence fields; schema blocks `logical operation` when only material-signal fields are populated; all current claims require primary sources/dates.

Commissioned exercise

Prompt: Classify a supplied synthetic claim packet containing a transport signal, device replication, initialization result, and roadmap simulation into the evidence ladder.

Deliverable: Completed ledger, alternative explanations, next control per claim, prohibited inferences, and the highest supported rung.

Pass condition: No simulation or signal is promoted to an operation; each rung cites its own evidence and defines a falsifying control.

Verifiable solution

Format: Reference classified packet and evidence-ladder rubric.

Verification: Schema validation plus blinded reviewer agreement on supported/prohibited rung transitions.

A packet containing a signal, device replication, and a simulation supports rung 2 of the evidence ladder. It does not populate encoding, initialization, readout, gate, or error fields, so the highest allowed claim is replicated signal evidence—not an operational or protected qubit.

Companion work

Artifacts for this chapter

These entries resolve to checked-in local source. Commands are reproduced exactly from the chapter manifest, and source-embedded fixtures are exported as direct downloads.

  1. Reproduce or test

    python3 tools/validate_briefs.py --briefs data/editorial_briefs_36_63.json --from 36 --through 63 --check-rewritten-sources --execute-artifacts

Provenance

Sources and review

  1. A. Yu. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics. 2003primary peer-reviewed theory paper
  2. Vincent Mourik et al.. Signatures of Majorana Fermions in Hybrid Superconductor-Semiconductor Nanowire Devices. Science. 2012primary peer-reviewed experiment
  3. Liang Fu and C. L. Kane. Superconducting Proximity Effect and Majorana Fermions at the Surface of a Topological Insulator. Physical Review Letters. 2008primary peer-reviewed theory paper
  4. David Aasen et al.. Milestones toward Majorana-based quantum computing. Physical Review X. 2016peer-reviewed evidence roadmap
  5. Lieven M. K. Vandersypen et al.. A look at the full stack. Nature Reviews Physics. 2021peer-reviewed perspective

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