Best Annealing Path of Quantum Annealing via Efficient Adiabatic Phase Transition

• URL: http://arxiv.org/abs/2608.30282v1
• Date: Mon, 31 Aug 2026 05:51:37 GMT
• Title: Best Annealing Path of Quantum Annealing via Efficient Adiabatic Phase Transition
• Abstract summary: In Quantum Annealing (QA), when the energy difference between the ground state and the first excited state is small, the transition probability between them increases.<n>Many studies are underway to accelerate QA theoretically, one of which is to incorporate non-stoquastic Hamiltonian.<n>I proposed Nested Simulated Annealing (NSA) inspired by Quantum Monte Carlo (QMC)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Annealing (QA) has already put into practical use and considered useful for solving many social issues, such as reduction of traffic congestion and delivery optimization. But in QA, when the energy difference between the ground state and the first excited state is small, the transition probability between them increases. Therefore, in order to decrease the transition, QA has to be performed at extremely low temperatures. To simulate the situation, it has the problem in that it takes much time. Many studies are underway to accelerate QA theoretically, one of which is to incorporate non-stoquastic Hamiltonian. On the other hand, I proposed Nested Simulated Annealing (NSA) inspired by Quantum Monte Carlo (QMC). I showed the computational speedup could be achieved dramatically, by considering the idea that the effect of flipping a spin preferentially influenced the spins directly interacting with it. Although NSA was based on such classical concept of causality, the hybrid computation both quantum and classical approach worked well. In this paper, in order to discuss the relationship between NSA and non-stoquastic Hamiltonian like XX-interaction, the spins are treated as continuous variables. I derive the formula to calculate the total energy in both with a problem Hamiltonian and the perturbation Hamiltonian induced by a transverse electromagnetic field. And I will show a clear relationship between local-maxima and the convergence speed when calculating it with the binary spin. More precisely, the annealing path with the smallest local-maxima converges fast, even though it consumes fewer computational resources. Therefore, it is possible to induce an optimal adiabatic phase transition by selecting NSA parameters appropriately. This paper shows an effective method to choose the parameters when simulating QMC on a classical computer.

Related papers

• Approaching the Limit in Multiparameter AC Magnetometry with Quantum Control [22.22957615478987]
  We introduce a quantum control protocol that resolves the problem of estimating the amplitude and frequency of an AC magnetic field.<n>It not only removes the singularity but also restores the optimal scaling of precision with interrogation time for both parameters simultaneously.<n>We experimentally validate this protocol using a nitrogen-vacancy center in diamond at room temperature, demonstrating the concurrent achievement of the optimal scaling for both parameters.
  arXiv  Detail & Related papers  (2026-02-19T18:55:17Z)
• Fast-forwardable Lindbladians imply quantum phase estimation [26.310568727393758]
  We show that certain simple Lindbladian processes can be adapted to perform QPE-type tasks.<n>Unlike QPE, which achieves Heisenberg-limit scaling, these Lindbladian evolutions are restricted to standard quantum limit complexity.<n>This indicates that, different from Hamiltonian dynamics, the natural dissipative evolution speed of such Lindbladians does not saturate the fundamental quantum limit.
  arXiv  Detail & Related papers  (2025-10-08T08:36:46Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Controlled Diagonal Catalyst Improves the Efficiency of Quantum Annealing [1.342834401139078]
  We propose a method for efficiently solving instances with small energy gaps by introducing additional local terms to the Hamiltonian.<n>The proposed method achieves an approximate square speed up in time-to-solution compared to the conventional quantum annealing.
  arXiv  Detail & Related papers  (2025-03-19T14:20:38Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Real-time dynamics of false vacuum decay [49.1574468325115]
  We investigate false vacuum decay of a relativistic scalar field in the metastable minimum of an asymmetric double-well potential. We employ the non-perturbative framework of the two-particle irreducible (2PI) quantum effective action at next-to-leading order in a large-N expansion.
  arXiv  Detail & Related papers  (2023-10-06T12:44:48Z)
• Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
  "Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
  arXiv  Detail & Related papers  (2023-07-06T17:54:08Z)
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization [11.445200448951072]
  Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm. We demonstrate that the intuition from the adiabatic algorithm applies to the task of choosing the QAOA initial state.
  arXiv  Detail & Related papers  (2023-05-05T21:54:28Z)
• Quantum annealing showing an exponentially small success probability despite a constant energy gap with polynomial energy [0.0]
  Adiabatic condition consists of two parts: an energy gap and a transition matrix. The success probability of QA is considered to decrease exponentially owing to the exponentially decreasing energy gap. We numerically show the scaling of the computational cost is quadratically improved compared to the conventional QA.
  arXiv  Detail & Related papers  (2022-12-20T04:43:40Z)
• Quantum annealing with symmetric subspaces [0.0]
  We propose a drive Hamiltonian that preserves the symmetry of the problem Hamiltonian for more efficient Quantum annealing (QA) As non-adiabatic transitions occur only inside the specific subspace, our approach can potentially suppress unwanted non-adiabatic transitions. We find that our scheme outperforms the conventional scheme in terms of the fidelity between the target ground state and the states after QA.
  arXiv  Detail & Related papers  (2022-09-20T09:44:23Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• A shortcut to adiabaticity in a cavity with a moving mirror [58.720142291102135]
  We describe for the first time how to implement shortcuts to adiabaticity in quantum field theory. The shortcuts take place whenever there is no dynamical Casimir effect. We obtain a fundamental limit for the efficiency of an Otto cycle with the quantum field as a working system.
  arXiv  Detail & Related papers  (2022-02-01T20:40:57Z)
• Shortcuts to Quantum Approximate Optimization Algorithm [2.150418646956503]
  We propose a new ansatz dubbed as "Shortcuts to QAOA" (S-QAOA) S-QAOA provides shortcuts to the ground state of target Hamiltonian by including more two-body interactions and releasing the parameter freedoms. Considering the MaxCut problem and Sherrington-Kirkpatrick (SK) model, numerically shows the YY interaction has the best performance.
  arXiv  Detail & Related papers  (2021-12-21T02:24:19Z)
• Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian [3.800391908440439]
  We show an analytical solution for a problem for an arbitrary $H_I$ beyond the adiabatic limit for Quantum Annealing (QA) computing. This solution provides insights into the accuracy of nonadiabatic computations.
  arXiv  Detail & Related papers  (2021-10-24T05:36:27Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.