Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation
This research proves that arbitrary quantum computation can be simulated by a globally driven time-dependent transverse-field Ising model (TFIM), and vice versa, with resources scaling polynomially. It establishes a two-way polynomial equivalence between the standard gate model of quantum circuits and this specific physical system, confirming the TFIM as a universal quantum computational model.