Edukaizen

Menu
  • News
  • 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
  • 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
    • 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

What the experiment establishes — and what remains open

Series home | Previous | Code and evidence | Minimal-circuit paper

The most useful conclusion is not a single yes or no. Different layers of the project have different evidential status. The algebra is exact, the full ideal circuit is validated, the full hardware route is not ready, and a much narrower logical observable has passed an initial real-device diagnostic.

Current bottom line: this is a rigorous digital-simulation and hardware-validation project. It is not a demonstration of physical anyons, topological protection, scalable computation, or quantum advantage.

Claim-by-claim evidence

Possible claim Evidence Verdict
The locked Fibonacci F/R data are coherent All enumerated unitarity, pentagon, hexagon, and braid-relation checks pass Established
The braid representation is non-Abelian \([B_1,B_2]\) is nonzero and a fixed measurement changes by \(1/\phi\) Established
The 3q, 5q, and corrected 9q ideal circuits match their targets Full complex-state fidelities exceed \(1-5\times10^{-14}\) Established
The full source-drawn 9q circuit is ready for current hardware Heavy-hex compilation and frozen noise gates fail Not established
One fixed-input logical observable works on IBM hardware Interleaved 256-shot diagnostic includes \(1/\phi^2\) in its corrected interval Established at diagnostic scale
Every source F-move ran in the hardware diagnostic Observable compression removed that requirement False
The qubits were physical Fibonacci anyons The device used ordinary superconducting qubits False
The encoding was topologically protected No passive topological protection is supplied by digital encoding False
Quantum advantage was demonstrated No classically hard scaled task or runtime separation was tested False

The immediate next experiment

The diagnostic authorizes a higher-shot repeat of the same interleaved, observable-compressed protocol. That run should preserve the frozen circuit hashes, native layout, control order, assignment correction, leakage definition, and drift tests. Its purpose would be to narrow the confidence interval and test repeatability across a longer execution, not to enlarge the claim.

The completed 256-shot job should remain visible even if the next run disagrees. A reproducible project records both confirming and disconfirming data rather than replacing an inconvenient snapshot.

Reopening the full nine-qubit question

The best source-equivalent order circuit still uses 161 CX gates at depth 285 in the all-to-all comparison, and substantially more after sparse-topology routing. To put the full source process on hardware, a new design must pass the same exact-state oracle and the unchanged raw interpretability gates. Possible research directions include a stronger relative-phase synthesis, native controlled-phase compilation, alternative lattice layouts, mid-circuit measurement with feedforward, or a different phase-sensitive observable that retains more of the source process.

Any such proposal must state whether it is:

  • equal to the source operation on the complete reachable support;
  • equal only on one fixed input;
  • or merely expected to reproduce one scalar observable.

Those are not interchangeable notions of validation.

A future scaling program is a hypothesis, not a result

One longer-term route would move from 25–30 qubit hardware validation, through a 49–64 qubit classical-crossover study, toward a 70–100 qubit Fibonacci string-net or chromatic-polynomial sampling candidate. Those ranges are planning hypotheses. They do not establish where a classical crossover actually lies, and qubit count alone cannot define advantage.

A credible future advantage claim would need all of the following:

  1. a precisely defined computational task and output distribution;
  2. the strongest available classical algorithms and hardware as baselines;
  3. an end-to-end resource comparison, including compilation, sampling, verification, and mitigation;
  4. a scaling trend across multiple system sizes rather than one isolated device point;
  5. a validation method that remains meaningful when exact statevector simulation is no longer possible;
  6. evidence that the quantum device reaches a quality or time regime unavailable to the classical baseline.

This project has not performed that program. The Nature Communications string-net work provides an important research direction by connecting Fibonacci condensate sampling to chromatic polynomials, but citing a classically hard target is not the same as demonstrating an end-to-end advantage on the circuits studied here.

What has genuinely been learned

Three lessons already survive the claim boundary. First, exact category algebra can be translated into a concrete measurement oracle with a golden-ratio contrast. Second, a small logical circuit can hide an enormous native-gate cost when generic multi-control synthesis ignores physical structure. Third, aggressive observable compression can turn an impossible hardware circuit into an interpretable diagnostic — provided the narrower meaning is stated plainly.

That is a solid result. It gives the next experiment a clear purpose and prevents a successful small-device measurement from being mistaken for a scalability result it does not contain.

Sources

  • Project repository and evidence trail
  • Minimal Quantum Circuits for Simulating Fibonacci Anyons
  • Realizing string-net condensation
Series home | Previous | Code and evidence | Minimal-circuit paper

Recent Posts

  • Quantum computing-nieuws — 14 augustus 2026
  • IBM Quantum queues surge past 264,000 pending jobs
  • Quantum computing news — August 13, 2026
  • Quantum computing news — August 12, 2026
  • Quantum computing news — August 11, 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