WILEY : String Model Building on Quantum Annealers

Abel, Steven A.; Rizos, John; Nutricati, Luca A.

doi:10.1002/prop.202300167

Article
Report number	arXiv:2306.16801 ; CERN-TH-2023-123
Title	String Model Building on Quantum Annealers
Author(s)	Abel, Steven A. (CERN ; Durham U., IPPP ; Durham U.) ; Nutricati, Luca A. (Durham U., IPPP ; Durham U.) ; Rizos, John (Ioannina U.)
Publication	2023-12-01
Imprint	2023-06-29
Number of pages	9
Note	9 pages, 1 figure
In:	Fortschr. Phys. 71 (2023) 2300167
DOI	10.1002/prop.202300167
Subject category	quant-ph ; General Theoretical Physics ; hep-ph ; Particle Physics - Phenomenology ; hep-th ; Particle Physics - Theory
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.
Copyright/License	publication: © 2023-2025 The Authors (License: CC-BY-4.0) preprint: (License: CC BY 4.0)

$Comparison of the machine-time efficiency of various techniques for finding viable models. The methods analysed are: random scans, genetic algorithms, simulated annealing and quantum annealing. For the first three methods ``machine-time'' is equivalent to CPU-time. In the latter case it implies time on the annealer. The number of independent GGSO coefficients is 28, yielding to a search space of $ 2^{28} \sim 10^8$ possible models. The superiority of the methods using annealers is clearly evident in this case, surpassing the other techniques. The total number of models found using simulated annealing is 894 in approximately $6000s$ {\it vs} 153 and 61 models found using a genetic algorithm and a random scan, respectively. For the quantum annealer each anneal run had 2000 reads and used auxiliary variables $K_i \in [-3,4]$. The dashed lines both indicate quantum annealing and are projections based on the simulated annealing data. In these two cases the machine-time does not take into account the dead-time required due to bottlenecks in exchanging information with the annealer (which incurs a delay of order a second, and which could be removed if a portion of the machine were dedicated to the search). The machine time is computed based on the anneal schedule time only, which is fixed to $160 \,\mu s$. The grey line takes also into account the time required to do all the classical checks on the models found by the annealer. The orange line is an estimation of the performance of a quantum annealer supposing that all the classical checks are also encoded in the annealer Hamiltonian.$

Corresponding record in: Inspire

Επιστροφή στην αναζήτηση

Δημιουργία εγγραφής 2023-08-04, τελευταία τροποποίηση 2025-01-24

Παρόμοιες εγγραφές

Πλήρες κείμενο:
2306.16801 -

PDF
document -

PDF

Προσθήκη στο προσωπικό καλάθι
Εξαγωγή ως BibTeX, MARC, MARCXML, DC, EndNote, NLM, RefWorks

CERN Document Server

Access articles, reports and multimedia content in HEP

Main menu

CERN Accelerating science