Repeatable quantum-hardware execution of a fast local-topology surrogate for hyperthermal sarcomeric oscillations

This study demonstrates the repeatable execution on real quantum hardware (IBM Pittsburgh) of a minimal four-qubit surrogate model for fast local-topology hyperthermal sarcomeric oscillations, achieving strong agreement between experimental results and exact simulations for key biologically interpretable observables.

The Gist

The Big Picture: A Tiny Digital Twin on a Quantum Computer

Imagine you have a heart cell. Inside that cell, there are tiny engines called sarcomeres that contract and relax to make your heart beat. Usually, scientists look at the whole cell to see if it's beating well. But this paper asks a different question: What if we zoom in on just five of these tiny engines working together?

The researchers discovered that when these engines get a little "warm" (hyperthermal), they start doing a weird, fast dance. Sometimes they move in perfect sync, and sometimes they move in opposition (one pushes while the other pulls). This is called Hyperthermal Sarcomeric Oscillation (HSO).

The goal of this paper wasn't to build a whole new heart on a computer. Instead, the team asked: "Can we take the rules of this tiny, fast dance and run them on a real quantum computer, and will the computer get the steps right?"

The Analogy: The "Five-Dancer" Line

Think of the five sarcomeres as five dancers in a line holding hands.

• The Problem: Watching five dancers move is complicated. There are too many variables.
• The Shortcut: The researchers realized they didn't need to track every dancer's foot. They only needed to track the relationship between neighbors.
  • Are Dancer 1 and Dancer 2 moving together? (Yes/No)
  • Are Dancer 2 and Dancer 3 moving together? (Yes/No)
  • And so on.

This reduced the complex dance down to just four simple "Yes/No" questions. In computer terms, this is like a 4-digit binary code (like 1011). This creates a tiny "universe" of only 16 possible dance patterns.

The Experiment: The Quantum "Rehearsal"

Now, the team wanted to see if a quantum computer (a very powerful, but currently noisy and fragile machine) could simulate this dance.

1. The Encoding: They turned those four "Yes/No" questions into four qubits (the basic units of quantum computers). Think of qubits as super-advanced coins that can be heads, tails, or a spinning mix of both.
2. The Script: They wrote a very short, fixed "script" (a quantum circuit) that told the qubits how to interact, mimicking the way the real sarcomeres influence each other. It's like a choreographer giving a strict set of instructions: "If you are holding hands with your neighbor, spin this way."
3. The Hardware: They ran this script on a real quantum computer at IBM (located in Pittsburgh). They didn't try to fix the machine or tune it perfectly; they just ran the same script three times to see if it was repeatable.

The Results: Did the Quantum Computer Get the Steps?

The team compared the quantum computer's performance against a "perfect" mathematical simulation (the exact reference).

• The Verdict: The quantum computer did an amazing job. Even though quantum computers are currently "noisy" (like a radio with static), the results were incredibly close to the perfect math.
• The Metrics: They checked specific things, like:
  • Staying Power: Did the dancers keep their pattern? (The computer said yes, about 85% of the time).
  • Anti-Phase Dancing: Did the dancers often move in opposition? (The computer matched the real biology almost perfectly here).
  • Edge vs. Center: Did the "mistakes" in the dance happen at the ends of the line or in the middle? (The computer got this right too).

The Key Takeaway: The quantum computer didn't just spit out random numbers. It preserved the structure of the biological dance. If the biology said "Dancers A and B should be out of sync," the quantum computer agreed.

Why Does This Matter? (The "So What?")

You might ask, "Why bother with a quantum computer for just four qubits? A normal laptop could do this easily."

Here is the value of this paper:

1. It's a Bridge: This paper proves that we can take a specific, real-world biological problem (how heart cells coordinate locally) and translate it into a language a quantum computer understands, without losing the meaning.
2. It's Not About Speed Yet: They aren't claiming this is faster than a laptop. They are claiming it is possible to run biology on quantum hardware in a way that makes sense.
3. The Future: Think of this as building a small, sturdy bridge across a river. Right now, the bridge is narrow (only 4 qubits). But once we know the bridge holds, we can start building bigger ones to simulate whole hearts, diseases, or drug effects on quantum computers in the future.

Summary in One Sentence

The researchers successfully took a tiny, complex dance pattern of heart cells, translated it into a simple 4-step code, and proved that a real quantum computer can execute that code repeatedly and accurately, preserving the biological "rhythm" of the original system.

Technical Summary

1. Problem Statement

Cardiac contractility is a multiscale phenomenon where local sarcomere heterogeneity plays a critical role. Recent studies on Hyperthermal Sarcomeric Oscillations (HSOs)—oscillatory states in warmed cardiomyocytes—revealed that the complex dynamics of five consecutive sarcomeres can be reduced to a constrained 16-state local topology. This topology is defined by four neighboring-pair relations (in-phase vs. anti-phase) and exhibits specific statistical properties, such as dominant Hamming-1 transitions (single-link changes) and enriched anti-phase-rich occupancy.

While the biological model exists, there is a lack of an executable hardware bridge to test these mesoscale physiological states on real quantum devices. Most quantum biology applications focus on molecular sequences or drug discovery, leaving a gap in executing experimentally anchored cell-physiology state spaces. The core question addressed is: Can this fast local-topology model be translated into a minimal, repeatable quantum-executable surrogate that retains biological interpretability on real, noisy quantum hardware?

2. Methodology

A. Biological-to-Quantum Mapping

