Multi-round QAOA and advanced mixers on a trapped-ion quantum computer

Autor:	Yingyue Zhu, Zewen Zhang, Bhuvanesh Sundar, Alaina M Green, C Huerta Alderete, Nhung H Nguyen, Kaden R A Hazzard, Norbert M Linke
Rok vydání:	2022
Předmět:	Quantum Physics Physics and Astronomy (miscellaneous) Materials Science (miscellaneous) FOS: Physical sciences Electrical and Electronic Engineering Quantum Physics (quant-ph) Atomic and Molecular Physics and Optics
DOI:	10.48550/arxiv.2201.12335
Popis:	Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of variational circuits. However, there exist several challenges limiting the real-world applications of QAOA. In this paper, we demonstrate on a trapped-ion quantum computer that QAOA results improve with the number of rounds for multiple problems on several arbitrary graphs. We also demonstrate an advanced mixing Hamiltonian that allows sampling of all optimal solutions with predetermined weights. Our results are a step towards applying quantum algorithms to real-world problems. Comment: 8 pages, 5 figures
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::201133babec6cf448e85f43856d66e6b Zobrazit plný text záznamu