Edukaizen

Menu
  • Home
  • Hubbard 1D
    • Part 1: 1D Hubbard model
    • Part 2: Snake layout and fSWAP
    • Part 3: Qiskit and Fire Opal
    • Part 4: 120-qubit run
    • Part 5: Time-to-answer
    • Part 6: Tensor networks
    • Part 7: Majorana propagation
    • Part 8: Heatmaps
    • Part 9: 2D Hubbard outlook
    • Part 10: Quantum computer as a lab
  • Hubbard 2D
    • Part 1: 1D to 2D
    • Part 2: Cuprates
    • Part 3: 3×3
    • Part 4: Time
    • Part 5: 4×4
    • Part 6: 6×6 Fez
  • Hadron
    • Deel 1: Hadron op quantumprocessor
    • Deel 2: Quarks en confinement
    • Deel 3: SU(2) en LSH
    • Deel 4: Hamiltoniaan en circuit
    • Deel 5: Fire Opal
    • Deel 6: Klassieke simulaties
    • Deel 7: Quantumvoordeel
  • Black Hole OLE
    • Part 1: What we ran
    • Part 2: How OLE works
    • Part 3: Fire Opal and Kingston
    • Part 4: The tensor-network challenge
    • Part 5: Hawking and scrambling
    • Part 6: What the result proves
    • Part 7: Local toy model
    • Part 8: QGSS26 compatibility
  • Random Graph
    • Start here
    • Part 1: Theory
    • Part 2: Circuit
    • Part 3: Qiskit
    • Part 4: Complexity
    • Part 5: Verification
    • Part 6: Workflow
    • Part 7: Conclusion
  • QOS QML
    • Nederlands
    • English
    • Beginnershandleiding 4q
  • Advantage List
Menu

Pro Student Quantum Advantage List

Edukaizen benchmark register

Pro Student Quantum Advantage List

Five complete, challengeable student-scale quantum projects. Four show a local time-to-answer or runtime separation under declared resources; Random Graph remains diagnostic because output-quality matching is open.

Definition used here. A local practical advantage means that a measured quantum workflow reached a useful answer faster than a named classical workflow for the same stated task on the resources actually available to the project. It is not proof against every classical algorithm, GPU cluster, supercomputer, or future implementation.

The current list

Project Scale Primary quantum timing Classification
1D Fermi-Hubbard 120 qubits / 60 sites 33.148928 s Local time-to-answer separation
SU(2) hadron dynamics 120 qubits / 60 sites 1.425408 s Paper-aligned local separation
Operator Loschmidt Echo Q80 80 qubits 328 s Local runtime lower bound
Random Graph Sampling 70 qubits 19 s Diagnostic only
PBMC68k QML 60q 60 qubits 26 s Local runtime lower bound

Entry 1 · Local time-to-answer separation

Fermi-Hubbard dynamics on 120 qubits

A 60-site Fermi-Hubbard hardware workflow produced local charge, spin, and double-occupancy observables and was compared with local MPS and observable-specific Majorana calculations.

Scale120 qubits / 60 sites
BackendIBM Kingston through Q-CTRL Fire Opal
Primary timing33.148928 s
TaskEstimate local observables after 30 Trotter steps at model time t=6

Measured comparison. The quantum execution proxy was 272.50x shorter than the local chi=256 MPS wall time for this declared instance.

Quantum result. The hardware produced a full 120-qubit observable profile; raw mean double occupancy was 0.22862549 and readout-corrected mean double occupancy was 0.23067722.

Classical baselines

Method Wall time Status
Local quimb MPS with maximum bond dimension chi=256 9,033 s not fully converged; maximum bond reached the requested cap
Local Majorana propagation with cutoff 2 20.96 s faster than the quantum proxy but visibly inaccurate
Local Majorana propagation with cutoff 4 1,153.51 s close to the chi=256 value for this selected observable

Official sources

  • Hartnett et al., large-scale Fermi-Hubbard digital quantum simulation
  • Rausch et al., GPU and symmetry-aware classical challenge

Complete implementation

  • Edukaizen project
  • GitHub implementation
  • Detailed article

Claim boundary

  • This is a local time-to-answer result, not a reproduction of the paper's headline practical-advantage claim.
  • The chi=256 MPS baseline did not establish full convergence.
  • The fast Majorana route demonstrates that observable-specific classical methods can change the ranking.

Entry 2 · Paper-aligned local separation

Non-Abelian SU(2) hadron dynamics on 120 active qubits

A Loop-String-Hadron implementation follows a differential hadron signal on a 60-site lattice and compares the quantum route with local circuit-MPS checks and published tensor-network and Pauli-propagation baselines.

