Abstract
AbstractThe performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation ratio. The set of problem instances studied consists of weighted MaxCut problems and 2-satisfiability problems. The Ising model representations of the latter possess unique ground states and highly degenerate first excited states. The quantum approximate optimization algorithm is executed on quantum computer simulators and on the IBM Q Experience. Additionally, data obtained from the D-Wave 2000Q quantum annealer are used for comparison, and it is found that the D-Wave machine outperforms the quantum approximate optimization algorithm executed on a simulator. The overall performance of the quantum approximate optimization algorithm is found to strongly depend on the problem instance.
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modelling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference38 articles.
1. Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014). arXiv:1411.4028
2. Born, M., Fock, V.: Beweis des Adiabatensatzes. Z. Phys. 51, 165 (1928)
3. Streif, M., Leib, M.: Comparison of QAOA with quantum and simulated annealing (2019). arXiv:1901.01903
4. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484 (1997)
5. Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)
Cited by
96 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献