Impact of graph structures for QAOA on maxcut

DOI10.1007/s11128-021-03232-8OpenAlexW3198024605MaRDI QIDQ2685581

George Siopsis, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble, Lorna Treffert, Rebekah Herrman

Publication date: 22 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.05997

zbMATH Keywords

correlationgraph structuresQAOAmaxcut

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

Quantum alternating operator ansatz for solving the minimum exact cover problem ⋮ Empirical performance bounds for quantum approximate optimization

Uses Software

• Couenne

Cites Work

• Unnamed Item
• Unnamed Item
• Classical symmetries and the quantum approximate optimization algorithm
• Empirical performance bounds for quantum approximate optimization
• Lower bounds on circuit depth of the quantum approximate optimization algorithm
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• Integer Programming
• Randomized heuristics for the Max-Cut problem
• Quantum advantage with shallow circuits

This page was built for publication: Impact of graph structures for QAOA on maxcut