Edukaizen

Menu
  • News
  • Hubbard
    • 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: Reading heatmaps
      • Part 9: Digital vs cold-atom labs
      • Part 10: Official Monoprop benchmark
    • 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
    • 2D Local Quantum Advantage
      • Deel 1: Doel en budget
      • Deel 2: Fermionmodel
      • Deel 3: Mapping en diepte
      • Deel 4: Pilots en shots
      • Deel 5: Foutmitigatie
      • Deel 6: 6×6-resultaten
      • Deel 7: Circa 20x
      • Deel 8: Google en Bonsai
      • Deel 9: Volgende stap
  • Hadron
    • Part 1: Hadron on a quantum processor
    • Part 2: Quarks and confinement
    • Part 3: SU(2) and LSH
    • Part 4: Hamiltonian and circuit
    • Part 5: Fire Opal
    • Part 6: Classical simulations
    • Part 7: Quantum advantage
  • 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
    • Tutorial: UMI counts to a four-qubit circuit
    • Part 1: The QML task
    • Part 2: QOS theory
    • Part 3: Gene expression to 40 qubits
    • Part 4: JAX to hardware
    • Part 5: Readout and classifier
    • Part 6: 40-qubit result
    • Part 7: Route to quantum advantage
    • Part 8: 60-qubit result
  • Floquet-Ising
    • Part 1: Floquet physics
    • Part 2: Ising cycle
    • Part 3: Two-qubit toy model
    • Part 4: Oscillation and entanglement
    • Part 5: Noise and error mitigation
    • Part 6: Toward 51 qubits
  • Work
    • Quantum Gold
      • Part 1: Why gold is a relativistic quantum problem
      • Part 2: Why the 2025 gold VQE study stalled
      • Part 3: From QE and spin–orbit coupling to Qiskit
      • Part 4: Twelve gold spinor modes on four qubits
      • Part 5: The 24-qubit route: an active window for transport
      • Part 6: 24 qubits on IBM and with Fire Opal
      • Part 7: The road to quantum advantage for gold
      • Part 8: 24 gold spinor modes on IBM with ZNE-PEA
      • Part 9: Forced gold colour on 56 qubits
    • HaPPY Gravity
      • Part 1: Gravity as a phase gate
      • Part 2: Bosons and convergence
      • Part 3: The dynamic HaPPY benchmark
      • Part 4: The N=145 classical audit
      • Part 5: MPS and Majorana baselines
      • Part 6: PEA/ZNE and the decisive test
    • Fibonacci Anyons
      • Part 1: Fusion and braiding
      • Part 2: The 3/5/9-qubit ladder
      • Part 3: Why nine qubits were too deep
      • Part 4: Structure-aware simplification
      • Part 5: IBM hardware diagnostic
      • Part 6: Results and open questions
  • Advantage List
Menu

Part 9: From a fast run to a reliable answer

NederlandsEnglish
2D Local Quantum Advantage | Previous

The next step is not automatically a larger lattice. Our project already has an interesting local timing ratio and a complete 6×6 implementation. The main open question is how much reliable U=8 information the quantum measurement genuinely adds after mitigation.

Test the estimator first

We choose in advance which observables to estimate and what differences we will accept. Charge, spin and doublons each receive their own tolerance. Otherwise, averaging across all types of observable could hide a poor spin estimate behind an easier charge check.

We then test the mitigation on settings whose answers we know, but which were not used for training. Our latest U=0 holdouts show that more work is needed. If the method does not generalise well even there, an attractive U=8 target value is insufficient evidence.

The control without target hardware input remains important. When an estimator gives approximately the same answer without using the interacting hardware data, that answer does not convincingly measure the intended quantum dynamics. We specifically want to demonstrate that those data contribute useful, testable information.

Two refinement ladders, not one

On the classical side, we refine the bond dimension. On the quantum and circuit side, we must distinguish noise, repetitions and time-step error. More chi does not repair the wrong circuit; more shots do not repair an incorrect fermion mapping; better readout does not fix every gate error.

A useful design holds T fixed, compares several time-step sizes and always uses the correct reference for the selected finite circuit. Only then can the deviation from continuous Hamiltonian dynamics be assessed. Under a cost limit, it is better to test one clear question than to change many factors at once.

A stronger timing test

The approximately 20x ratio in this series uses registered QPU time and the existing local classical kernel time. A stronger test also records preparation, training, calibration, waiting and analysis. We explicitly state whether a calibration is performed once or reused across several calculations.

The finish line is then not ‘the job is complete’, but ‘the requested observables meet the agreed error tolerance’. This allows a genuine time-to-acceptable-answer comparison against our local computer. That remains a limited, achievable goal; it does not require beating every classical computer in the world.

A record that others can inspect

The separate Nighthawk repository preserves code, theory, raw measurements, calibrations, references, checksums and the results of less successful approaches. Large files are compressed losslessly and have a restoration manifest. The original project directory remains in place.

This series is therefore not a final declaration, but a well-documented intermediate result. We can be proud of what has been achieved within a limited budget while remaining precise about what has not yet been proved. The next hardware job will be submitted only after fresh, explicit budget approval.

Sources: theory/RESULTS_AND_CLAIMS.md, HARDWARE_COMPACT_TFLO_PROTOCOL.md, the holdout tables and the saved chi32/chi64 checks in the project repository.

Recent Posts

  • Quantum computing-nieuws — 4 september 2026
  • Quantum computing-nieuws — 28 augustus 2026
  • Quantum computing-nieuws — 27 augustus 2026
  • Quantum computing-nieuws — 26 augustus 2026
  • Quantum computing-nieuws — 25 augustus 2026

Recent Comments

No comments to show.

Archives

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

Categories

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