GREX CHAIN: a flock of quantum particles on a chain of 44 sites of a superconducting processor, with order and quantum coherence over long distances. A registered experiment
Khasseh, Wald, Moessner, Weber and Heyl (Phys. Rev. Lett. 135, 248302; arXiv:2308.01603) introduced active quantum flocks: quantum particles that move by themselves in a direction carried by an internal degree of freedom, align their directions, and reverse them with a coherent amplitude. In that work a flock is marked by order of the directions and by quantum coherence over long distances; the model is solved numerically for rings of up to 14 sites and proposed for Rydberg atoms. A literature search on the day of the run found predictions and proposals, and no experiment on a flock of quantum particles. This deposit holds a registered run of a digital flock on a public superconducting processor, with both marks measured over long distances. On the IBM Heron processor ibm_kingston, 14 particles, called birds, sit on a chain of 44 sites, which are every second qubit of a chain of 87 qubits; the qubits in between carry the birds across and take the answers of mid-circuit measurements. A bird flies by itself in a direction given by its site and the time, and turns round with a coherent amplitude sin(eta). Where two birds fly into each other, a measurement finds them and one of the two is carried out of the way (feed-forward), after which both fly the same way. A regulator decides which of the two: a coin qubit off the chain is read once per shot, and every exchange of the shot takes the side its bit names. The birds start with random directions and fly for 8 layers. 11 arms are run: the flock (sin^2 eta = 0.04), a twin in which the phases of the turns are scrambled by half turns about z, the pairwise rule alone, an arm without exchanges, an arm without turning, a melted arm (sin^2 eta = 0.5), the flock after 2, 4 and 6 layers, and a kick with the regulator on and off. A circuit of the flock holds 1,548 CZ gates, 173 measurements before the end and 336 conditional blocks. Nothing is done about errors: no dynamical decoupling, no twirling, no correction. Lines, thresholds, instances, chain and analysis were fixed and hashed before the session (registration SHA-256 1589b7090f40574edcd108eaba680d73c35c2065f439cad3da805d185df877b6). Results, as they fell: 60 circuits for 480 runs, 224,000 shots, 23 jobs, 117 s of QPU time. All 14 lines and the 3 attestation lines held. With the regulator the mean product of the directions of two birds 12 to 20 sites apart is +0.238 +- 0.009, against +0.009 +- 0.009 for the pairwise rule alone, which orders neighbours only; the product does not fall with the distance. The flock flies right in one half of the shots and left in the other, as its coin falls, and every bird follows the coin in three of four cases (0.747). Without turning the product is 0.374, and strong turning removes the order (-0.004). The flock carries quantum coherence across the chain: after one more check, turning every bird back against its last turn leaves more order than deepening the turn, and against the twin the difference, the mark of coherence, is +0.122 +- 0.009 over all distances and +0.058 +- 0.005 between birds 12 to 20 sites apart, 13 and 11 standard errors above zero and positive in all 32 instances. A bird is in a superposition of its two directions, with a phase that follows the direction of birds far away. What is claimed are the registered lines, for this chain. The common direction is set by the bit of the coin, which reaches every exchange through the classical control of the processor; it is not claimed to arise from interactions between neighbours. Also not claimed: long-range order in the sense of large systems or long times, entanglement between birds, and an advantage over a classical computer. The registration was written after two preliminary looks on the processor, which are part of the deposit; the first stayed incomplete because the control hardware refused one job for its size (error 6073). The deposit holds the registration, the module (instances, circuits, estimators, an exact model for short chains, an automaton with faults), the scripts for the looks and the session, for the registration with its simulated sessions and for the verdict, the logs of the looks and of the session with the calibration the processor reported, every answer of every check and every read bit of every shot, the verdict (formed once) and its ledger, the write-up (grexc_paper_v1.pdf) and the scripts and figures that build it. Licence: CC BY 4.0.
Authors
- Bernd Westrick
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24407457
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00