Key points are not available for this paper at this time.
We propose and analyze the use of Bayesian optimization techniques to design quantum annealing schedules with minimal user and resource requirements. We showcase our scheme with results for two paradigmatic spin models. We find that Bayesian optimization is able to identify schedules resulting in fidelities several orders of magnitude better than standard protocols for both quantum and reverse annealing, as applied to the p-spin model. We also show that our scheme can help improve the design of hybrid quantum algorithms for hard combinatorial optimization problems, such as the maximum independent set problem, and illustrate these results via experiments on a neutral-atom quantum processor available on Amazon Braket. Published by the American Physical Society 2024
Building similarity graph...
Analyzing shared references across papers
Loading...
Jernej Rudi Finžgar
Martin J. A. Schuetz
J. Kyle Brubaker
Physical Review Research
Technical University of Munich
Tohoku University
Tokyo Institute of Technology
Building similarity graph...
Analyzing shared references across papers
Loading...
Finžgar et al. (Thu,) studied this question.
www.synapsesocial.com/papers/68e6e8a8b6db6435876635d1 — DOI: https://doi.org/10.1103/physrevresearch.6.023063