Grover's search meets Ising models: A quantum algorithm for finding low-energy states

We propose a methodology for implementing Grover's algorithm in the digital quantum simulation of disordered Ising models . The core concept revolves around using the evolution operator for the Ising model as the quantum oracle within Grover's search. This operator induces phase shifts for the eigenstates of the Ising Hamiltonian , with the most pronounced shifts occurring for the lowest and highest energy states. Determining these states for a disordered Ising Hamiltonian using classical methods presents an exponentially complex challenge with respect to the number of spins (or qubits) involved. Within our proposed approach, we determine the optimal evolution time by ensuring a phase flip for the target states. This method yields a quadratic speedup compared to classical computation methods and enables the identification of the lowest and highest energy states (or neighboring states) with a high probability ≲1.

Authors

Institutions

Publication Details

Journal
Computer Physics Communications
Published
2025-04-23
DOI
https://doi.org/10.1016/j.cpc.2025.109627
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Grover's search meets Ising models: A quantum algorithm for finding low-energy states

W. V. Pogosov, A. A. Zhukov, A.V. Lebedev
1 citations
Computer Physics Communications
Quantum Computing Algorithms and Architecture
2.48
article

Grover's search meets Ising models: A quantum algorithm for finding low-energy states

W. V. Pogosov, A. A. Zhukov, A.V. Lebedev
article en
1 citations

Abstract

We propose a methodology for implementing Grover's algorithm in the digital quantum simulation of disordered Ising models . The core concept revolves around using the evolution operator for the Ising model as the quantum oracle within Grover's search. This operator induces phase shifts for the eigenstates of the Ising Hamiltonian , with the most pronounced shifts occurring for the lowest and highest energy states. Determining these states for a disordered Ising Hamiltonian using classical methods presents an exponentially complex challenge with respect to the number of spins (or qubits) involved. Within our proposed approach, we determine the optimal evolution time by ensuring a phase flip for the target states. This method yields a quadratic speedup compared to classical computation methods and enables the identification of the lowest and highest energy states (or neighboring states) with a high probability ≲1.

Computer Physics CommunicationsVol. 313
Moscow Institute of Physics and Technology (RU), All Russia Research Institute of Automatics (RU), Institute of Theoretical and Applied Electrodynamics (RU)
Ministry of Education and Science of the Russian Federation, Russian Science Foundation
Affordable and clean energy
Openalex Percentile: Top 11%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Grover's search meets Ising models: A quantum algorithm for finding low-energy states — W. V. Pogosov, A. A. Zhukov, et al. · Computer Physics Communications (2025) | TGRS Research Map | TGRS