Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.13301

Precision quantum simulation of magnon spectra and interactions

Trond I. Andersen·Nikita Astrakhantsev·Jeronimo Martinez·Will Morong·Johannes Motruk·Dario Rossi·Brayden Ware·Bryce Kobrin·Weijie Wu·Elizabeth Bennewitz·Manuel Rudolph·Tom Westerhout·Amira Abbas·Rajeev Acharya·Laleh Aghababaie Beni·Ross Alcaraz·Sayra Alcaraz·Markus Ansmann·Frank Arute·Kunal Arya·Walt Askew·Juan Atalaya·Christopher Ayala·Ryan Babbush·Brian Ballard·Joseph Bardin·Hector Bates·Andreas Bengtsson·Majid Bigdeli Karimi·Alexander Bilmes·Simon Bilodeau·Felix Borjans·Alexandre Bourassa·Jenna Bovaird·Dylan Bowers·Leon Brill·Peter Brooks·Michael Broughton·David Browne·Brett Buchea·Bob Buckley·Tim Burger·Brian Burkett·Jamal Busnaina·Nicholas Bushnell·Jonas Bylander·Anthony Cabrera·Juan Campero·Hung-Shen Chang·Silas Chen·Zijun Chen·Ben Chiaro·Liang-Ying Chih·Agnetta Cleland·Bryan Cochrane·Matt Cockrell·Josh Cogan·Paul Conner·Tom Connolly·Harold Cook·Rodrigo Cortinas·William Courtney·Alexander Crook·Benjamin Curtin·Adam Dally·Sayan Das·Martin Damyanov·Dripto Debroy·Himadri Dey·Stijn de Graaf·Laura De Lorenzo·Sean Demura·Lucia De Rose·Agustin Di Paolo·Leon Ding·Howard Dobbs·Paul Donohoe·Ebru Dogan·Ilya Drozdov·Andrew Dunsworth·Rasmus Edholm·Valerie Ehimhen·Alec Eickbusch·Aviv Elbag·Lior Ella·Mahmoud Elzouka·David Enriquez·Catherine Erickson·Lara Faoro·Vinicius Ferreira·Marcos Flores·Leslie Flores Burgos·Sam Fontes·Ebrahim Forati·Jeremiah Ford·Brooks Foxen·Masaya Fukami·Alan Fung·Lenny Fuste·Suhas Ganjam
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Here, we report on high-precision simulation of both linear and non-linear response functions in a 2D XY spin-1/2 magnet using an analog-digital superconducting processor of up to 97 qubits. By interleaving digital gates with analog evolution precisely characterized via Hamiltonian learning, we selectively excite magnons at tunable energy densities. Measuring first the linear magnon response -- a central probe in neutron-scattering experiments -- we extract temperature-dependent spectra and lifetimes. Our results reveal stark variations in magnon decay rates across the Brillouin zone, with enhancement near van Hove singularities and suppression for edge-localized modes. Next, we perform a suite of nonlinear measurements, including the study of self-scattering mechanisms, as well as pump-probe spectroscopy to directly characterize the magnon interactions. While matrix-product state simulations capture the dynamics well in either small systems or at low temperatures, their predictions become inaccurate away from these limits. This work demonstrates precise simulation of the interacting dynamics in quantum magnets, and provides key insights into quasi-particles and their microscopic scattering mechanisms.

Explore related subjects

quant-phcond-mat.mes-hallcond-mat.mtrl-sci

Keep this discovery

BibTeXRIS

Trond I. Andersen, Nikita Astrakhantsev, Jeronimo Martinez, Will Morong, Johannes Motruk, Dario Rossi, Brayden Ware, Bryce Kobrin, Weijie Wu, Elizabeth Bennewitz, Manuel Rudolph, Tom Westerhout, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Juan Atalaya, Christopher Ayala, Ryan Babbush, Brian Ballard, Joseph Bardin, Hector Bates, Andreas Bengtsson, Majid Bigdeli Karimi, Alexander Bilmes, Simon Bilodeau, Felix Borjans, Alexandre Bourassa, Jenna Bovaird, Dylan Bowers, Leon Brill, Peter Brooks, Michael Broughton, David Browne, Brett Buchea, Bob Buckley, Tim Burger, Brian Burkett, Jamal Busnaina, Nicholas Bushnell, Jonas Bylander, Anthony Cabrera, Juan Campero, Hung-Shen Chang, Silas Chen, Zijun Chen, Ben Chiaro, Liang-Ying Chih, Agnetta Cleland, Bryan Cochrane, Matt Cockrell, Josh Cogan, Paul Conner, Tom Connolly, Harold Cook, Rodrigo Cortinas, William Courtney, Alexander Crook, Benjamin Curtin, Adam Dally, Sayan Das, Martin Damyanov, Dripto Debroy, Himadri Dey, Stijn de Graaf, Laura De Lorenzo, Sean Demura, Lucia De Rose, Agustin Di Paolo, Leon Ding, Howard Dobbs, Paul Donohoe, Ebru Dogan, Ilya Drozdov, Andrew Dunsworth, Rasmus Edholm, Valerie Ehimhen, Alec Eickbusch, Aviv Elbag, Lior Ella, Mahmoud Elzouka, David Enriquez, Catherine Erickson, Lara Faoro, Vinicius Ferreira, Marcos Flores, Leslie Flores Burgos, Sam Fontes, Ebrahim Forati, Jeremiah Ford, Brooks Foxen, Masaya Fukami, Alan Fung, Lenny Fuste, Suhas Ganjam. 2026-07-14. Precision quantum simulation of magnon spectra and interactions. https://arxiv.org/abs/2607.13301

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