String Model Building on Quantum Annealers
Steven A. Abel, Luca A. Nutricati, John Rizos

TL;DR
This paper investigates the use of quantum annealers for constructing string models, demonstrating significant speed advantages over traditional methods like simulated annealing, genetic algorithms, and random scans.
Contribution
It introduces the novel application of quantum annealers for direct string model building and compares their efficiency to classical approaches.
Findings
Quantum annealers are roughly fifty times faster than random scans and genetic algorithms.
Quantum annealers are approximately four times faster than simulated annealing.
The study highlights potential advantages of quantum annealers in model discovery.
Abstract
We explore for the first time the direct construction of string models on quantum annealers, and investigate their efficiency and effectiveness in the model discovery process. Through a thorough comparison with traditional methods such as simulated annealing, random scans, and genetic algorithms, we highlight the potential advantages offered by quantum annealers, which in this study promised to be roughly fifty times faster than random scans and genetic algorithm and approximately four times faster than simulated annealing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Quality and Management · Advanced Data Storage Technologies · Web Data Mining and Analysis
