GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems
By: Zhihao Xu , Srikar Chundury , Seongmin Kim and more
Potential Business Impact:
Solves hard problems much faster with supercomputers.
Quantum computing holds great potential to accelerate the process of solving complex combinatorial optimization problems. The Distributed Quantum Approximate Optimization Algorithm (DQAOA) addresses high-dimensional, dense problems using current quantum computing techniques and high-performance computing (HPC) systems. In this work, we improve the scalability and efficiency of DQAOA through advanced problem decomposition and parallel execution using message passing on the Frontier CPU/GPU supercomputer. Our approach ensures efficient quantum-classical workload management by distributing large problem instances across classical and quantum resources. Experimental results demonstrate that enhanced decomposition strategies and GPU-accelerated quantum simulations significantly improve DQAOA's performance, achieving up to 10x speedup over CPU-based simulations. This advancement enables better scalability for large problem instances, supporting the practical deployment of GPU systems for hybrid quantum-classical applications. We also highlight ongoing integration efforts using the Quantum Framework (QFw) to support future HPC-quantum computing systems.
Similar Papers
QAOA in Quantum Datacenters: Parallelization, Simulation, and Orchestration
Quantum Physics
Automates quantum computers for easier use.
Distributed Variational Quantum Algorithm with Many-qubit for Optimization Challenges
Quantum Physics
Solves hard problems much faster using quantum computers.
Pushing the Boundary of Quantum Advantage in Hard Combinatorial Optimization with Probabilistic Computers
Quantum Physics
Solves hard problems faster than quantum computers.