QS-DMSS / Evidence-first quantum readiness

Quantum Compilation Validation

A deterministic, simulator-only view of semantic preservation and circuit resource growth across fixed generic five-qubit topologies.

PASSGenerated 2026-07-13T02:26:19.563879+00:00No provider submission or authorized spend
Passing rows12 / 12Declared tolerance gate
Reference exact6Strict source tolerance
Bounded approximation6Compilation tolerance
Authorized cost$0.00Local ideal simulators only

Resource frontier

Recommended generic configuration

This is a software-target recommendation under the declared rule, not a hardware or provider recommendation.

Generic targetFully connected five-qubit target
OptimizationLevel 3
Depth34
CX gates13
State L2 error7.066e-07
Semantic classbounded approximation

Selection rule: minimum CX count, then depth and circuit size, among tolerance-passing Pareto rows

Topology sensitivity

Minimum-cost passing rows

Depth and CX counts reveal how connectivity changes routing cost for the same logical experiment.

Minimum-cost passing resource counts by generic topology Horizontal bars compare circuit depth and CX gate count for the lowest-CX passing row in each topology. Circuit depth CX gates Linear five-qubit chain 42 depth 19 CX Five-qubit ring 42 depth 19 CX Fully connected five-qubit target 34 depth 13 CX

Cost attribution

Where the recommended circuit grows

Direct component counts distinguish state preparation, SSFM evolution, measurement, and the complete experiment.

Recommended configuration resource attribution Horizontal bars compare circuit depth and CX gates by experiment component. Circuit depth CX gates Full Experiment 34 depth 13 CX Measurement 1 depth 0 CX Ssfm Evolution 27 depth 12 CX State Preparation 9 depth 2 CX

Validation matrix

All compilation results

Gold edge marks Pareto rows; the warm row is the resource-minimizing recommendation.

TopologyOptClassDepthCXState L2FidelityFrontierGate
Linear five-qubit chain 0 reference exact 173 156 2.566e-15 1.000000000 - PASS
Linear five-qubit chain 1 reference exact 147 144 2.282e-15 1.000000000 - PASS
Linear five-qubit chain 2 bounded approximation 43 20 7.066e-07 1.000000000 - PASS
Linear five-qubit chain 3 bounded approximation 42 19 7.066e-07 1.000000000 - PASS
Five-qubit ring 0 reference exact 159 147 2.029e-15 1.000000000 - PASS
Five-qubit ring 1 reference exact 147 135 2.025e-15 1.000000000 - PASS
Five-qubit ring 2 bounded approximation 43 20 7.066e-07 1.000000000 - PASS
Five-qubit ring 3 bounded approximation 42 19 7.066e-07 1.000000000 - PASS
Fully connected five-qubit target 0 reference exact 113 84 2.168e-15 1.000000000 - PASS
Fully connected five-qubit target 1 reference exact 108 84 1.530e-15 1.000000000 Pareto PASS
Fully connected five-qubit target 2 bounded approximation 35 14 7.066e-07 1.000000000 - PASS
Fully connected five-qubit target 3 bounded approximation 34 13 7.066e-07 1.000000000 Pareto PASS

Acceptance contract

What PASS means

  • Reference tolerance: 1.000e-10
  • Compilation tolerance: 1.000e-06
  • Checks: state L2 error, state fidelity, density total-variation distance, and unused-qubit leakage.
  • Global phase is aligned before logical-state comparison.

Scientific boundary

What this does not claim

Local, ideal-simulator validation of logical-to-target circuit semantics and resource attribution across fixed generic topologies. It is not physical hardware validation, calibrated-noise analysis, provider selection, QPU execution, cost prediction, quantum advantage, or scientific validation of the underlying Fractal SSFM model.

No provider, credential, remote API, QPU, or authorized spend was used.

Research object

Evidence companions

The HTML is the human-facing surface; machine-readable and integrity artifacts remain authoritative companions.