Constructing an optimal mixer for Quantum Approximate Optimization Algorithm (QAOA) Hamiltonian is crucial for enhancing the performance of QAOA in solving combinatorial optimization problems. We present a systematic methodology for constructing the QAOA tailored mixer Hamiltonian, ensuring alignment with the inherent symmetries of classical optimization problem objectives. The key to our approach is to identify an operator that commutes with the action of the group of symmetries on the QAOA underlying Hilbert space and meets the essential technical criteria for effective mixer Hamiltonian functionality. We offer a construction method specifically tailored to the symmetric group $S_d$, prevalent in a variety of combinatorial optimization problems. By rigorously validating the required properties, providing a concrete formula and corresponding quantum circuit for implementation, we establish the viability of the proposed mixer Hamiltonian. Furthermore, we demonstrate that the classical mixer $B$ commutes only with a subgroup of $S_d$ of significantly smaller order than the group itself, enhancing the efficiency of the proposed approach. To evaluate the effectiveness of our methodology, we compare two QAOA variants utilizing different mixer Hamiltonians: conventional $B=\sum X_i$ and the newly proposed $H_M$ in edge coloring and graph partitioning problems across various graphs. We observe statistically significant differences in mean values, with the new variant consistently demonstrating superior performance across multiple independent simulations. Additionally, we analyze the phenomenon of poor performance in alternative warm-start QAOA variants, providing a conceptual explanation supported by recent literature findings.
Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem
Instituto de Ciencia de Materiales de Madrid (CSIC)(马德里材料科学研究所);Department of Physical Chemistry, University of the Basque Country UPV/EHU(巴斯克大学物理化学系);Kipu Quantum GmbH(基普量子有限公司)
Learned-projector QAOA for hierarchical optimization
Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);Qiuzhen College, Tsinghua University(清华大学求真学院);Beijing International Center for Mathematical Research, Peking University(北京大学北京国际数学研究中心);Institute for Applied Mathematics, Tsinghua University(清华大学应用数学中心);Beijing Institute of Mathematical Sciences and Applications(北京数学与应用科学研究所以)
Constrained Portfolio Optimization via Quantum Approximate Optimization Algorithm (QAOA) with XY-Mixers and Trotterized Initialization: A Hybrid Approach for Direct Indexing
SquareOne Capital(SquareOne资本);School of Physics, Faculty of Sciences, Aristotle University of Thessaloniki(塞萨洛尼基亚里士多德大学理学院物理系)
Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
E.ON Digital Technology GmbH(E.ON数字技术有限公司);University of Calgary(卡尔加里大学);Université de Sherbrooke(舍布鲁克大学);IBM Quantum, Thomas J. Watson Research Center(IBM量子,托马斯·J·沃森研究中心)
National Quantum Computing Centre, Rutherford Appleton Laboratory(国家量子计算中心,拉瑟福德·阿普尔顿实验室);Quantum Software Lab, School of Informatics, The University of Edinburgh(爱丁堡大学信息学院量子软件实验室)
Fair sampling with temperature-targeted QAOA based on quantum-classical correspondence theory
Graduate School of Science and Technology, Keio University(庆应义塾大学理工学研究科);Department of Applied Physics and Physico-Informatics, Keio University(庆应义塾大学应用物理与物理信息学系);Keio University Sustainable Quantum Artificial Intelligence Center (KSQAIC), Keio University(庆应义塾大学可持续量子人工智能中心);Human Biology-Microbiome-Quantum Research Center (WPI-Bio2Q), Keio University(庆应义塾大学人类生物学-微生物组-量子研究中心);Green Computing System Research Organization, Waseda University(早稻田大学绿色计算系统研究组织)
Mechanism of Efficacy in QAOA for Random k-SAT: From Adiabatic Manifold to Sublinear Parameter Optimization
School of Computer Science and Engineering, Southeast University(东南大学计算机科学与工程学院);Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education(教育部计算机网络与信息集成重点实验室(东南大学))