Max-Cut is a common testbed for near-term quantum optimization because it has a simple Ising Hamiltonian, established classical baselines, and a parameterized quantum circuit whose performance depends on the outer classical optimizer. This paper develops QASPA-MaxCut, a shift-phase circuit for Max-Cut that encodes graph edges through controlled $R_y$ rotations of the form $\mathrm{CX}_{ij}R_y(θ_{ij})\mathrm{CX}_{ij}$. We derive the exact two-qubit algebra of the edge block, trace an unweighted four-vertex example, and compare one-layer QASPA-MaxCut with depth-one QAOA by exact state-vector simulation. The protocol uses seed 42, evaluates connected backbone-augmented random graphs with additional-edge probabilities $p_{\mathrm{edge}}\in\{0.1,0.3,0.5,0.7\}$, and adds nineteen custom unweighted topologies. The QASPA-MaxCut score is reported after the algorithm's classical selection stage: the four leading QASPA bit strings are evaluated by the Max-Cut objective, and the best cut is retained. The QAOA score is the expected approximation ratio after local optimization, reported as a best-of-$k$ curve over one to ten restarts. In these small exact simulations, fixed-angle QASPA-MaxCut produces reported group-mean selection ratios between $0.955$ and $1.000$, the topology-level readout is unchanged in the retained finite-shot checks under the rule $\lceil 0.03047\cdot 2^n+1016.2\rceil$, and depth-one QAOA improves with additional classical restarts while remaining lower than the QASPA selection score in the reported mean summaries. This comparison motivates further study of the classical search budget needed to obtain competitive Max-Cut samples at shallow circuit depth.
On the Effects of Small Graph Perturbations in the MaxCut Problem by QAOA
Department of Information Engineering, Electronics;Telecommunications (DIET), University of Rome ``La Sapienza'', Via Eudossiana 18, 00184 Rome, Italy.
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
Google Quantum AI(谷歌量子人工智能);Center for Theoretical Physics, Massachusetts Institute of Technology(麻省理工学院理论物理中心);Walter Burke Institute for Theoretical Physics, California Institute of Technology(加州理工学院沃尔特·伯克理论物理研究所)
Iterative Quantum Optimization: From Greedy Reductions to Branch-and-Bound
Quantum Artificial Intelligence Laboratory (QuAIL), NASA Ames Research Center(量子人工智能实验室(QuAIL),NASA艾姆斯研究中心);USRA Research Institute for Advanced Computer Science(美国大学空间研究协会高级计算机科学研究所)
Hardware-Aware QAOA for Honeypot Traffic Partitioning on 100+ Qubit IBM Quantum Processors
Future of Computing Institute, Rensselaer Polytechnic Institute(未来计算研究所,伦斯勒理工学院);School of Computer Science and Mathematics, Marist University(计算机科学与数学学院,玛里斯特大学)
Performance guarantees of light-cone variational quantum algorithms for the maximum cut problem
RIKEN Center for Interdisciplinary Theoretical and Mathematical Sciences (iTHEMS)(理化学研究所交叉理论与数学科学中心 (iTHEMS));RIKEN Center for Computational Science (R-CCS)(理化学研究所计算科学中心 (R-CCS));Center on Frontiers of Computing Studies, Peking University(北京大学前沿计算研究中心);School of Computer Science, Peking University(北京大学计算机学院)
Improving the efficiency of QAOA using efficient parameter transfer initialization and targeted-single-layer regularized optimization with minimal performance degradation
Department of Physics & Astrophysics, University of Delhi(德里大学物理与天体物理学系)
Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation
National Key Laboratory of Autonomous Intelligent Unmanned Systems, Shanghai Research Institute for Intelligent Autonomous Systems, Tongji University(同济大学智能无人系统全国重点实验室、上海智能无人驾驶系统研究所);College of Electronic and Information Engineering, Tongji University(同济大学电子与信息工程学院)
Emergent Problem-Graph Alignment in RL-Discovered Entanglement Topologies for QAOA
Institute for Computer Science, LMU Munich(慕尼黑大学计算机科学研究所);relAI – Konrad Zuse School of Excellence in Reliable AI, LMU Munich(relAI – 康拉德·楚泽可靠人工智能卓越学院,慕尼黑大学);Department of Computer Science, University of Exeter(埃克塞特大学计算机系)
Cross-Problem Parameter Transfer in Quantum Approximate Optimization Algorithm: A Machine Learning Approach
Information Sciences University of Delaware Newark, Delaware(信息科学大学德雷克塞尔大学新阿姆斯特朗分校);Engineering University of Delaware Newark, Delaware(工程大学德雷克塞尔大学新阿姆斯特朗分校);Astronomy University of Delaware Newark, Delaware(天文学大学德雷克塞尔大学新阿姆斯特朗分校)