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

News

Fermi-Hubbard op een quantumcomputer, deel 10: de officiële Monoprop-benchmark

Posted on August 1, 2026August 11, 2026 by admin

Officiële Monoprop 0.8.0 is getest op dezelfde gemiddelde dubbele bezetting van 60 sites als de quantum-, EduKaizen-Majorana- en MPS-routes. De lokale quantumuitvoeringsproxy is 7,06 keer sneller dan de strikte Monoprop-run.

Fermi-Hubbard on a quantum computer, part 10: the official Monoprop benchmark

Posted on August 1, 2026August 11, 2026 by admin

Official Monoprop 0.8.0 was tested on the same 60-site mean-double-occupancy observable as the quantum, EduKaizen Majorana, and MPS routes. The local quantum execution proxy is 7.06 times faster than the strict Monoprop run.

Quantum computing news — August 1, 2026

Posted on August 1, 2026August 13, 2026 by

Daily selection of quantum computing news for August 1, 2026.

Quantum computing news — July 31, 2026

Posted on July 31, 2026August 13, 2026 by

Latest quantum computing news Daily selection from Google News for July 31, 2026. Headlines link to the original publication. Quantum computers outperform classical ones, with results you can trust – Ars Technica…

Fermi-Hubbard op een quantumcomputer, deel 9: wanneer is een quantumcomputer een quantumlab?

Posted on July 27, 2026August 11, 2026 by admin

Cold atoms en gate-based processors kunnen dezelfde 1D Fermi-Hubbarddynamica onderzoeken, maar vervanging van een quantumlab vereist dezelfde Hamiltoniaan, begintoestand, quench, observabelen en validatie.

Fermi-Hubbard on a quantum computer, part 9: when is a quantum computer a quantum lab?

Posted on July 27, 2026August 11, 2026 by admin

Cold atoms and gate-based processors can probe the same 1D Fermi-Hubbard dynamics, but replacing a quantum lab requires matching the Hamiltonian, initial state, quench, observables, and validation.

Black Hole OLE, part 8: QGSS26 and protocol compatibility

Posted on July 25, 2026 by

Black Hole OLE series | Series page | Previous The Operator Loschmidt Echo (OLE) was one of the observable-estimation examples discussed by Minh Tran in Quantum Algorithms III at the Qiskit Global…

Black Hole OLE, part 7: a local toy model with theory and user guide

Posted on July 22, 2026July 25, 2026 by

Black Hole OLE series | Series page | Previous | Next The 80-qubit experiment is the main result of this series, but it is not the easiest place to learn what an…

Black Hole OLE, part 5: Hawking, black holes, and scrambling

Posted on July 11, 2026July 20, 2026 by admin

A reproducible Q80 Operator Loschmidt Echo study, from circuit construction and hardware execution to tensor-network limits and information scrambling.

Black Hole OLE, part 6: what the result proves and what comes next

Posted on July 11, 2026August 9, 2026 by admin

A reproducible Q80 Operator Loschmidt Echo study, from circuit construction and hardware execution to tensor-network limits and information scrambling.

  • Previous
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • Next

Recent Posts

  • Quantum computing-nieuws — 11 september 2026
  • Quantum computing-nieuws — 4 september 2026
  • Quantum computing-nieuws — 28 augustus 2026
  • Quantum computing-nieuws — 27 augustus 2026
  • Quantum computing-nieuws — 26 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