Distributed Variational Quantum Algorithm with Many-qubit for Optimization Challenges

📅 2025-02-28
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Existing quantum optimization algorithms suffer from poor scalability, noise sensitivity, and barren plateaus due to their strong reliance on entanglement. To address these limitations, this work proposes an entanglement-free variational quantum optimization algorithm (VQOA) for multi-qubit systems and its distributed variant (DVQOA). Methodologically, we introduce a novel multi-qubit (MQ) ansatz that leverages only quantum superposition—fully avoiding entanglement—and design a quantum-classical hybrid distributed architecture integrating variational circuits, native multi-qubit gates, adaptive hyperparameter optimization, and HPC cluster scheduling. Experimentally, the approach achieves over 50× speedup in metamaterial design tasks and successfully solves high-order N-ary optimization and quantum chemistry problems. It demonstrates verified scalability to the thousand-qubit regime and practical deployability on near-term hardware.

Technology Category

Application Category

📝 Abstract
Optimization problems are critical across various domains, yet existing quantum algorithms, despite their great potential, struggle with scalability and accuracy due to excessive reliance on entanglement. To address these limitations, we propose variational quantum optimization algorithm (VQOA), which leverages many-qubit (MQ) operations in an ansatz solely employing quantum superposition, completely avoiding entanglement. This ansatz significantly reduces circuit complexity, enhances noise robustness, mitigates Barren Plateau issues, and enables efficient partitioning for highly complex large-scale optimization. Furthermore, we introduce distributed VQOA (DVQOA), which integrates high-performance computing with quantum computing to achieve superior performance across MQ systems and classical nodes. These features enable a significant acceleration of material optimization tasks (e.g., metamaterial design), achieving more than 50$ imes$ speedup compared to state-of-the-art optimization algorithms. Additionally, DVQOA efficiently solves quantum chemistry problems and $ extit{N}$-ary $(N geq 2)$ optimization problems involving higher-order interactions. These advantages establish DVQOA as a highly promising and versatile solver for real-world problems, demonstrating the practical utility of the quantum-classical approach.
Problem

Research questions and friction points this paper is trying to address.

Addresses scalability and accuracy in quantum optimization algorithms.
Proposes a variational quantum optimization algorithm avoiding entanglement.
Integrates quantum and classical computing for large-scale optimization tasks.
Innovation

Methods, ideas, or system contributions that make the work stand out.

Variational quantum optimization algorithm avoids entanglement
Distributed VQOA integrates quantum and classical computing
Achieves 50x speedup in material optimization tasks
🔎 Similar Papers
No similar papers found.
S
Seongmin Kim
National Center for Computational Sciences, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37830, United States
In-Saeng Suh
In-Saeng Suh
Research Professor of Physics, University of Notre Dame
AstrophysicsGeneral RelativityCosmologySupercomputerMagnetism