Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2502.01008 · Journal of the Physical Society of Japan

Impact of Fixing Spins in a Quantum Annealer with Energy Rescaling

T Hattori, Hirotaka Irie, Tadashi Kadowaki, Shu Tanaka

Published Jun 11, 2025• 3 citations
arXivHTMLPDF

Abstract

Quantum annealing is a promising algorithm for solving combinatorial optimization problems. However, various hardware restrictions significantly impede its efficient performance. Size-reduction methods provide an effective approach to addressing large-scale problems but often introduce additional difficulties. A notable hardware restriction is that quantum annealing can handle only a limited number of decision variables, compared to the size of the problem. Moreover, when employing size-reduction methods, the interactions and local magnetic fields in the Ising model — used to represent the combinatorial optimization problem — can become excessively large, making them difficult to implement on hardware. Although prior studies suggest that energy rescaling impacts the performance of quantum annealing, its interplay with size-reduction methods remains unexplored. 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 while preserving the spin-chain embedding for a homogeneous, fully connected ferromagnetic Ising model.

DOI
10.7566/jpsj.94.074001

Related papers

Advantages of Fixing Spins in Quantum Annealing

T Hattori, Hirotaka Irie, Tadashi Kadowaki +1 more

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.

arXiv:2410.21924•Journal of the Physical Society of Japan•Dec 20, 2024•4 citations

Spin-Variable Reduction Method for Handling Linear Equality Constraints in Ising Machines

Tatsuhiko Shirai, Nozomu Togawa

We propose a spin-variable reduction method for Ising machines to handle linear equality constraints in a combinatorial optimization problem. Ising machines including quantum-annealing machines can effectively solve combinatorial optimization problems. They are designed to find the lowest-energy solution of a quadratic unconstrained binary optimization (QUBO), which is mapped from the combinatorial optimization problem. The proposed method reduces the number of binary variables to formulate the QUBO compared to the conventional penalty method. We demonstrate a sufficient condition to obtain the optimum of the combinatorial optimization problem in the spin-variable reduction method and its general applicability. We apply it to typical combinatorial optimization problems, such as the graph κ-partitioning problem and the quadratic assignment problem. Experiments using simulated-annealing and quantum-annealing based Ising machines demonstrate that the spin-variable reduction method outperforms the penalty method. The proposed method extends the application of Ising machines to larger-size combinatorial optimization problems with linear equality constraints.

IEEE Transactions on Computers•Jan 24, 2023•13 citations

Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines

Shuta Kikuchi, Nozomu Togawa, Shu Tanaka

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.

arXiv:2507.15544•Jul 21, 2025•5 citations

Physical Properties of Error Reduction Algorithms for Ising Machines

Kanta Hino, Shu Tanaka

Ising machines are expected to be dedicated computers that are capable of efficiently searching for good solutions to combinatorial optimization problems. When solving combinatorial optimization problems with an Ising machine, the objective function and constraints of the combinatorial optimization problems are expressed using the Ising model. Then, the low-energy states of the Ising model are searched by the internal algorithms of Ising machines. Typical internal algorithms are Simulated Annealing (SA) and Quantum Annealing (QA). Both algorithms exhibit stochastic behavior, so the final solution may contain errors. Therefore, it is an essential issue in the field of Ising machines to reduce errors as much as possible. A previous study proposed an error reduction method for QA machines, namely the Quantum Annealing Correction (QAC) model. This method reduces error by introducing penalty interaction and performing a specific decoding method. Building on these valuable insights, we proposed an alternative error reduction method, the stacked model. To verify the effectiveness, we examined on the relationship between the penalty interaction and the success probability of the QAC model and the stacked model on SA. The obtained results differ from the facts observed in QA. In summary, a decoding method different from the one considered effective in QA was found to be effective in SA. This result suggests that when considering an appropriate error reduction method, it is necessary to consider the internal algorithm of the Ising machine.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•2 citations

Breaking limitation of quantum annealer in solving optimization problems under constraints

Masayuki Ohzeki

Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called quantum annealer, using artificial spins. However, the connectivity between the artificial spins is sparse and limited on a special network known as the chimera graph. Several embedding techniques have been proposed, but the number of logical spins, which represents the optimization problems to be solved, is drastically reduced. In particular, an optimization problem including fully or even partly connected spins suffers from low embeddable size on the chimera graph. In the present study, we propose an alternative approach to solve a large-scale optimization problem on the chimera graph via a well-known method in statistical mechanics called the Hubbard-Stratonovich transformation or its variants. The proposed method can be used to deal with a fully connected Ising model without embedding on the chimera graph and leads to nontrivial results of the optimization problem. We tested the proposed method with a number of partition problems involving solving linear equations and the traffic flow optimization problem in Sendai and Kyoto cities in Japan.

arXiv:2002.05298•Scientific Reports•Feb 20, 2020•73 citations

Hybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer

