⚛️ quantum physics

Benchmarking quantum simulation with neutron-scattering experiments

This paper demonstrates that a 50-qubit superconducting quantum processor, utilizing a quantum-classical workflow to compute dynamical structure factors, can produce quantitatively reliable simulations of quantum materials like KCuF $_3$ that directly benchmark against inelastic neutron-scattering experiments, thereby establishing a framework for testing quantum simulations of strongly correlated systems in regimes that are classically challenging.

Original authors: Yi-Ting Lee, Keerthi Kumaran, Bibek Pokharel, Allen Scheie, Colin L. Sarkis, David A. Tennant, Travis Humble, André Schleife, Abhinav Kandala, Arnab Banerjee

Published 2026-03-17

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Yi-Ting Lee, Keerthi Kumaran, Bibek Pokharel, Allen Scheie, Colin L. Sarkis, David A. Tennant, Travis Humble, André Schleife, Abhinav Kandala, Arnab Banerjee

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to predict the weather in a city so complex that the wind, rain, and temperature interact in ways no supercomputer on Earth can fully calculate. Now, imagine you have a new, experimental tool—a "quantum weather station"—that claims it can do the job. But how do you know if this new tool is actually working, or if it's just guessing?

This paper is about putting that new tool to the test. The researchers built a quantum computer simulation to predict how tiny magnetic particles (spins) behave inside a specific crystal called KCuF3. To check if their simulation was right, they compared it directly to real-world experiments using a giant machine that shoots neutrons at the crystal.

Here is the breakdown of what they did, using some everyday analogies:

1. The Problem: The "Too Hard" Puzzle

In the world of quantum physics, materials like KCuF3 are like a massive, chaotic dance floor. Every dancer (electron spin) is holding hands with their neighbors, and they are all moving in a way that depends on everyone else.

Classical Computers: Traditional supercomputers are like trying to track every single dancer by hand. As the number of dancers grows, the math becomes impossible. The computer runs out of memory or time, much like a person trying to count grains of sand on a beach while the tide is coming in.
The Goal: The researchers wanted to see if a quantum computer (which speaks the same "language" as the dancers) could solve this puzzle faster and more accurately than the old computers.

2. The Experiment: The "Neutron Flashlight"

To see what the dancers are doing in real life, scientists use Inelastic Neutron Scattering (INS).

The Analogy: Imagine the crystal is a dark room full of dancers. You can't see them, so you throw a handful of glowing marbles (neutrons) into the room.
The Result: When the marbles hit the dancers, they bounce off, changing speed and direction. By catching the marbles as they fly out, you can reconstruct exactly how the dancers were moving, how fast they were going, and how they were interacting. This creates a "map" of the energy and movement, called the Dynamical Structure Factor (DSF).

3. The Quantum Simulation: The "Digital Twin"

The researchers used a 50-qubit quantum processor (a super-advanced calculator using the laws of quantum mechanics) to create a "digital twin" of the crystal.

The Process: They programmed the quantum computer to mimic the crystal's rules. They let the digital dancers move and interact, then measured the digital marbles bouncing off them.
The Challenge: Quantum computers are currently "noisy." It's like trying to record a symphony in a room where the walls are shaking and people are shouting. The signal gets fuzzy. The researchers had to figure out if their fuzzy digital recording was still accurate enough to be useful.

4. The Big Reveal: A Perfect Match

The team compared their Quantum Simulation (the digital twin) against the Real Neutron Experiment (the glowing marbles).

The Result: They matched! The quantum computer successfully reproduced the complex, fuzzy patterns of the real crystal, including a phenomenon called "spin fractionalization."
The Analogy: Imagine a single dancer (a spin) breaking apart into two smaller, ghost-like dancers (spinons) that run off in different directions. This is a very weird quantum effect. The quantum computer didn't just guess; it correctly predicted that the dancers would split up and how they would move, matching the real-world data almost perfectly.

