Curator's Take
This article settles a long‑standing question by showing that a transverse‑field Ising model driven by a globally varying field can emulate any gate‑model circuit with only polynomial overhead, establishing formal computational universality for a broad class of analog devices such as quantum annealers and Rydberg arrays. By linking the model to universal digital computation, it both validates existing hardware approaches as theoretically capable of full quantum advantage and provides a rigorous no‑go theorem against efficient classical simulation under standard complexity assumptions. Although the construction incurs large overheads that exceed current experimental limits, it opens a clear pathway for future algorithmic refinements that could bring analog Ising platforms closer to practical, universal quantum computing.
— Mark Eatherly
Summary
The transverse-field Ising model has attracted a lot of attention in recent years, especially in the quantum simulation and quantum computation literature. This interest is driven by many platforms for analog quantum computation, which implement the transverse-field Ising model for solving optimization problems, such as quantum annealing. However, it has remained an open question whether the Ising model with a global transverse field is equivalent to the gate model of quantum computation. Here we answer this question affirmatively for the case of a non-monotonic time-dependent transverse field. Building on a recent result by Cesa and Pichler on global control of Rydberg atoms, we provide a construction that allows simulating arbitrary quantum circuits using the Ising model with global transverse field with polynomial overhead in time, qubit number, and energy scale. Although the polynomial overheads we establish here are large relative to what is feasible on real-world quantum hardware, our result motivates the development of more sophisticated methods for simulating quantum circuits using the Ising model with a global transverse field. Additionally, under the assumption that quantum computing is strictly more powerful than classical computing, our result serves as a no-go theorem for efficient classical simulation of the transverse-field Ising model with a time-dependent global transverse field. Therefore, our finding is relevant for multiple communities, from analog quantum simulation and quantum optimization on various platforms to complexity and control theory.