Edge-based quantum approximate optimization algorithm for MAX-CUT problem

DOI10.1007/S11128-025-04925-0MaRDI QIDQ6908740zbMATH OpenFDO

Authors Youngjin Seo, Jun-Haeng Heo

Publication date 30 October 2025

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/S11128-025-04925-0

zbMATH Keywords

quantum algorithmMAX-CUT problemquantum approximate optimization algorithmnoisy intermediate-scale quantum

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Impact of graph structures for QAOA on maxcut
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs

This page was built for publication: Edge-based quantum approximate optimization algorithm for MAX-CUT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908740)