5. Why This Matters: Crossing the Finish Line

This paper is a milestone for three main reasons:

It Works: It proves that current quantum computers (even with their "noise") are powerful enough to simulate real materials better than classical computers can in certain situations.
It's a New Tool: They developed a set of "rulers" (metrics) to measure how good the simulation is, not just by looking at the pictures, but by checking deep physics properties like "entanglement" (how tightly the dancers are holding hands).
The Future: They showed that this method works even for more complex, messy materials (like the CsCoX3 compounds) where classical computers give up.

In a nutshell:
Think of this as the moment a new, experimental GPS was tested against a physical map. The GPS had some static and glitches, but it still guided the driver to the exact same destination as the physical map. This proves the GPS is ready for the road, opening the door to simulating materials that were previously impossible to understand, potentially leading to new superconductors, better batteries, or revolutionary electronics.

1. Problem Statement

The primary challenge in quantum computing for materials science is establishing a quantitative link between pre-fault-tolerant quantum simulations and real-world experimental outcomes. While quantum processors have improved in scale and fidelity, it remains unclear if current devices can perform quantitatively reliable simulations of complex quantum materials within their limited "gate budgets" (circuit depth and error rates).

Specifically, simulating Inelastic Neutron Scattering (INS) spectra is difficult because:

INS probes the Dynamical Structure Factor (DSF), which requires computing real-time evolution of two-point correlation functions.
Classical methods (like exact diagonalization or tensor networks) fail for strongly entangled systems or long-time evolutions due to exponential scaling.
There is a lack of rigorous benchmarks to determine if quantum hardware can faithfully reproduce experimental data for materials where classical high-performance computing (HPC) breaks down.

2. Methodology

The authors developed a quantum-classical workflow to compute DSFs and benchmark them against experimental INS data and classical Matrix Product State (MPS) simulations.

A. Physical Models & Materials

KCuF $_3$ (Potassium Copper Fluoride):
- A canonical quasi-1D antiferromagnet modeled by the isotropic XXZ Heisenberg Hamiltonian ( $\epsilon = 1$ ).
- Known to exhibit a gapless Luttinger liquid ground state with fractionalized spinon excitations.
- Serves as the primary benchmark because its physics is analytically solvable (Bethe Ansatz) and experimentally well-characterized.
CsCoX $_3$ (Cobalt-based compounds):
- Modeled by a non-integrable XXZ Hamiltonian with ferromagnetic next-nearest-neighbor (NNN) interactions.
- Represents a regime with strong anisotropy and gapped excitations, challenging for classical simulation.

B. Quantum Simulation Workflow

Ground State Preparation: Used a Variational Quantum Eigensolver (VQE) with a Hamiltonian Variational Ansatz.
- For KCuF $_3$ : Started from a singlet product state.
- For CsCoX $_3$ : Started from a Néel state (due to strong Ising-like anisotropy).
Time Evolution:
- Implemented using Trotterization (2nd order for nearest-neighbor, 1st order with SWAP networks for NNN interactions).
- Employed Approximate Quantum Compilation (AQC) based on tensor networks to compress circuit depth for long-time evolutions, reducing two-qubit gate counts while maintaining >89% fidelity.
Measurement:
- Computed Retarded Green's Functions (RGF) via local unitary perturbations on a central site (center-site approximation).
- Performed Fourier transforms to obtain the DSF in momentum ( $q$ ) and frequency ( $\omega$ ) space.
Hardware: Experiments were run on IBM's Heron processors (specifically ibm_boston and ibm_kingston), utilizing up to 50 qubits.
- Applied error mitigation techniques: Dynamical Decoupling (XY4), Pauli Twirling, and Twirled Readout Error Extinction (TREX).

C. Benchmarking Metrics

To quantitatively compare Quantum, MPS, and Experimental results, the authors used:

