Paper
13 March 2024 Practical quantum approximate optimization algorithms on IBM quantum processors
Author Affiliations +
Abstract
In recent years, significant progress has been made in building quantum computers by several companies. Despite the progress, these noisy intermediate-scale quantum (NISQ) computers still suffer from several noises and errors such as measurement errors, multi-qubit gate errors, and worse, short decoherence times. Though quantum computer vendors are releasing better quantum computers in terms of Quantum Volume, the quantum device still remains far from quantum supremacy in practical problems. The Quantum Approximate Optimization Algorithm (QAOA) was suggested to potentially demonstrate a computational advantage in combinatorial optimization problems on NISQ computers. In this paper, we optimize the QAOA circuits and to scale the problem size on IBM quantum processors. In addition, we study the effect of the length of the QAOA ansatz on IBM quantum processors and discuss optimal implementation methods for scalable QAOA. We test our implementations on the MaxCut problems.
© (2024) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Greg Medwig, Sua Choi, Paulo C. Castillo, and Kwangmin Yu "Practical quantum approximate optimization algorithms on IBM quantum processors", Proc. SPIE 12911, Quantum Computing, Communication, and Simulation IV, 129111G (13 March 2024); https://doi.org/10.1117/12.3002940
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum computers

Quantum communications

Quantum computing

Quantum approximate optimization

Mathematical optimization

Quantum modeling

Quantum devices

Back to Top