Back to News
quantum-computing

Stone-in-Waiting: A Cloud-Based Accelerator for the Quantum Approximate Optimization Algorithm

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
A new cloud-based accelerator called Stone-in-Waiting addresses the unresolved challenge of initializing parameters for QAOA, a key algorithm in NISQ-era quantum computing, by integrating four novel initialization algorithms. The system combines Bayesian methods, nearest-neighbor approaches, and metric learning to generate high-quality QAOA parameters, outperforming baseline algorithms with a 40.19% improvement in optimization scores. Developed for the 2024 MindSpore Quantum Computing Hackathon, it offers both a web interface and API, enabling flexible access for researchers to test and deploy quantum optimization experiments. The paper compares the four proprietary algorithms’ strengths and weaknesses, validating their performance through experimental benchmarks while detailing the accelerator’s underlying design principles. This work bridges theoretical advancements in parameter initialization with practical cloud-based deployment, advancing NISQ-era combinatorial optimization applications.
Stone-in-Waiting: A Cloud-Based Accelerator for the Quantum Approximate Optimization Algorithm

Summarize this article with:

Quantum Physics arXiv:2603.19980 (quant-ph) [Submitted on 20 Mar 2026] Title:Stone-in-Waiting: A Cloud-Based Accelerator for the Quantum Approximate Optimization Algorithm Authors:Shuai Zeng View a PDF of the paper titled Stone-in-Waiting: A Cloud-Based Accelerator for the Quantum Approximate Optimization Algorithm, by Shuai Zeng View PDF HTML (experimental) 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. Subjects: Quantum Physics (quant-ph); Distributed, Parallel, and Cluster Computing (cs.DC) Cite as: arXiv:2603.19980 [quant-ph] (or arXiv:2603.19980v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.19980 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Shuai Zeng [view email] [v1] Fri, 20 Mar 2026 14:23:57 UTC (9,003 KB) Full-text links: Access Paper: View a PDF of the paper titled Stone-in-Waiting: A Cloud-Based Accelerator for the Quantum Approximate Optimization Algorithm, by Shuai ZengView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 Change to browse by: cs cs.DC References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-optimization
quantum-computing
quantum-algorithms

Source Information

Source: arXiv Quantum Physics