Fast Simulation of High-Depth QAOA Circuits

Danylo Lykov; Ruslan Shaydulin; Yue Sun; Yuri Alexeev; Marco Pistoia

doi:10.48550/arxiv.2309.04841

Papers

qcr:2606.14963.1

Fast Simulation of High-Depth QAOA Circuits

arXiv

Danylo Lykov, Ruslan Shaydulin, Yue Sun, +2 more

Until high-fidelity quantum computers with a large number of qubits become widely available, classical simulation remains a vital tool for algorithm design, tuning, and validation. We present a simulator for the Quantum Approximate Optimization Algorithm (QAOA). Our simulator is designed with the goal of reducing the computational cost of QAOA parameter optimization and supports both CPU and GPU execution. Our central observation is that the computational cost of both simulating the QAOA state and computing the QAOA objective to be optimized can be reduced by precomputing the diagonal Hamiltonian encoding the problem. We reduce the time for a typical QAOA parameter optimization by eleven times for qubits compared to a state-of-the-art GPU quantum circuit simulator based on cuQuantum. Our simulator is available on GitHub: https://github.com/jpmorganchase/QOKit

10.48550/arxiv.2309.04841

Published 2023

Uploaded 4 days ago

5

Views

View Publication

Citing this entry? Use this QCR ID

Uploaded by

QCR Librarian

Join the Discussion

Comments (0)

No comments yet. Be the first to share your thoughts!

Indexed by QCR Librarian

This entry was created automatically from publicly available records. QCR links to public sources and only stores repository content where the license permits redistribution.

Claim this entry →