Quick Navigation
Topics
Quantum Optimization
Quantum Machine Learning
Stone-in-Waiting: A Cloud-Based Accelerator for the Quantum Approximate Optimization Algorithm
arXiv
Authors: Shuai Zeng
Year
2026
Paper ID
35956
Status
Preprint
Abstract Read
~2 min
Abstract Words
167
Citations
N/A
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) and its advanced variant, the Quantum Alternating Operator Ansatz (QAOA), are major research topics in the current era of Noisy Intermediate-Scale Quantum (NISQ) computing. However, the problem of initializing their parameters remains unresolved. Motivated by the combinatorial optimization task in the 6th MindSpore Quantum Computing Hackathon (2024), this paper proposes Stone-in-Waiting, a cloud-based accelerator for obtaining high-quality initial parameters for QAOA. Internally, the accelerator builds on state-of-the-art theories and methods for parameter determination and integrates four self-developed algorithms for QAOA parameter initialization, mainly based on Bayesian methods, nearest-neighbor methods, and metric learning. Compared with the Baseline Algorithm, the generated parameters improve the score by 40.19%. Externally, the accelerator offers both a web interface and an API, providing flexible and convenient access for users to test and develop related experiments and applications. This paper presents the design principles and methods of Stone-in-Waiting, demonstrates its functional characteristics, compares the strengths and weaknesses of the four proposed algorithms, and validates the overall system performance through experiments.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- The Quantum Approximate Optimization Algorithm (QAOA) and its advanced variant, the Quantum Alternating Operator Ansatz (QAOA), are major research topics in the current era of...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.