Image-based metrics: Mean Squared Error (MSE), Wasserstein Distance, and Structural Similarity Index (SSIM).
Physics-informed metrics:
- Spectral Weight Distribution: Percentage of weight in the main dispersion.
- Peak Positions & Linewidths: Accuracy of excitation energies.
- Entanglement Witnesses: Normalized Quantum Fisher Information (nQFI) for multipartite entanglement and Two-tangle ( $\tau_2$ ) for pairwise entanglement.

3. Key Contributions

First Quantitative Benchmark: Established a framework for benchmarking quantum simulations of DSFs directly against laboratory INS measurements, moving beyond qualitative comparisons.
Validation of Pre-Fault-Tolerant Hardware: Demonstrated that 50-qubit devices can reproduce the complex, gapless spinon continuum of KCuF $_3$ with high fidelity, capturing emergent quantum phenomena like "quantum wakes" and superdiffusive transport.
Extension to Non-Integrable Systems: Successfully simulated a non-integrable XXZ model with NNN interactions (relevant to CsCoX $_3$ ), showing that quantum processors can handle Hamiltonians that are analytically intractable and classically challenging.
Error Analysis Framework: Systematically analyzed the impact of qubit count (finite-size effects), Trotter steps (finite-time effects), and gate errors on spectral accuracy, identifying specific error thresholds required for reliable simulation.

4. Key Results

KCuF $_3$ Simulation:
- The quantum simulation on ibm_boston (lower error rates) produced a DSF that closely matched the experimental INS spectrum and MPS results.
- Metrics: The quantum results showed comparable SSIM and MSE to MPS. The spectral weight of the main dispersion was ~50% (close to the experimental value), whereas MPS slightly overestimated it (58.9%).
- Entanglement: Both quantum and MPS simulations correctly identified at least four-partite entanglement (via nQFI), consistent with experimental observations.
- Noise Effects: The primary deviation was a broadening of spectral features at low frequencies due to circuit noise, which mimicked finite-temperature effects but was not intrinsic to the physics.
Hardware Scaling:
- Qubit Count: Systems with <30 qubits suffered from "pixelation" in momentum space. 50 qubits were sufficient to resolve the continuum.
- Time Steps: ~10 Trotter steps were sufficient for convergence in most metrics, though 20 steps were needed for accurate low-frequency entanglement measures.
- Error Rates: Reducing the two-qubit gate error rate from $7.5 \times 10^{-3}$ to $1 \times 10^{-3}$ (comparing ibm_kingston to ibm_boston) led to systematic improvements in SSIM and nQFI, confirming that current error rates are approaching the threshold for reliable material simulation.
CsCoX $_3$ (Non-Integrable):
- The quantum simulation successfully captured the transition from a two-soliton continuum (pure Ising limit) to a lower-band dispersion induced by NNN interactions.
- Peak positions were within 10% error relative to the Full Width at Half Maximum (FWHM) of the MPS spectrum.

5. Significance

Paradigm Shift: This work marks a transition where quantum computers are no longer just testbeds but are emerging as practical tools alongside classical tensor-network methods for studying quantum materials.
Bridging Theory and Experiment: It provides a direct, quantitative bridge between microscopic quantum simulations and macroscopic experimental observables (INS), validating the use of quantum processors for materials discovery.
Roadmap for Future Hardware: The study establishes that as gate errors drop below $10^{-3}$ and qubit counts scale, quantum simulations will become indispensable for regimes where classical HPC fails (e.g., 2D non-integrable models, long-time dynamics).
Methodological Framework: The combination of AQC, error mitigation, and physics-informed metrics (like nQFI) offers a reproducible blueprint for future quantum materials research.

In conclusion, the paper demonstrates that current noisy intermediate-scale quantum (NISQ) devices can already perform quantitatively accurate simulations of complex quantum materials, provided that appropriate error mitigation and benchmarking strategies are employed. This paves the way for using quantum computers to explore regimes of strong entanglement and long-range interactions that are currently inaccessible to classical supercomputers.