Shuta Kikuchi, Nozomu Togawa, Shu Tanaka

Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines (non-quantum-type Ising machines) and quantum-annealing-based Ising machines (quantum annealers). Herein we propose a hybrid optimization method, which utilizes the advantages of both types. In this hybrid optimization method, the preprocessing step is performed by solving the non-quantum-annealing Ising machine multiple times. Then sub-Ising models with a reduced size by spin fixing are solved using a quantum annealer. The performance of the hybrid optimization method is evaluated via simulations using Simulated Annealing (SA) as a non-quantum-type Ising machine and D-Wave Advantage as a quantum annealer. Additionally, we investigate the parameter dependence of the proposed hybrid optimization method. The hybrid optimization method outperforms the preprocessing SA and the quantum annealing machine alone in fully connected random Ising models.

arXiv:2306.06589•Journal of the Physical Society of Japan•Nov 10, 2023•8 citations
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. However, various hardware restrictions significantly impede its efficient performance. Size-reduction methods provide an effective approach to addressing large-scale problems but often introduce additional difficulties. A notable hardware restriction is that quantum annealing can handle only a limited number of decision variables, compared to the size of the problem. Moreover, when employing size-reduction methods, the interactions and local magnetic fields in the Ising model — used to represent the combinatorial optimization problem — can become excessively large, making them difficult to implement on hardware. Although prior studies suggest that energy rescaling impacts the performance of quantum annealing, its interplay with size-reduction methods remains unexplored. 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 while preserving the spin-chain embedding for a homogeneous, fully connected ferromagnetic Ising model.
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.
We propose a spin-variable reduction method for Ising machines to handle linear equality constraints in a combinatorial optimization problem. Ising machines including quantum-annealing machines can effectively solve combinatorial optimization problems. They are designed to find the lowest-energy solution of a quadratic unconstrained binary optimization (QUBO), which is mapped from the combinatorial optimization problem. The proposed method reduces the number of binary variables to formulate the QUBO compared to the conventional penalty method. We demonstrate a sufficient condition to obtain the optimum of the combinatorial optimization problem in the spin-variable reduction method and its general applicability. We apply it to typical combinatorial optimization problems, such as the graph κ-partitioning problem and the quadratic assignment problem. Experiments using simulated-annealing and quantum-annealing based Ising machines demonstrate that the spin-variable reduction method outperforms the penalty method. The proposed method extends the application of Ising machines to larger-size combinatorial optimization problems with linear equality constraints.
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.
Ising machines are expected to be dedicated computers that are capable of efficiently searching for good solutions to combinatorial optimization problems. When solving combinatorial optimization problems with an Ising machine, the objective function and constraints of the combinatorial optimization problems are expressed using the Ising model. Then, the low-energy states of the Ising model are searched by the internal algorithms of Ising machines. Typical internal algorithms are Simulated Annealing (SA) and Quantum Annealing (QA). Both algorithms exhibit stochastic behavior, so the final solution may contain errors. Therefore, it is an essential issue in the field of Ising machines to reduce errors as much as possible. A previous study proposed an error reduction method for QA machines, namely the Quantum Annealing Correction (QAC) model. This method reduces error by introducing penalty interaction and performing a specific decoding method. Building on these valuable insights, we proposed an alternative error reduction method, the stacked model. To verify the effectiveness, we examined on the relationship between the penalty interaction and the success probability of the QAC model and the stacked model on SA. The obtained results differ from the facts observed in QA. In summary, a decoding method different from the one considered effective in QA was found to be effective in SA. This result suggests that when considering an appropriate error reduction method, it is necessary to consider the internal algorithm of the Ising machine.
Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called quantum annealer, using artificial spins. However, the connectivity between the artificial spins is sparse and limited on a special network known as the chimera graph. Several embedding techniques have been proposed, but the number of logical spins, which represents the optimization problems to be solved, is drastically reduced. In particular, an optimization problem including fully or even partly connected spins suffers from low embeddable size on the chimera graph. In the present study, we propose an alternative approach to solve a large-scale optimization problem on the chimera graph via a well-known method in statistical mechanics called the Hubbard-Stratonovich transformation or its variants. The proposed method can be used to deal with a fully connected Ising model without embedding on the chimera graph and leads to nontrivial results of the optimization problem. We tested the proposed method with a number of partition problems involving solving linear equations and the traffic flow optimization problem in Sendai and Kyoto cities in Japan.
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines (non-quantum-type Ising machines) and quantum-annealing-based Ising machines (quantum annealers). Herein we propose a hybrid optimization method, which utilizes the advantages of both types. In this hybrid optimization method, the preprocessing step is performed by solving the non-quantum-annealing Ising machine multiple times. Then sub-Ising models with a reduced size by spin fixing are solved using a quantum annealer. The performance of the hybrid optimization method is evaluated via simulations using Simulated Annealing (SA) as a non-quantum-type Ising machine and D-Wave Advantage as a quantum annealer. Additionally, we investigate the parameter dependence of the proposed hybrid optimization method. The hybrid optimization method outperforms the preprocessing SA and the quantum annealing machine alone in fully connected random Ising models.