REVIEW 12 cited by
Distributed Quantum Approximate Optimization Algorithm on a Quantum-Centric Supercomputing Architecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Distributed Quantum Approximate Optimization Algorithm on a Quantum-Centric Supercomputing Architecture
read the original abstract
Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than necessitated to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1,000-bit problem) achieving a high solution quality and short time-to-solution ($\sim$276 s), outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA's applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.
Forward citations
Cited by 12 Pith papers
-
Quantum Computations on Fusion Blanket Molten Salts
First heterogeneous quantum-classical computation on FLiBe clusters for tritium binding using EWF partitioning and ext-SQD on IBM hardware matches FCI fragment energies within 0.3 kcal/mol MAD but shows 12-110 kcal/mo...
-
A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization
The authors built and released a distributed QAOA simulator supporting monolithic and multi-QPU modes, runtime optimizations, a GUI, and demonstrations on benchmarks plus a power unit commitment problem where all mode...
-
A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization
This paper presents a new open-source distributed QAOA simulator for QUBO problems that includes variable allocation across QPUs, runtime optimizations, a Streamlit GUI, and demonstrations of consistent results with m...
-
A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization
Develops and demonstrates a distributed QAOA simulator that produces solution bitstrings and costs matching classical monolithic QAOA and brute force on tested QUBO instances including unit commitment.
-
Distributed Variational Quantum Optimisation by Entanglement-Selective Transport
QESTO is a distributed variational ansatz using persistent Bell pairs for amplitude transfer in graph-based discrete optimization, showing stronger convergence than partitioned QAOA on Wang tile ensembles.
-
Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications
Three complementary HPC-QC scheduling strategies cut classical resource use by up to 64% or improve QPU utilization depending on quantum-classical workload balance.
-
Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications
Three scheduling strategies for hybrid quantum-HPC systems cut classical resource use by up to 64% or boost QPU utilization depending on workload balance, validated on real hardware.
-
Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
-
Towards High Performance Quantum Computing (HPQ): Parallelisation of the Hamiltonian Auto Decomposition Optimisation Framework (HADOF)
Parallel HADOF execution on up to four IBM QPUs achieves 3-4x wall-clock speedup for combinatorial QUBO problems versus sequential runs, with comparable quality and validation on genome assembly instances.
-
A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization
The authors release a distributed QAOA simulator package that supports monolithic and multi-QPU execution modes for QUBO instances and demonstrates consistent results with classical references on benchmarks and a unit...
-
Exploring the Geometric and Dynamical Properties of Spin Systems and Their Interplay with Quantum Entanglement
This thesis explores geometric and dynamical properties of entanglement in two- and many-body spin systems under XXZ and Ising interactions using phase space and Fubini-Study geometry.
-
The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.