Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines

• URL: http://arxiv.org/abs/2507.15544v1
• Date: Mon, 21 Jul 2025 12:17:51 GMT
• Title: Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines
• Authors: Shuta Kikuchi, Nozomu Togawa, Shu Tanaka,
• Abstract summary: We propose a hybrid optimization method that combines a non-quantum-type Ising machine with a quantum annealing machine.<n>We evaluate the performance of the hybrid method on large-size Ising models and analyzed its characteristics.
• Score: 4.84747045153933
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To enhance the performance of quantum annealing machines, several methods have been proposed to reduce the number of spins by fixing spin values through preprocessing. We proposed a hybrid optimization method that combines a simulated annealing (SA)-based non-quantum-type Ising machine with a quantum annealing machine. However, its applicability remains unclear. Therefore, we evaluated the performance of the hybrid method on large-size Ising models and analyzed its characteristics. The results indicate that the hybrid method improves upon solutions obtained by the preprocessing SA, even if the Ising models cannot be embedded in the quantum annealing machine. We analyzed the method from three perspectives: preprocessing, spin-fixed sub-Ising model generation method, and the accuracy of the quantum annealing machine. From the viewpoint of the minimum energy gap, we found that solving the sub-Ising model with a quantum annealing machine results in a higher solution accuracy than solving the original Ising model. Additionally, we demonstrated that the number of fixed spins and the accuracy of the quantum annealing machine affect the dependency of the solution accuracy on the sub-Ising model size.

Related papers

• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Looking elsewhere: improving variational Monte Carlo gradients by importance sampling [41.94295877935867]
  Neural-network quantum states (NQS) offer a powerful and expressive ansatz for representing quantum many-body wave functions.<n>It is well known that some scenarios - such as sharply peaked wave functions emerging in quantum chemistry - lead to high-variance gradient estimators hindering the effectiveness of variational optimizations.<n>In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling.<n>Our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100x when targeting highly peaked quantum chemistry wavefunctions.
  arXiv  Detail & Related papers  (2025-07-07T18:00:03Z)
• Utilization of SU(2) Symmetry for Efficient Simulation of Quantum Systems [0.0]
  This work investigates variational compilation methods for simulating quantum systems with internal SU(2) symmetry.<n>The central component of the research is the application of the Dynamic Mode Decomposition (DMD) method to extrapolate trained variational circuit parameters.<n>An approach is proposed for predicting variationally compiled quantum states with a larger number of Trotter steps using extrapolated parameters, eliminating the need for retraining.
  arXiv  Detail & Related papers  (2025-06-23T16:17:56Z)
• Advantages of fixing spins in quantum annealing [1.0937094979510213]
  Size-reduction methods are used to treat large-scale optimization problems that cannot be input directly into a quantum annealer.<n>Various size-reduction methods using fixing spins have been proposed as quantum-classical hybrid methods to obtain solutions.
  arXiv  Detail & Related papers  (2024-10-29T10:30:53Z)
• Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models [0.0]
  We introduce a systematic procedure for ansatz building based on approximate Quantum Mutual Information (QMI) Our approach generates a layered-structured ansatz, where each layer's qubit pairs are selected based on their QMI values, resulting in more efficient state preparation and optimization routines. Our results show that the Multi-QIDA method reduces the computational complexity while maintaining high precision, making it a promising tool for quantum simulations in lattice spin models.
  arXiv  Detail & Related papers  (2024-08-05T17:07:08Z)
• Conditional Diffusion-based Parameter Generation for Quantum Approximate Optimization Algorithm [7.48670688063184]
  The Quantum Approximate Optimization (OAQA) is a hybrid that shows promise in efficiently solving the MaxCut problem.<n>The generative learning model specifically the denoising diffusion (DDPM) is to learn the distribution parameters on the graph dataset.
  arXiv  Detail & Related papers  (2024-07-17T01:18:27Z)
• EM Distillation for One-step Diffusion Models [65.57766773137068]
  We propose a maximum likelihood-based approach that distills a diffusion model to a one-step generator model with minimal loss of quality.<n>We develop a reparametrized sampling scheme and a noise cancellation technique that together stabilizes the distillation process.
  arXiv  Detail & Related papers  (2024-05-27T05:55:22Z)
• A Deep Unrolling Model with Hybrid Optimization Structure for Hyperspectral Image Deconvolution [50.13564338607482]
  We propose a novel optimization framework for the hyperspectral deconvolution problem, called DeepMix.<n>It consists of three distinct modules, namely, a data consistency module, a module that enforces the effect of the handcrafted regularizers, and a denoising module.<n>This work proposes a context aware denoising module designed to sustain the advancements achieved by the cooperative efforts of the other modules.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Sharp Calibrated Gaussian Processes [58.94710279601622]
  State-of-the-art approaches for designing calibrated models rely on inflating the Gaussian process posterior variance. We present a calibration approach that generates predictive quantiles using a computation inspired by the vanilla Gaussian process posterior variance. Our approach is shown to yield a calibrated model under reasonable assumptions.
  arXiv  Detail & Related papers  (2023-02-23T12:17:36Z)
• A non-Hermitian Ground State Searching Algorithm Enhanced by Variational Toolbox [13.604981031329453]
  Ground-state preparation for a given Hamiltonian is a common quantum-computing task of great importance. We consider an approach to simulate dissipative non-Hermitian quantum dynamics using Hamiltonian simulation techniques. The proposed method facilitates the energy transfer by repeatedly projecting ancilla qubits to the desired state.
  arXiv  Detail & Related papers  (2022-10-17T12:26:45Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Greedy parameter optimization for diabatic quantum annealing [0.0]
  A shorter processing time is desirable for quantum computation to minimize the effects of noise. We propose a simple procedure to variationally determine a set of parameters in the transverse-field Ising model. We test the idea in the ferromagnetic system with all-to-all couplings and spin-glass problems.
  arXiv  Detail & Related papers  (2021-11-26T01:31:01Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)

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.