Scale120 qubits / 60 sites
BackendIBM hardware through Q-CTRL Fire Opal
Primary timing1.425408 s
TaskEstimate differential hadron observables and verify the conserved charge sector

Measured comparison. Both the local circuit checks and the paper-native baselines show a substantial runtime separation under their declared timing definitions.

Quantum result. The local hardware route produced charge-sector and differential-observable data for the 120-qubit circuit family.

Classical baselines

Method Wall time Status
Local Aer MPS on compiled QASM 34.281305 s completed local sanity baseline
Local ITensorMPS on compiled QASM 174.611 s completed local sanity baseline
Published Pauli propagation on CPU at step 5 477.4471 s published baseline
Published Pauli propagation on GPU at step 5 547.581 s published baseline
Published ITensor TDVP tensor network at step 5 584.092 s published baseline

Official sources

  • Ilcic et al., Observation of Robust and Coherent Non-Abelian Hadron Dynamics on Noisy Quantum Processors
  • Quantum Advantage Tracker issue 149
  • Official LSH-IBM circuit repository
  • Official lsh_data repository

Complete implementation

  • Edukaizen project
  • GitHub implementation
  • Detailed article

Claim boundary

  • Hardware-only time is not cloud wall time and excludes several service overheads.
  • The local scalar normalization remains distinct from the tracker's published hadron scalar.
  • The result supports runtime separation and circuit or sector validation, not an independent precision reproduction of every published observable.

Entry 3 · Local runtime lower bound

Operator Loschmidt Echo on 80 qubits

A tracker-compatible 80-qubit extension estimates an Operator Loschmidt Echo from finite computational-basis samples and compares the complete mitigated hardware action with a bounded tracker-linked BP-TN calculation.

Scale80 qubits
BackendIBM Kingston through Q-CTRL Fire Opal
Primary timing328 s
TaskEstimate a finite-sample Operator Loschmidt Echo scrambling observable

Measured comparison. The incomplete bond-dimension-64 classical delta half alone exceeded the complete Fire Opal action by more than 2.75x on this machine.

Quantum result. The measured delta/delta0 OLE ratio was 0.74028847 +/- 0.01663657; all eight sample ratios were positive.

Classical baselines

Method Wall time Status
Tracker-linked Heisenberg BP-TN at bond dimension 16 365.14 s not converged; apparent ratio is not a valid physical estimate
Tracker-linked Heisenberg BP-TN delta half at bond dimension 32 342.42 s not converged; value shifted by 86 percent from bond dimension 16
Tracker-linked Heisenberg BP-TN delta half at bond dimension 64 901.01 s timeout before producing a result

Official sources

  • Quantum Advantage Tracker observable-estimation register
  • Released Operator Loschmidt Echo circuits

Complete implementation

  • Edukaizen project
  • GitHub implementation
  • Detailed article

Claim boundary

  • The classical calculation did not converge and no matched-accuracy ratio was obtained.
  • This is a tracker-compatible 80-qubit extension with N_init=8, not an official tracker instance or an N_init=500 reproduction.
  • The observation is local and does not cover every classical implementation or optimized compute platform.

Entry 4 · Diagnostic only

Random Graph Sampling on 70 data qubits

A complete 70-data-qubit non-Clifford circuit was sampled on IBM hardware, alongside an independent 70+8-qubit stabilizer-verification workflow and local classical scaling studies.

Scale70 qubits
BackendIBM Kingston through Q-CTRL Fire Opal and IBM Runtime
Primary timing19 s
TaskSample the complete random-graph circuit and estimate the graph-state prefix with predeclared stabilizers

Measured comparison. Hardware returned 256 samples in 19 quantum-seconds, while a local Aer fit projects about 6.89 million years for one 70-qubit sample; sample counts and output quality are not matched.

Quantum result. The complete circuit returned 256 samples. The separate checked dataset retained 4,519 of 184,320 shots and gave a graph-state-prefix point estimate of 0.01217; its predeclared one-sided 95 percent lower-bound test failed. The original restricted-access IBM Boston execution reported substantially stronger effective performance than this independently accessible Kingston reproduction.

Classical baselines

Method Wall time Status
Local Qiskit Aer extended-stabilizer fit evaluated at 70 qubits 217,512,854,796,362.625 s extrapolated; not measured at 70 qubits and not quality matched
Local ITensorMPS at maximum bond dimension 64 205.36 s completed but strongly truncated and not converged
Local exact MPS anchor at 14 induced qubits 3.23 s exact small-width validation; not a 70-qubit baseline

