High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Elijah Pelofske, Andreas B\"artschi, John Golden, Stephan Eidenbenz

TL;DR
This paper develops optimized QAOA circuits for MAX k-SAT problems and tests them on multiple trapped ion quantum computers, revealing that current NISQ devices perform best at low circuit depths due to noise limitations.
Contribution
It introduces novel QAOA circuit constructions for MAX 3- and 4-SAT, including measurement-based uncomputation, and demonstrates large-scale circuit execution on NISQ hardware.
Findings
NISQ devices perform optimally at low QAOA rounds (p=1 to 5).
Performance degrades with increased circuit depth due to noise.
Largest QAOA circuits on NISQ devices include over 9,000 gates.
Abstract
The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm that aims to sample the optimal solution(s) of discrete combinatorial optimization problems. We present optimized QAOA circuit constructions for sampling MAX -SAT problems, specifically for and . The novel -SAT QAOA circuit construction we present uses measurement based uncomputation, followed by classical feed forward conditional operations. The QAOA circuit parameters for -SAT are optimized via exact classical (noise-free) simulation, using HPC resources to simulate up to rounds on qubits. In order to explore the limits of current NISQ devices we execute these optimized QAOA circuits for random -SAT test instances with clause-to-variable ratio on four trapped ion quantum computers: Quantinuum H1-1 (20 qubits), IonQ Harmony (11 qubits), IonQ Aria 1 (25 qubits),…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Low-power high-performance VLSI design · Complexity and Algorithms in Graphs
