2022/04/25 by Bin Yan, Nikolai A. Sinitsyn · 1 citation
Computer Science · Physics and Astronomy · Mathematics · #Quantum Computing Algorithms and Architecture #Quantum many-body systems #Quantum Information and Cryptography #Quantum annealing #Hamiltonian (control theory) #Ising model #Physics #Ising spin #Quantum #Simulated annealing #Quantum mechanics #Statistical physics #Condensed matter physics #Quantum computer #Mathematical physics #Mathematics #Algorithm
paper · pdf · doi:10.1038/s41467-022-29887-0
openalex publication_date 2022/04/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Abstract Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial state to a low energy state of a target Ising Hamiltonian of quantum spins, H I . Here, we point to the existence of an analytical solution for such a problem for an arbitrary H I beyond the adiabatic limit for QA. This solution provides insights into the accuracy of nonadiabatic computations. Our QA protocol in the pseudo-adiabatic regime leads to a monotonic power-law suppression of nonadiabatic excitations with time T of QA, without any signature of a transition to a glass phase, which is usually characterized by a logarithmic energy relaxation. This behavior suggests that the energy relaxation can differ in classical and quantum spin glasses strongly, when it is assisted by external time-dependent fields. In specific cases of H I , the solution also shows a considerable quantum speedup in computations.