Quantum hardware
Fire Opal + IBM
The original unitary QASM receives full Z-basis measurements and separate all-0/all-1 readout calibration.
- 120 qubits
- SCV and meson states
- Raw and corrected counts
Quantum simulation · SU(2) lattice gauge theory
A reproducible workbench for non-Abelian hadron dynamics — from 120-qubit QASM on IBM hardware to tensor networks and an explicitly validated LSH Hamiltonian.
Not one algorithm on three machines, but three complementary lines of evidence: hardware execution, the same compiled circuits on classical MPS simulators, and independent small-system validation of the underlying Hamiltonian.
01 · Architecture
Each route answers a different part of the reproducibility question.
Quantum hardware
The original unitary QASM receives full Z-basis measurements and separate all-0/all-1 readout calibration.
Circuit level
The same compiled QASM is simulated locally as a matrix-product state.
Physical validation
Local LSH operators are embedded in Gauss-law-valid sectors and checked against exact evolution.
02 · Physics
The Loop-String-Hadron representation rewrites the local degrees of freedom as one bosonic loop variable and two binary fermion occupations.
Dimensionless Hamiltonian
Abelian Gauss Law on every link
NL = nℓ + no(1 − ni)NR = nℓ + ni(1 − no)From Z-basis counts
The local signal is Δnf = nfmeson − nfSCV.
03 · Results
The timings below use different scopes. That distinction is part of the result.
Fire Opal main circuits
0.987shardware-only · 512 shots · ibm_fezFire Opal smoke runs
| Step | Depth | Raw Δnf | Readout-corrected | Hardware time |
|---|---|---|---|---|
| 05 | 66 | −0.75195 | −0.76425 | 0.987 s |
| 10 | 125 | +0.32422 | +0.33484 | 1.581 s |
| 15 | 177 | −0.06836 | −0.05441 | 2.175 s |
| 20 | 237 | −0.38672 | −0.39000 | 2.769 s |
Hardware time = estimated circuit duration × shots. Queueing, compilation, API wait and local decoding are excluded.
Dense ↔ MPO/TDVP · N = 4
1.20 × 10−8RMSE in local Q profileEnergy difference
1.11 × 10−11exact versus TDVP evolutionNorm difference
2.50 × 10−13small-system smoke test04 · Claim boundaries
A fast execution time is compelling only when task, accuracy and time definition are matched.
05 · Start here
Purpose, directories and current claim boundary.
Hardware route, runtimes and benchmark results.
From Z-basis counts to Q and Δnf.
The route from the local LSH basis to MPO/TDVP.
The compact, current timing interpretation.
Open, inspectable, bounded