Extending the computational reach of Quantum Annealing using Reverse Annealing

• URL: http://arxiv.org/abs/2607.02146v1
• Date: Thu, 02 Jul 2026 13:21:57 GMT
• Title: Extending the computational reach of Quantum Annealing using Reverse Annealing
• Abstract summary: We find that combining forward and reverse annealing consistently improves solution quality and efficiency across multiple problem classes.<n>We establish these results through a systematic experimental study on a D-Wave Advantage system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum annealing is a promising heuristic for combinatorial optimization, but on current hardware its performance degrades for larger and more complex problems due to noise and small energy gaps. Reverse annealing has been proposed as a refinement strategy, yet it remains unclear when it provides systematic advantages over standard forward annealing or simply increasing annealing time. We find that combining forward and reverse annealing consistently improves solution quality and efficiency across multiple problem classes. The benefits of reverse annealing increase with problem complexity and are strongest in regimes where forward annealing is increasingly limited. Moreover, reverse annealing yields larger efficiency gains than simply extending forward annealing times. We establish these results through a systematic experimental study on a D-Wave Advantage system, benchmarking reverse annealing across Max-Cut, Number Partitioning, and sparse clustering problems while varying reverse distance, pause duration, and annealing time. We identify a narrow optimal regime for reverse annealing parameters linked to the location of freeze-out points and energy-level crossings in the annealing schedule. These findings demonstrate that reverse annealing is most valuable for large, high-complexity optimization problems and is likely to gain importance as quantum annealing hardware scales toward more realistic applications.

Related papers

• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• Quantum Multiple Rotation Averaging [28.27979152030028]
  Multiple quadratic averaging (MRA) is a fundamental optimization problem in 3D vision and robotics.<n>We introduce IQARS (Iterative Quantum Anneal Rotationing for Synchronization), the first algorithm that reformulates MRA as a sequence.<n>We evaluate IQARS's performance on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2026-02-10T18:59:54Z)
• Neural Guided Sampling for Quantum Circuit Optimization [26.90377134346014]
  Translating a quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit.<n>One method to address efficient transpilation is based on approaches known from optimization, e.g. by using random sampling and token replacement strategies.<n>Here, we propose in this work 2D neural guided sampling. Thus, given a 2D representation of a quantum circuit, a neural network predicts groups of gates in the quantum circuit, which are likely reducible.
  arXiv  Detail & Related papers  (2025-10-14T12:09:05Z)
• Breaking Through Barren Plateaus: Reinforcement Learning Initializations for Deep Variational Quantum Circuits [21.491246867521053]
  Variational Quantum Algorithms (VQAs) have gained prominence as a viable framework for exploiting near-term quantum devices.<n>The effectiveness of VQAs is often constrained by the so-called barren plateau problem, wherein gradients diminish exponentially as system size or circuit depth increases.
  arXiv  Detail & Related papers  (2025-08-25T21:37:36Z)
• Quantum Annealing for Combinatorial Optimization: A Benchmarking Study [39.125366249242646]
  We show that a state-of-the-art quantum solver has higher accuracy (0.013%) and a significantly faster problem-solving time (6,561x) than the best classical solver.<n>Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations.
  arXiv  Detail & Related papers  (2025-04-08T16:43:24Z)
• Improving Diffusion Inverse Problem Solving with Decoupled Noise Annealing [84.97865583302244]
  We propose a new method called Decoupled Annealing Posterior Sampling (DAPS)<n>DAPS relies on a novel noise annealing process.<n>We demonstrate that DAPS significantly improves sample quality and stability across multiple image restoration tasks.
  arXiv  Detail & Related papers  (2024-07-01T17:59:23Z)
• TMPQ-DM: Joint Timestep Reduction and Quantization Precision Selection for Efficient Diffusion Models [40.5153344875351]
  We introduce TMPQ-DM, which jointly optimize timestep reduction and quantization to achieve a superior performance-efficiency trade-off. For timestep reduction, we devise a non-uniform grouping scheme tailored to the non-uniform nature of the denoising process. In terms of quantization, we adopt a fine-grained layer-wise approach to allocate varying bit-widths to different layers based on their respective contributions to the final generative performance.
  arXiv  Detail & Related papers  (2024-04-15T07:51:40Z)
• Travel time optimization on multi-AGV routing by reverse annealing [0.966840768820136]
  We propose a formulation to control the traveling routes to minimize the travel time. We validate our formulation through simulation in a virtual plant and authenticate the effectiveness for faster distribution. This study extends a use of optimization with general problem solvers in the application of multi-AGV systems.
  arXiv  Detail & Related papers  (2022-04-25T17:01:56Z)
• Quantum and classical annealing in a continuous space with multiple local minima [0.0]
  We show that quantum annealing yields a power law convergence, thus an exponential improvement over simulated annealing. We also reveal how diabatic quantum dynamics, quantum tunneling in particular, steers the systems toward the global minimum.
  arXiv  Detail & Related papers  (2022-03-22T02:02:23Z)
• 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)
• Advanced anneal paths for improved quantum annealing [0.0]
  We study how advanced features of the D-Wave annealer can help in improving the quality of the solutions returned by the annealer. The h-gain feature stands for time-dependent gain in Hamiltonian linear ($h$) biases and was originally developed to help study freezeout times and phase transitions in spin glasses. We test all techniques on a variety of input problems including the weighted Maximum Cut problem and the weighted Maximum Clique problem.
  arXiv  Detail & Related papers  (2020-09-10T17:15:48Z)
• Reverse Annealing for Nonnegative/Binary Matrix Factorization [0.0]
  It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. In this paper, we utilize reverse annealing instead of forward annealing in the quantum annealing subroutine for nonnegative/binary matrix factorization problems.
  arXiv  Detail & Related papers  (2020-07-10T18:40:02Z)

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.