Quantum and CircuitsReading edition

Benchmark and validation protocol

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

7.2 Benchmark and validation protocol

7.2.1 Fair comparison

A packet simulator and a full simulator should use the same precision, gate parameters, initial state, observable, and arithmetic path wherever possible. Report compilation separately from repeated application.

7.2.2 Required metrics

A complete benchmark should report:

  1. full and reduced dimensions,

  2. packet-discovery and compilation time,

  3. one-shot runtime,

  4. repeated-application runtime,

  5. peak memory,

  6. reconstruction or observable error,

  7. symmetry leakage,

  8. hardware and software versions,

  9. number of repetitions over which compilation is amortized.

7.2.3 Algebraic and numerical validation paths

For manageable \(n\), embed a random packet state into the full space, apply identical gates in both representations, and compare final states. The included numerical validation program performs this check for structurally invariant fixed-weight circuits using complex floating-point arithmetic, with reconstruction tolerance \(2\cdot10^{-12}\). The separate rational validation uses exact fractions and rational orthogonal gates. Exact subspace invariance is a property of the model, while near-machine-precision agreement is numerical evidence about this implementation.

7.2.4 Scaling studies

A scaling plot should include both fine packets and coarse packets. Fixed weight two demonstrates polynomial dimension. Parity demonstrates a constant-factor packet. Half filling demonstrates an exponential packet with a polynomial memory reduction factor. These controls prevent overinterpreting a speedup as a complexity collapse.

7.2.5 Leakage tests

Deliberately append a gate that breaks the proposed symmetry and verify that the simulator detects nonzero leakage. The archived tests break exact weight, parity, and weight modulo four, producing retained probabilities below one. A simulator that reports zero error after a symmetry-breaking gate without enlarging its representation is incorrect.

7.2.6 Reproducibility contract

The release preserves:

  • the benchmark JSON data,

  • the Python figure generator,

  • packet and gate utilities,

  • exact rational checks and separately labeled numerical validation tests,

  • LaTeX source,

  • deterministic build commands,

  • checksums of final artifacts.

Recorded computation

The release validation reproduces fixed-weight basis dimensions, residue partitions, symmetric/bosonic/fermionic dimension formulas, hypercube quotient symmetry, and full-vs-packet state reconstruction near machine precision.

Source and conversion record

Source SHA-256: ebaee84823d3aaef001d43588d779e3f10d7336de3194c466e8e8121bfb460f1

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index