Edukaizen

Menu
  • Nieuws
  • 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
    • Part 11: 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
  • 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
  • GOLD REL
    • 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
  • Advantage List
Menu

From quarks to quantum advantage

Hadron quantum simulation | Hub | Paper | Repository | Nederlands

How do you translate the dynamics of a hadron into a quantum circuit of 120 qubits? And when can you say that the quantum processor is faster than the classical simulation?

This seven-part series follows the entire calculation. We start with quarks, color fields and confinement. Then we build the SU(2) lattice model, the Loop-String-Hadron basis and the Trotter circuit. Finally, we compare the IBM hardware with tensor networks, Pauli propagation, and our local reproduction runs.

The central paper is Observation of Robust and Coherent Non-Abelian Hadron Dynamics on Noisy Quantum Processors. The authors simulate a 1+1-dimensional SU(2) lattice gauge theory on 60 lattice sites with 120 logical qubits. It is not a full simulation of SU(3)-QCD, but it is a large non-Abelian real-time experiment with dynamic matter.

The series

1. Making a hadron move on a quantum processor

What does the paper report, which confined meson dynamics becomes visible and why are different classical controls needed?

Read part 1

2. Quarks, color fields and confinement

What are color charge, flux strings and local Gauss laws, and what does confinement mean in this simplified SU(2) model?

Read part 2

3. The SU(2) lattice model and the LSH basis

How is the Kogut-Susskind Hamiltonian rewritten in local, gauge-invariant Loop-String-Hadron states?

Read part 3

4. From Hamiltonian to quantum circuit

How do two LSH bits per site create the Jordan-Wigner mapping, Trotter steps, phase gates, interaction blocks and SWAP layers?

Read part 4

5. The quantum simulation and Fire Opal

How are SCV and meson circuits implemented on IBM hardware and how are the counts converted to local density and global charge?

Read part 5

6. The classical simulation methods

What different questions do exact diagonalization, tensor networks, Pauli propagation, QASM-MPS and Majorana simulation answer?

Read part 6

7. The comparison: where is the quantum advantage?

What remains of the benefit claim when the same observable, accuracy, hardware time and end-to-end time are placed side by side?

Read part 7

The central evidence structure

The series covers three equations that should not be mixed up:

full LSH Hamiltonian versus ideal circuit -> check of model approximation and Trotterization

ideal circuit versus QPU -> checking of hardware and measurement errors

QPU time versus classical computation time -> performance comparison for a committed task

A well-preserved global charge is an important sector control, but not the entire hadron signal. A short hardware time is interesting, but not the same as a short end-to-end turnaround time. The series keeps those boundaries visible up to and including the final conclusion.

Sources and reproducibility

The articles are based on the paper, the public LSH circuits and data, the Quantum Advantage Tracker submission and a proprietary reproduction workbench with Fire Opal, Qiskit Aer, ITensor and small LSH Hamiltonian controls.

  • Paper on arXiv
  • Quantum Advantage Tracker issue #149
  • Hadron reproduction repository

Recent Posts

  • Quantum computing-nieuws — 9 augustus 2026
  • Quantum computing-nieuws — 8 augustus 2026
  • Quantum computing-nieuws — 7 augustus 2026
  • Quantum computing-nieuws — 6 augustus 2026
  • Quantum computing-nieuws — 5 augustus 2026

Recent Comments

No comments to show.

Archives

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

Categories

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