Quantum optimization algorithms: Difference between revisions

Revision as of 15:28, 6 June 2024

Revision as of 14:55, 22 June 2024

Line 120:

Several variations to the basic structure of QAOA have been proposed,<ref>{{Cite journal |last1=Blekos |first1=Kostas |last2=Brand |first2=Dean |last3=Ceschini |first3=Andrea |last4=Chou |first4=Chiao-Hui |last5=Li |first5=Rui-Hao |last6=Pandya |first6=Komal |last7=Summer |first7=Alessandro |date=June 2024 |title=A Review on Quantum Approximate Optimization Algorithm and its Variants |journal=Physics Reports |volume=1068 |pages=1–66 |doi=10.1016/j.physrep.2024.03.002|arxiv=2306.09198 |bibcode=2024PhR..1068....1B }}</ref> which include variations to the ansatz of the basic algorithm. The choice of ansatz typically depends on the problem type, such as combinatorial problems represented as graphs, or problems strongly influenced by hardware design. However, ansatz design must balance specificity and generality to avoid overfitting and maintain applicability to a wide range of problems. For this reason, designing optimal ansatze for QAOA is an extensively researched and widely investigated topic. Some of the proposed variants are:

# MulltiMulti-angle QAOA<ref>{{Cite journal |last1=Herrman |first1=Rebekah |last2=Lotshaw |first2=Phillip C. |last3=Ostrowski |first3=James |last4=Humble |first4=Travis S. |last5=Siopsis |first5=George |date=2022-04-26 |title=Multi-angle quantum approximate optimization algorithm |journal=Scientific Reports |language=en |volume=12 |issue=1 |page=6781 |doi=10.1038/s41598-022-10555-8 |issn=2045-2322 |pmc=9043219 |pmid=35474081|arxiv=2109.11455 |bibcode=2022NatSR..12.6781H }}</ref>

# QAOA+<ref>{{Cite book |last1=Chalupnik |first1=Michelle |last2=Melo |first2=Hans |last3=Alexeev |first3=Yuri |last4=Galda |first4=Alexey |chapter=Augmenting QAOA Ansatz with Multiparameter Problem-Independent Layer |date=September 2022 |title=2022 IEEE International Conference on Quantum Computing and Engineering (QCE) |chapter-url=https://ieeexplore.ieee.org/document/9951267 |publisher=IEEE |pages=97–103 |doi=10.1109/QCE53715.2022.00028 |arxiv=2205.01192 |isbn=978-1-6654-9113-6}}</ref>

# Digitised counteradiabatic QAOA<ref>{{Cite journal |last1=Chandarana |first1=P. |last2=Hegade |first2=N. N. |last3=Paul |first3=K. |last4=Albarrán-Arriagada |first4=F. |last5=Solano |first5=E. |last6=del Campo |first6=A. |last7=Chen |first7=Xi |date=2022-02-22 |title=Digitized-counterdiabatic quantum approximate optimization algorithm |url=https://link.aps.org/doi/10.1103/PhysRevResearch.4.013141 |journal=Physical Review Research |language=en |volume=4 |issue=1 |page=013141 |doi=10.1103/PhysRevResearch.4.013141 |arxiv=2107.02789 |bibcode=2022PhRvR...4a3141C |issn=2643-1564}}</ref>