String Model Building on Quantum Annealers

DOI10.1002/PROP.202300167MaRDI QIDQ6144247zbMATH OpenFDO

Authors S. A. Abel, J. Rizos

Publication date 5 January 2024

Published in Fortschritte der Physik (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2306.16801

zbMATH Keywords

heterotic string compactificationsquantum computingSO(10) gutsstring theory

Mathematics Subject Classification ID

Quantum theory (81-XX)

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.

Recommendations

• Quantum versus classical annealing of Ising spin glasses
• Deep learning optimal quantum annealing schedules for random Ising models
• Quantum annealing of hard problems
• Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
• An improved quantum annealing algorithm

Cites work

• Classification of the chiral \(Z_{2}\times Z_{2}\) fermionic models in the heterotic superstring
• Data science applications to string theory
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)

This page was built for publication: String Model Building on Quantum Annealers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144247)