Advantages of fixing spins in quantum annealing

• URL: http://arxiv.org/abs/2410.21924v2
• Date: Wed, 25 Dec 2024 07:44:00 GMT
• Title: Advantages of fixing spins in quantum annealing
• Authors: Tomohiro Hattori, Hirotaka Irie, Tadashi Kadowaki, Shu Tanaka,
• Abstract summary: Size-reduction methods are used to treat large-scale optimization problems that cannot be input directly into a quantum annealer. Various size-reduction methods using fixing spins have been proposed as quantum-classical hybrid methods to obtain solutions.
• Score: 1.0937094979510213
• License:
• Abstract: Quantum annealing can efficiently obtain solutions to combinatorial optimization problems. Size-reduction methods are used to treat large-scale combinatorial optimization problems that cannot be input directly into a quantum annealer because of its size limitation. Various size-reduction methods using fixing spins have been proposed as quantum-classical hybrid methods to obtain solutions. However, the high performance of these hybrid methods is yet to be clearly elucidated. In this study, we adopted a parameterized fixing spins method to verify the effects of fixing spins. The results revealed that setting the appropriate number of spins of the subproblem is crucial for obtaining a satisfactory solution, and the energy gap expansion is confirmed after fixing spins.

Related papers

• Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling [1.0937094979510213]
  This study examines the relationship between fixing spins, a promising size-reduction method, and the effects of energy rescaling. Numerical simulations and experiments conducted on a quantum annealer demonstrate that the fixing spins method enhances quantum annealing performance.
  arXiv  Detail & Related papers  (2025-02-03T03:01:08Z)
• Parallel Quantum Local Search via Evolutionary Mechanism [0.9208007322096533]
  We propose an innovative Parallel Quantum Local Search (PQLS) methodology that leverages the capabilities of small-scale quantum computers. Our approach transcends this constraint by simultaneously executing multiple QLS pathways and aggregating their most effective outcomes at certain intervals to establish a generation'' Our findings demonstrate the profound impact of parallel quantum computing in enhancing the resolution of Ising problems.
  arXiv  Detail & Related papers  (2024-06-10T16:35:52Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Adiabatic Bottlenecks in Quantum Annealing and Nonequilibrium Dynamics of Paramagnons [0.0]
  Correspondence between long-range interacting quantum spin glasses and optimization problems underpins the physical motivation for adiabatic quantum computing. In disordered (quantum) spin systems, the focus is on exact methods such as the replica trick that allow the calculation of system quantities in the limit of infinite system and ensemble size. Here, we apply the nonequilibrium Green-function formalism to the spin coherent-state path integral to obtain the statistical fluctuations and the collective-excitation spectrum.
  arXiv  Detail & Related papers  (2024-03-18T07:59:46Z)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization [39.58317527488534]
  We propose a novel method for solving linear systems. We transform the linear system into a binary optimization problem, drawing inspiration from the geometry of the original problem. We demonstrate that by leveraging partial knowledge of the problem's intrinsic geometry, we can decompose the original problem into smaller, independent sub-problems.
  arXiv  Detail & Related papers  (2023-09-18T16:51:03Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Quantum annealing with twisted fields [0.0]
  We propose a method for suppressing the effects of decoherence and non-adiabatic transition. Our results can pave the way to a new approach for realizing practical quantum annealing.
  arXiv  Detail & Related papers  (2021-11-30T11:00:44Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method [64.15649345392822]
  We introduce a framework for designing primal methods under the decentralized optimization setting where local functions are smooth and strongly convex. Our approach consists of approximately solving a sequence of sub-problems induced by the accelerated augmented Lagrangian method. When coupled with accelerated gradient descent, our framework yields a novel primal algorithm whose convergence rate is optimal and matched by recently derived lower bounds.
  arXiv  Detail & Related papers  (2020-06-11T18:49:06Z)
• Breaking limitation of quantum annealer in solving optimization problems under constraints [1.14219428942199]
  We propose an alternative approach to solve a large-scale optimization problem on the chimera graph. The proposed method can be used to deal with a fully connected Ising model without embedding on the chimera graph.
  arXiv  Detail & Related papers  (2020-02-13T01:00:44Z)

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.