Designing Quantum Annealing Schedules using Bayesian Optimization

• URL: http://arxiv.org/abs/2305.13365v1
• Date: Mon, 22 May 2023 18:00:03 GMT
• Title: Designing Quantum Annealing Schedules using Bayesian Optimization
• Authors: Jernej Rudi Fin\v{z}gar, Martin J. A. Schuetz, J. Kyle Brubaker, Hidetoshi Nishimori, Helmut G. Katzgraber
• Abstract summary: We find that Bayesian optimization is able to identify schedules resulting in fidelities several orders of magnitude better than standard protocols. Our scheme can help improve the design of hybrid quantum algorithms for hard optimization problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Non-native Quantum Generative Optimization with Adversarial Autoencoders [34.82692226532414]
  We introduce the adversarial quantum autoencoder model (AQAM) that can be used to map large-scale optimization problems onto existing quantum samplers. We demonstrate that the AQAM achieves a lower Renyi divergence and a larger spectral gap when compared to classical Markov Chain Monte Carlo samplers.
  arXiv  Detail & Related papers  (2024-07-18T18:03:18Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Superconducting processor design optimization for quantum error correction performance [3.6723640056915436]
  We introduce a multi-level simulation framework that spans both Hamiltonian and quantum error correction levels. This toolset aids in design optimization, tailored to specific objectives like quantum memory performance. We exemplify our approach through the multi-path coupling scheme of fluxonium qubits.
  arXiv  Detail & Related papers  (2023-12-07T10:13:08Z)
• Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems [65.268245109828]
  We compare the performance of classicals across a series of partially-randomized tasks. We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
  arXiv  Detail & Related papers  (2023-10-14T02:13:26Z)
• Quantum-Informed Recursive Optimization Algorithms [0.0]
  We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps. We use backtracking techniques to further improve the performance of the algorithm without increasing the requirements on the quantum hardware.
  arXiv  Detail & Related papers  (2023-08-25T18:02:06Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Quantum topology optimization of ground structures using noisy intermediate-scale quantum devices [8.325359814939517]
  We study the usage of quantum computers as a potential solution to topology optimization problems. Several experiments, including a real device experiment, show that the proposed method successfully obtained the optimal configurations.
  arXiv  Detail & Related papers  (2022-07-19T10:39:28Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Feedback-based quantum optimization [0.0]
  We introduce a feedback-based strategy for quantum optimization, where the results of qubit measurements are used to constructively assign values to quantum circuit parameters. We show that this procedure results in an estimate of the optimization problem solution that improves monotonically with the depth of the quantum circuit.
  arXiv  Detail & Related papers  (2021-03-15T18:01:03Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.