Skip to main navigation Skip to search Skip to main content

Correctness of an application using QAOA

  • Hannu Reittu*
  • , Ville Kotovirta
  • *Corresponding author for this work
  • QMill Oy

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-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
Title of host publicationAnais do <WECIQ|WCQ>: Workshop-Escola de Computação e Informação Quântica e Workshop de Computação Quântica - UFSC 2025
PublisherEven3
Number of pages5
ISBN (Electronic)978-65-272-2250-7
Publication statusPublished - 3 Mar 2026
MoE publication typeA4 Article in a conference publication
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