A recent study has demonstrated the polynomial equivalence between the global transverse-field Ising model and the gate model of quantum computation. This equivalence is established for the case of a non-monotonic time-dependent transverse field. The transverse-field Ising model is fundamental in analog quantum simulation and optimization, such as quantum annealing, but its relationship with gate-based quantum computing remained an open question until now.

Building on previous work on global control of Rydberg atoms, the researchers developed a construction that allows simulating arbitrary quantum circuits using the Ising model with a global transverse field. Although the polynomial overheads in time, qubit number, and energy scale are substantial for current quantum hardware, this result is an important step towards developing more sophisticated methods that leverage the Ising model in quantum circuit simulation.

This finding has significant implications for various scientific communities. On one hand, assuming quantum computing is strictly more powerful than classical computing, the result acts as a no-go theorem for efficient classical simulation of the time-dependent global transverse-field Ising model. This impacts fields such as analog quantum simulation, quantum optimization on various platforms, and complexity and control theory.