• Input Reduction: A segment of five consecutive sarcomeres is reduced to four binary variables representing the relations between adjacent pairs: $(1-2), (2-3), (3-4), (4-5)$.
  • $1$ = In-phase relation.
  • $0$ = Anti-phase relation.
• State Space: This creates a 4-bit string ($s_1, s_2, s_3, s_4$), resulting in a 16-state local topology.
• Qubit Encoding: Each 4-bit state is mapped directly to a computational basis state $|s\rangle$ on a four-qubit linear chain.
• Reconstruction: From the 4-bit state, a five-site sign pattern is reconstructed (up to global inversion) to calculate coarse observables like "Stopo" (synchrony proxy).

B. Quantum Circuit Design

• Hardware: Experiments were conducted on IBM's ibm_pittsburgh backend using physical qubits [154, 153, 152, 151].
• Evolution Kernel: The system evolves under a locked static Hamiltonian representing nearest-neighbor interactions. The Hamiltonian includes:
  • Transverse field terms ($\sum X_i$).
  • Nearest-neighbor Ising coupling ($\sum Z_i Z_{i+1}$).
  • Alternating on-site $Z$ terms.
• Circuit Structure: A two-step Trotterization (product-formula evolution) was used. The circuit depth was approximately 55, with 12 two-qubit CZ gates.
• Readout: The IBM EstimatorV2 primitive was used to estimate diagonal observables. The study utilized a "locked" parameter set (frozen before final runs) to test repeatability rather than optimization.

C. Observable Pack

The study defined a specific set of biologically interpretable observables:

1. Weighted Stay: Probability the next state is identical to the initial topology (persistence).
2. Single-link Fraction: Fraction of transitions that are Hamming-1 (minimal reconfiguration).
3. Anti-phase-rich Occupancy: Probability of having $\ge 3$ anti-phase pairs.
4. Transition Edge Proxy: Tendency of mismatch pockets to lie near chain edges vs. the center.
5. Stopo: A gauge-fixed synchrony proxy ($|\sum p_k|/5$) measuring segment-mean survival.

3. Key Contributions

1. First Real-Hardware Execution of a Local Physiological Topology: Demonstrates that a biologically defined mesoscale state space (HSO local coordination) can be mapped, evolved, and read out on real quantum hardware.
2. Repeatable Workflow: Establishes a fixed "execution grammar" (circuit layout, coupling graph, and readout) constrained by biological meaning rather than generic benchmark suites.
3. Interpretability Preservation: Proves that the quantum execution preserves the specific distinctions between local coordination patterns (e.g., anti-phase density, edge mismatches) that are physiologically meaningful.
4. Methodological Distinction: Clarifies that the goal is not "Quantum Advantage" (solving a problem faster than classical computers) but Structural Fidelity (proving a biological model can survive real-hardware noise while retaining its statewise structure).

4. Results

A. Repeatability and Stability

The locked control lane was executed three times on the same hardware layout. The results showed high stability:

• Weighted Stay: $0.8506 \pm 0.0041$ (CV: 0.48%)
• Single-link Fraction: $0.9075 \pm 0.0094$ (CV: 1.04%)
• Anti-phase-rich Occupancy: $0.4519 \pm 0.0022$ (CV: 0.49%)
• Transition Edge Proxy: $0.5390 \pm 0.0052$ (CV: 0.97%)
• Stopo: $0.2946 \pm 0.0008$ (CV: 0.29%)

B. Agreement with Exact Surrogate

The hardware means were compared against the exact classical simulation of the locked surrogate:

• Anti-phase-rich Occupancy: Hardware ($0.4519$) vs. Exact ($0.4513$) — nearly identical.
• Stopo: Hardware ($0.2946$) vs. Exact ($0.2935$) — nearly identical.
• Statewise Correlation: Across all 16 initial states, the Pearson correlation between exact and hardware means was extremely strong:
  • Anti-phase-rich occupancy: $r = 1.000$
  • Stopo: $r = 1.000$
  • Single-link fraction: $r = 0.958$
  • Weighted stay: $r = 0.945$
  • Transition edge proxy: $r = 0.941$

C. Analysis of Discrepancies

• Hardware Bias: The hardware showed a slight bias toward extra transitions (lower "stay," higher "Hamming-1" mass) compared to the exact reference, consistent with noise-induced errors.
• Modelling Headroom: The gap between the exact surrogate and the biological target (e.g., biological anti-phase target was 0.509 vs. exact 0.4513) was identified as a limitation of the static model, not the hardware. The hardware faithfully executed the static model; the model itself does not yet capture the full biological complexity.

5. Significance

• Physiological Value: The study validates that local sarcomere coordination patterns (persistence, minimal reconfiguration, anti-phase density) are robust enough to be simulated on noisy intermediate-scale quantum (NISQ) devices. It confirms that these patterns are not just theoretical constructs but can be physically executed.
• Methodological Value: It provides a blueprint for "domain-grounded" quantum biology. Instead of forcing biological problems into generic quantum algorithms, this work adapts the quantum workflow (nearest-neighbor topology, fixed kernel) to the specific structure of the biological problem.
• Future Directions: The paper establishes a stable execution grammar. Future work can build upon this by enriching the model (e.g., adding time-dependent conditioning or heterogeneity) rather than trying to "fix" the hardware. It shifts the focus from "can quantum computers solve biology?" to "how do we execute specific biological state spaces on quantum hardware?"

In conclusion, the paper successfully demonstrates a repeatable, interpretable bridge between a specific biological mesoscale model and real quantum hardware, proving that local physiological topology can survive the noise of current quantum devices without losing its structural integrity.