Official sources

  • Quantum Advantage Tracker issue 151
  • Released Random Graph Sampling circuits

Complete implementation

  • Edukaizen project
  • GitHub implementation
  • Detailed article

Claim boundary

  • The Tracker result used restricted access to IBM Boston, whereas this independent reproduction used the available IBM Kingston route; backend access, physical mapping, and calibration window are therefore not matched.
  • Boston produced a substantially stronger workload-level result, but its historical calibration and complete raw fidelity-analysis record are not public, so the result does not establish that Boston was universally better hardware than Kingston.
  • The 70-qubit classical runtime is extrapolated from measurements ending at 12 qubits, not measured at full width.
  • The quantum samples have no validated full-distribution fidelity, and the separate predeclared 95 percent stabilizer test failed.
  • The post-hoc 75 percent lower bound is an exploratory sensitivity result, not 75 percent fidelity and not evidence of quantum advantage.

Entry 5 · Local runtime lower bound

QOS-inspired PBMC68k feature generation on 60 qubits

A frozen 60-qubit QOS-inspired feature map generated 627 measured features for real PBMC68k cells on IBM Fez, reached the strongest held-out point score, and completed far sooner than the bounded local MPS attempt for the same specified feature target.

Scale60 qubits
BackendIBM Fez through Q-CTRL Fire Opal
Primary timing26 s
TaskGenerate 627 ordered X, Y, and Z Pauli features for each of 64 fixed PBMC68k cells

Measured comparison. Hardware generated the complete 60-qubit feature result in 26 quantum-seconds while local MPS remained incomplete after 2,577 seconds: a kernel-time lower bound greater than 99.1x; the complete Fire Opal route retained a lower bound greater than 5.0x.

Quantum result. Held-out balanced accuracy was 0.53125 (17/32), compared with 0.50000 (16/32) for the predeclared linear baseline and 0.43750 (14/32) for RBF. The exact McNemar p-value against linear was 1.0 and the paired-bootstrap 95 percent interval was -0.1875 to 0.25.

Classical baselines

Method Wall time Status
Local MPS convergence ladder for the same 60-qubit circuit and 627-feature target 2,577 s stopped without a converged feature result
Training-only-selected linear SVC on classically prepared gene data not available completed; 0.50000 balanced accuracy (16/32)
Training-only-selected RBF SVC on classically prepared gene data not available completed; 0.43750 balanced accuracy (14/32)

Official sources

  • Exponential quantum advantage in processing massive classical data
  • Official Quantum Oracle Sketching repository
  • 10x Genomics PBMC68k dataset

Complete implementation

  • Edukaizen project
  • GitHub implementation
  • Detailed article
  • Detailed article

Claim boundary

  • The MPS route did not converge, so the same feature target was specified but numerical feature equality at a matched error tolerance was not established.
  • The 26 quantum-seconds value was read from the Fire Opal dashboard; the archived get_result payload omitted the quantum-seconds field.
  • The greater-than-99.1x ratio compares QPU-only dashboard time with local MPS wall time; the broader submission-to-retrieval comparison is a lower bound greater than 5.02x.
  • The inexpensive classical linear and RBF classifiers do not require simulation of the 60-qubit feature map, so this is not an end-to-end speedup over ordinary classical machine learning.
  • The held-out test contains only 32 cells; the one-cell hardware lead is not statistically significant and does not establish general predictive advantage.
  • This is a local result under declared hardware and classical resources, not a claim against every tensor-network method, compute platform, or future implementation.

What this list does not claim

A stronger classical implementation is a successful challenge, not a problem. Every result is conditional on its stated observable or task, accuracy or convergence status, timing scope, and available resources. The list does not certify formal complexity-theoretic advantage.

GitHub Pages evidence register · Source and machine-readable entries

Version 1.2, evidence updated through 2026-07-21.

Recent Posts

  • Quantum computing-nieuws — 31 juli 2026
  • Fermi-Hubbard op een quantumcomputer, deel 10: kan een quantumcomputer een quantumlab vervangen?
  • Fermi-Hubbard on a quantum computer, part 10: can a quantum computer replace a quantum lab?
  • Black Hole OLE, part 8: QGSS26 and protocol compatibility
  • Black Hole OLE, part 7: a local toy model with theory and user guide

Recent Comments

No comments to show.

Archives

  • July 2026
  • May 2026
  • March 2026
  • February 2026
  • September 2024

Categories

  • 10
  • Quantum Computing
  • Uncategorized
©2026 Edukaizen | Theme by SuperbThemes