Single-layer digitized-counterdiabatic quantum optimization for p-spin models

Abstract Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers from limited hardware coherence times. In this sense, counterdiabatic quantum protocols provide a shortcut to this process, steering the system along its ground state with fast-changing Hamiltonian. In this work, we take full advantage of a digitized-counterdiabatic quantum optimization algorithm to find an optimal solution of the p -spin model up to four-local interactions. We choose a suitable scheduling function and initial Hamiltonian such that a single-layer quantum circuit suffices to produce a good ground-state overlap. By further optimizing parameters using variational methods, we solve with unit accuracy two-spin, three-spin, and four-spin problems for 100%, 93%, and 83% of instances, respectively. As a particular case of the latter, we also solve factorization problems involving 5, 9, and 12 qubits. Due to the low computational overhead, our compact approach may become a valuable tool towards quantum advantage in the NISQ era.

Authors

Institutions

Publication Details

Journal
Quantum Science and Technology
Published
2024-09-09
DOI
https://doi.org/10.1088/2058-9565/ad7880
Citations
5
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
1.74

Funders

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

Single-layer digitized-counterdiabatic quantum optimization for p-spin models

E. Solano, He-Liang Huang, F. Albarrán-Arriagada, Narendra N. Hegade et al.
5 citations
Quantum Science and Technology
Quantum Computing Algorithms and Architecture
1.74
article

Single-layer digitized-counterdiabatic quantum optimization for p-spin models

E. Solano, He-Liang Huang, F. Albarrán-Arriagada, Narendra N. Hegade, Huijie Guan, Xi Chen, Fei Zhou
article en
5 citations

Abstract

Abstract Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers from limited hardware coherence times. In this sense, counterdiabatic quantum protocols provide a shortcut to this process, steering the system along its ground state with fast-changing Hamiltonian. In this work, we take full advantage of a digitized-counterdiabatic quantum optimization algorithm to find an optimal solution of the p -spin model up to four-local interactions. We choose a suitable scheduling function and initial Hamiltonian such that a single-layer quantum circuit suffices to produce a good ground-state overlap. By further optimizing parameters using variational methods, we solve with unit accuracy two-spin, three-spin, and four-spin problems for 100%, 93%, and 83% of instances, respectively. As a particular case of the latter, we also solve factorization problems involving 5, 9, and 12 qubits. Due to the low computational overhead, our compact approach may become a valuable tool towards quantum advantage in the NISQ era.

Quantum Science and TechnologyVol. 10(1)
Universidad de Santiago de Chile (CL), Jinan Institute of Quantum Technology (CN), Instituto de Ciencia de Materiales de Madrid (ES), QuantumCTek (China) (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 13%
Quantum Computing Algorithms and Architecture
1.74
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.