Correctness of an application using QAOA

Hannu Reittu*, Ville Kotovirta

*Corresponding author for this work

Research output: Contribution to conferenceConference articleScientificpeer-review

Abstract

In this work, we analyze the Quantum Approximate Optimization Algorithm (QAOA) to solve a particular type of problem related to a graph clustering. We establish rigorous bounds for the efficiency of QAOA in the limit of a large problem.
Original languageEnglish
Pages1-5
Number of pages5
Publication statusAccepted/In press - 2025
MoE publication typeNot Eligible
EventVIII Workshop-School on Quantum Computing and Information & VIII Workshop on Quantum Computing, VIII ⟨WECIQ∣WCQ⟩ - UFSC, Florianopolis, Brazil
Duration: 8 Dec 202512 Dec 2025
https://workshop-cq.ufsc.br/2025/en/

Conference

ConferenceVIII Workshop-School on Quantum Computing and Information & VIII Workshop on Quantum Computing, VIII ⟨WECIQ∣WCQ⟩
Country/TerritoryBrazil
CityFlorianopolis
Period8/12/2512/12/25
Internet address

Fingerprint

Dive into the research topics of 'Correctness of an application using QAOA'. Together they form a unique fingerprint.

Cite this