TY - JOUR
T1 - Quantum Annealing for Electromagnetic Engineers—Part II
T2 - Examples of electromagnetic problems solved by quantum annealing
AU - Lee, Sangbin
AU - Lim, Qi Jian
AU - Ross, Charles
AU - Lee, Eungkyu
AU - Han, Soyul
AU - Kim, Youngmin
AU - Peng, Zhen
AU - Kim, Sanghoek
N1 - This work was supported in part in part by the Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korean government (Grant RS-2024—00393808, Efficient design of RF components and systems based on artificial intelligence, 16%); in part by the Ministry of Science, ICT and Future Planning, Korea, under the Information Technology Research Center support program (Grant IITP-2021-0-02046, 16%) supervised by the IITP; in part by the NAVER Digital Bio Innovation Research fund, funded by the NAVER Corporation (Grant 3720230040, 16%); in part by the National Research Foundation of Korea (Grant 2018R1A6A1A03025708, 16%; Grant 2023R1A2C2004236, 16%; and Grant RS-2023—00255442, 10%); in part by an Alchemist Project grant funded by Korea Evaluation Institute of Industrial Technology and the Korea Government (MOTIE) (Project Number 1415179744 and Project Number 20019169, 10%). The funders had no role in the design, data collection and analysis, and reporting of the study.
PY - 2026
Y1 - 2026
N2 - It is well known that electromagnetic computations are computationally demanding. Interestingly, many such problems can be recast to be solved by quantum annealing. Quantum annealing, a kind of quantum computer, utilizes quantum tunneling for state transitions, which enables one to find the global minimum in a complex energy landscape. Part I of this article explains quantum annealing for the classical electromagnetic community, assuming little knowledge of quantum theory. Both the basic principle and recent developments to extend its applications, such as hybrid quantum–classical annealing, are reviewed. Part II presents various examples of electromagnetic problems that can be solved by quantum annealing. Those are 1) optimization of a reconfigurable directional metasurface, 2) finding current distribution in an arbitrary wire antenna, 3) finding charge and field distributions in a static condition, and 4) optimization of source excitation to focus fields in hyperthermia. Finally, the performance of quantum annealer is compared with classical solvers to deduce the type of application in which a quantum annealer of current technologies can be preferred in practice.
AB - It is well known that electromagnetic computations are computationally demanding. Interestingly, many such problems can be recast to be solved by quantum annealing. Quantum annealing, a kind of quantum computer, utilizes quantum tunneling for state transitions, which enables one to find the global minimum in a complex energy landscape. Part I of this article explains quantum annealing for the classical electromagnetic community, assuming little knowledge of quantum theory. Both the basic principle and recent developments to extend its applications, such as hybrid quantum–classical annealing, are reviewed. Part II presents various examples of electromagnetic problems that can be solved by quantum annealing. Those are 1) optimization of a reconfigurable directional metasurface, 2) finding current distribution in an arbitrary wire antenna, 3) finding charge and field distributions in a static condition, and 4) optimization of source excitation to focus fields in hyperthermia. Finally, the performance of quantum annealer is compared with classical solvers to deduce the type of application in which a quantum annealer of current technologies can be preferred in practice.
UR - https://www.scopus.com/pages/publications/85217577903
UR - https://www.scopus.com/pages/publications/85217577903#tab=citedBy
U2 - 10.1109/MAP.2025.3530408
DO - 10.1109/MAP.2025.3530408
M3 - Article
AN - SCOPUS:85217577903
SN - 1045-9243
VL - 68
SP - 37
EP - 46
JO - IEEE Antennas and Propagation Magazine
JF - IEEE Antennas and Propagation Magazine
IS - 1
ER -