Eigenvalue-invariant transformation of Ising problem for anti-crossing mitigation in quantum annealing
Abstract
We have proposed the energy landscape transformation of Ising problems (ELTIP), which changes the combination of the state and eigenvalue without changing all the original eigenvalues [arXiv:2202.05927]. We study how the ELTIP affects the anti-crossing between two levels of the ground and first excited states during quantum annealing. We use a 5-spin maximum-weighted independent set for the problem to numerically investigate the anti-crossing. For comparison, we introduce a non-stoquastic Hamiltonian that adds antiferromagnetic interaction to the normal transverse magnetic field. Annealing with the non-stoquastic Hamiltonian is effective for difficult problems. The non-stoquastic Hamiltonian mitigates the anti-crossing when only the energy gap between the ground state and the first excited state of the final state is small. When the ELTIP is used, the anti-crossing disappears. For the problems investigated in this paper, the ELTIP shortens the annealing time to guarantee adiabatic change more than the non-stoquastic Hamiltonian.
I Introduction
Quantum annealing [1, 2, 3, 4, 5] (QA) is a promising method for solving computationally difficult problems using adiabatic changes, and many examples of industrial applications using actual machines have already been reported. Many references are found in Yarnoki et al [6]. It has also been shown theoretically that the time required for convergence is shorter than simulated annealing [7]. Quantum logic gate devices are in the “noisy intermediate-scale quantum” (NISQ) era and quantum devices of quantum annealer are no exception [8, 9]. It is not realistic to perform QA for a time that is theoretically sufficient for convergence. Instead, various speed-up methods have been proposed to overcome noise limits in both QA and NISQ gate-based devices [10].
The difficulty level of the Ising problem is well known. Various methods using special driving Hamiltonians and/or annealing schedule modification have been proposed to mitigate the difficulty level, and some of them have been demonstrated on the quantum annealing hardware D-Wave [11, 12, 13, 14, 15, 16, 17, 18, 19]. Especially, non-stoquastic Hamiltonians [16, 17, 18, 19] that positively use the quantum property of QA have been shown to be effective for difficult problems [20]. Although the non-stoquastic Hamiltonians have a potential to improve the convergence of the QA computing, they are not easy to introduce to QA machines[21].
In computer science, it has been shown that the Ising problem with randomly generated coefficients becomes NP-hard [22]. However, in the case of limited number of spins which can be simulated by current computers, the probability that it is a difficult problem for non-stoquastic QA was less than 1/1000 in randomly generated 20-spin MAX 2-SAT problems [20]. Therefore, designed problems like meticulously parameter-tuned maximum-weighted independent set (MIS) problems [23, 24] should be used to analyze mitigation effect in QA.
Theoretically, the required annealing time to obtain the smallest energy state (most optimal answer) can be represented by the adiabatic condition [3]. The adiabatic condition indicates that the ratio of the maximum time derivation of the Hamiltonian and the minimum of the square of the inverse spectral gap must be small enough for adiabatic computing. Amin has approximated the adiabatic condition by the energy gap of the ground and first states which mostly affect the adiabatic evolution [25, 26]. The approximate and rigorous versions of the adiabatic theorems are summarized in the literature [4]. Choi has given a theorem based on the approximated condition to assess the performance of a QA algorithm [24], including non-stoquastic Hamiltonians [27]. The theorem relates the minimum spectral gap (min-gap) and the presence or absence of an anti-crossing during quantum evolution [2]. MIS problems [23] are used to justify the theorem. Here, the anti-crossing is identified as “the local minimum in the plot of the instantaneous energy gap as a function of time” as in the work by Hormozi, et al [17]. Braida and Martiel have expanded Choi’s theorem to give a more general expression of anti-crossing [28]. The study of a specific combinatorial problem called weighted max k-clique is shown by using the driver. The above theorems aim to analyze the mechanism of the anti-crossing, not to improve the convergence of QA.
We propose a method to mitigate the approximated adiabatic condition (thus mitigating the anti-crossing) in the quantum evolution of Ising problems with a smaller number of spins. The method uses ancilla spins to transform the energy landscape of the Ising problems, and is termed the energy landscape transformation of Ising problem (ELTIP) [29]. This paper shows that the ELTIP is also explained using controlled-NOT (CNOT), gates. We numerically show that the ELTIP-transformed problem Hamiltonian is stable for not only the larger degree, but also the small degree of anti-crossing, compared to the non-stoquastic Hamiltonians which are effective only for the larger degree of anti-crossing. Our method can be realized with the driver which is commonly used in QA machines. Dickson has proposed a method changing the degeneracy of the spectrum of the final Hamiltonian [30]. In contrast, the ELTIP does not change degeneracy nor any eigenvalues. Note that the ELTIP changes the interaction between spins, thus it cannot be used for analysis of physical phenomena of the original quantum evolution. In this paper, the ELTIP is applied to the 5-spin MIS problems, allowing us to show the effectiveness of the ELTIP more clearly than with fully connected models [29]. Moreover, discussions based on the min-gap and the anti-crossing are given.
II Annealing time and anti-crossing
We review the approximate version of the adiabatic theorem and the relation between the min-gap and the anti-crossing [2, 24, 28].
II.1 Approximate version of adiabatic theorem and Ising problem
The annealing time evolution equation is usually expressed using the adimensional time , where and denote time and total annealing time, respectively. A QA problem of an spin system can be expressed as the following equation [1]:
(1) |
In QA, is a transverse magnetic field added by the Pauli -matrix as
(2) |
Equation (1) using Eq. (2) is called stoquastic quantum annealing. Here, the problem Hamiltonian is expressed by the Ising coefficients as
(3) |
Equation (3) consists of the two-spin interaction coefficient and the longitudinal magnetic field interaction coefficient .
It is well known that Quadratic Unconstrained Binary Optimization (QUBO) problems are encoded by Ising Hamiltonians. The Ising energy can be written by QUBO variables instead of Ising spin variables :
(4) | |||||
When we use QUBO coefficients and instead of Ising coefficients, is rewritten by:
(5) |
where const. is
(6) |
The quantum adiabatic theorem characterizes the sufficiently slow rate required for evolution to move from the initial ground state to the final ground state by giving a lower bound on the total time [2]:
(7) |
where and called “min-gap”. and denote the eigenvalues of the ground state and the first excited state , respectively. They can be directly calculated from . On the other hand, is defined as the final ground state obtained by Eq. (1), which depends on total annealing time . When total annealing time in Eq. (1) is longer than , can make arbitrarily close to 1 [2]. For all of the problems that we simulate in Sec. 4, is of order a typical eigenvalue of and is not too big, so the size of is governed by . We use the approximated annealing time for order-of-magnitude estimate.
II.2 Anti-crossings
Anti-crossings are useful for the analysis of physical phenomena happening during QA, and are the specific behavior of the two lowest eigenvalues when the min-gap occurs around the anti-crossing point [31]:
(8) |
where and are the difference and the mean of the slopes of the asymptotes of the hyperbola, respectively. An anti-crossing at a first-order phase transition during the evolution occurs in the presence of an exponentially small min-gap. Choi has suggested a new parametrization of the physical phenomenon to study the occurrence of anti-crossings during adiabatic quantum computation [24]. Recently, Choi has applied parametrization to non-stoquastic quantum annealing [27]. Braida and Martiel have suggested another expression of the min-gap that is more general [28]. In Sec. 4, the min-gaps before/after the ELTIP are discussed.
We express the square of coefficients of the instantaneous eigenstates in terms of the eigenstates of the final Hamiltonian [24]:
(9) |
That is, the square of a coefficient of the instantaneous ground state is the weight (or overlap) of the solution state with the instantaneous ground state at time . Similarly, is the weight (or overlap) of the first excited state (which possibly corresponds to the local minima of the problem) with the instantaneous ground state at time . At , we have and . We use min-gaps to evaluate the effectiveness of the ELTIP. We also observe the time evolution of and , which has the correlation to min-gaps.
II.3 Non-stoquastic Hamiltonian
We use the non-stoquastic Hamiltonian [16, 17, 18, 19] for comparison. The annealing Hamiltonian including the non-stoquastic Hamiltonian introduced by Seki and Nishimori [16] is expressed as
(10) |
where denotes the antiferromagnetic interaction which has a two-spin flip effect:
(11) |
The initial Hamiltonian has and is arbitrary, and the final one has .
III Eigenvalue-invariant transformation of Ising problem
Since eigenvalues of a Hamiltonian are invariant under any unitary transformation, it is possible to choose a basis other than the computational basis to represent solution candidates of the Ising problem, even though it leads to a different physical structure from the original one. Here, we consider unitary transformations consisting of CNOT gates, shown in Fig. 1,
(12) | |||||
[row sep=5mm,between origins]
\lstick
&\ctrl1 \ctrl2 \qw\ctrl4 \qw
\lstick[wires=4]
\targ1 \qw\qw\qw\qw
\qw\targ1 \qw\qw\qw
⋮
\qw\qw\qw\targ1 \qw
Due to the anti-commutation of and , the Pauli operators are exchanged as follows:
(13) | |||||
(14) |
and leaves the following unchanged:
(15) | |||||
(16) |
Applying the unitary transformations Eq. (12) to the original Ising Hamiltonian Eq. (3) yields Ising Hamiltonians , i.e.
(17) |
where the role of coefficients of second order terms and first order terms for are exchanged [29]. By this transformation, the energy gap of the ground state and the first excited state, during the adiabatic evolution or quantum annealing process, can be altered. Therein lies the potential to alleviate the problem. Due to the unitary invariance, once one of these problems represented by is solved to give the ground state , we have the ground state of the original problem by (classical) calculation of .
Note that repetition of the CNOT Eq. (12) yields , which means the repeated application of the CNOT results in at most a single and worthless SWAPs.
IV Time evolution of problems with anti-crossing
IV.1 Design of problems with anti-crossing by maximum-weighted independent set (MIS)
The connection between local minima in the problem Hamiltonian designed by MIS and first order quantum phase transitions (QPT) during an adiabatic quantum computation was investigated by Amin and Choi [25, 26]. QPT can be easily generated by using the balance of the MIS to make the eigenvalues of the ground state and the first excited state closer together and to separate the eigenvalues of the other states [25, 26]. Therefore, we use the MIS to design problems that cause QPT and use it for anti-crossing mitigation effect evaluation.
We use the 5-spin MIS problems [24] to compare the effectiveness of the non-stoquastic Hamiltonian and the ELTIP because of the design simplicity and good visibility of numerical results. An MIS problem shown in Fig. 2(a) is used to demonstrate the effectiveness of the ELTIP.

Coeff. type | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
QUBO | 6.08 | 0 | 0 | 0 | 6.08 | 0 | 0 | 6.08 | 0 | 6.08 | -4 | -5.96 | -4 | -6 | -4 |
Ising | 1.52 | 0 | 0 | 0 | 1.52 | 0 | 0 | 1.52 | 0 | 1.52 | -0.48 | 0.06 | 1.04 | 0.04 | -0.48 |
Ising | 0.06 | 1.04 | 0.04 | -0.48 | 1.52 | 0 | 0 | 1.52 | 0 | 1.52 | -0.48 | 1.52 | 0 | 0 | 0 |
QUBO | 0.24 | 4.16 | 0.16 | -1.92 | 6.08 | 0 | 0 | 6.08 | 0 | 6.08 | -2.28 | -0.12 | -8.16 | -6.16 | -2.08 |


As an MIS problem, only the weights are important, but the coupling constants of 6.08 in Fig. 2(a) are not important. In other words, the problem with the other coupling constants can be regarded as the same MIS. However, whole energy landscapes are changed by the coupling constants, which affects QA time evolution. Therefore, the coupling constants must be fixed for the evaluation of QA time evolution and conversion. Figure 2(a) is designed to generate the anti-crossing between the ground and the first states, referred to in Ref [24]. Note that Ref [24] describes the MIS problems by the QUBO form, therefore Fig. 2(a) is denoted by the QUBO form. The ELTIP of in Eq. (17) is applied to the problem shown in Fig. 2(a), and a transformed problem is shown in Fig. 2(b). Compared with the original problem in Fig. 2(a), the transformed problem in Fig. 2(b) has additional edges. From the viewpoint of obtaining the lowest eigenvalue and state, the problem transformed by the ELTIP is equivalent to the problem before transformation. Note that the ELTIP changes the physical picture. Therefore, the ELTIP can reduce the difficulty of solving the Ising problems with QA, while it cannot be used to analyze the physical phenomena in the original problems.
The QUBO and corresponding Ising coefficients with the ELTIP process are summarized in Table. 1. The ELTIP can be used for Ising problems. Therefore, once the original QUBO problem is written in the Ising problem (the first line to the second line in Table. 1), then the ELTIP is applied to the Ising problem (the second line to the third line in Table. 1). Finally, the Ising coefficient with the ELTIP is converted to the QUBO form (the third line to the fourth line in Table. 1).
Figure 2(a) and the first line in Table. 1, are an example in the case of . It is well known that the energy landscape affects the convergence of annealing. By changing , the energy landscape almost remains, but the energy gap between the final ground state and the final first excited state is tunable. Problems of will be simulated in the next subsection.
IV.2 Min-gaps of MIS problems
The energy gaps of the problems are shown in Fig. 3, where the energy gaps are . We compare time evolution of the stoquastic quantum annealing, the non-stoquastic quantum annealing, and the stoquastic quantum annealing with the ELTIP transformation. is defined as when the min-gap occurs. is called the final gap, which equals to . In the case of the stoquastic quantum annealing, the reduction of min-gap is much larger than that of the final gap. As the final gap decreases, approaches the final state. In the case of the non-stoquastic quantum annealing, the reduction of min-gap is not proportional to that of final gap. The non-stoquastic quantum annealing effectively mitigates the anti-crossing for the smallest final gap. However, as the final gap increases, the mitigation of the anti-crossing is reduced. For the largest final gap in our case, the anti-crossing is enhanced, although is not so changed. As shown in Fig. 3(c), the ELTIP eliminates the anti-crossing for all the final gaps. The min-gap is achieved near the end of the annealing, in all the final gaps.
IV.3 Time evolution of instantaneous ground state
According to Eq. (7), the approximated annealing time determines the lower limit of the annealing time. We compared the time evolution of in the original and the transformed problems as shown in Fig. 4. Left and right plots are the instantaneous ground state represented by the final eigenstates with the final gap of 0.01 and 0.08, respectively. Figures 4(a) and 4(b) are the stoquastic annealing time evolution. For both energy gaps, near where anti-crossing occurs, the population ratios of the ground state and the first excited state are rapidly switched. The switching speed, namely spin-polarity flipping speed of the final gap 0.01 is much faster than that of 0.08. A wider gap weakens the flipping speed which is one of the characteristics of QPT. In the case of the non-stoquastic Hamiltonian in Fig. 4(c), the rapid transition from the first excited state to the ground state in Fig. 4(a) is obviously mitigated. On the other hand, in Fig. 4(d), the slope around becomes steeper than that of Fig. 4(b) of the stoquastic annealing. defined in Sec. 2.1 in the case of the non-stoquastic Hamiltonian with is 10 times longer than the stoquastic Hamiltonian, and is almost comparable to the case when of the non-stoquastic Hamiltonian. The ELTIP shortens of all the problems where the anti-crossing occurs. As a result, the ELTIP eliminates the rapid population inversion between the ground state and the first excited state which is observed in QPT. The ELTIP reduced the approximated annealing time by a factor of with and with . The rest of four ELTIPs to shows similar results.
V Summary
We have proposed a method called ELTIP to mitigate the anti-crossing in QA, and have investigated its effectiveness numerically. The 5-spin QUBO problem using the MIS allows the adjustment of the size of the gap between the ground state and the first excited state while keeping the entire energy landscape. We also introduce a non-stoquastic Hamiltonian to the normal transverse magnetic field. Compared to the stoquastic Hamiltonian, the non-stoquastic Hamiltonian shortens the approximated annealing time by a factor of with the MIS problem of the final gap which equals to . As the final gap of the original problem becomes larger, that is, as the problem becomes easier, the effect of shortening the annealing time is reduced. It can be found that the non-stoquastic Hamiltonian narrows the min-gap more than 10 times in the problems with the largest final gap of 0.08. The ELTIP eliminates the anti-crossing and also reduces the transition rate from the instant first excited state to the instant ground state. The ELTIP shortens the approximated annealing time by a factor of from to in all the cases. Due to the unitary invariance, once Ising problems transformed by the ELTIP is solved to give the ground state , we have the ground state of the original problem by calculation of . The ELTIP is effective for practical optimization problems embedded in QUBO or Ising problems, because only the lowest state and eigenvalues of the problems are important. In this paper, a clear effect was observed in the 5-spin MIS problem, where the min-gap constriction effect is easy to see. In the future, a variety of trials for problems with different energy landscapes and large spin counts will be required to confirm the effectiveness of our proposed method.
Acknowledgment
The authors thank Haruki Maeda for usefull discussions on anti-crossings in QA problems. The authors thank Juan Ivaldi for his helpful advice on understanding and representing physical phenomena.
References
- Kadowaki and Nishimori [1998] T. Kadowaki and H. Nishimori, Phys. Rev. E 58, 5355 (1998).
- Farhi et al. [2000] E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, e-print arXiv:quant-ph/0001106 (2000).
- Morita and Nishimori [2008] S. Morita and H. Nishimori, J. Math. Phys. 49, 125210 (2008).
- Albash and Lidar [2018] T. Albash and D. A. Lidar, Rev. Mod. Phys. 90, 015002 (2018).
- Hauke et al. [2020] P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Rep. Prog. Phys. 83, 054401 (2020).
- Yarkoni et al. [2022] S. Yarkoni, E. Raponi, T. Back, and S. Schmitt, e-print arXiv:2112.07491 (2022).
- Morita and Nishimori [2007] S. Morita and H. Nishimori, J. Phys. Soc. Jpn. 76, 064002 (2007).
- Preskill [2018] J. Preskill, Quantum 2, 79 (2018).
- Bharti et al. [2022] K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, W.-K. Mok, S. Sim, L.-C. Kwek, and A. Aspuru-Guzik, Rev. Mod. Phys. 94, 79 (2022).
- Crosson and Lider [2021] E. J. Crosson and D. A. Lider, Nat. Rev. Phys. 3, 466 (2021).
- Dickson and Amin [2012] N. G. Dickson and M. H. Amin, Phys. Rev. A 85, 032303 (2012).
- Lanting et al. [2017] T. Lanting, A. D. King, B. Evert, and E. Hoskinson, Phys. Rev. A 96, 042322 (2017).
- Könz et al. [2019] M. S. Könz, G. Mazzola, A. J. Ochoa, H. G. Katzgraber, and M. Troyer, Phys. Rev. A 100, 030303(R) (2019).
- Marshall et al. [2019] J. Marshall, D. Venturelli, I. Hen, and E. G. Rieffel, Phys. Rev. Appl. 11, 044083 (2019).
- Chen and Lidar [2020] H. Chen and D. A. Lidar, Phys. Rev. Appl. 14, 014100 (2020).
- Seki and Nishimori [2012] Y. Seki and H. Nishimori, Phys. Rev. E 85, 051112 (2012).
- Hormozi et al. [2017] L. Hormozi, E. W. Brown, G. Carleo, and M. Troyer, Phys. Rev. B 95, 184416 (2017).
- Nishimori and Takada [2017] H. Nishimori and K. Takada, Frontiers in ICT 4, 2 (2017).
- Ohzeki [2017] M. Ohzeki, Sci. Rep. 7, 41186 (2017).
- Crosson et al. [2014] E. Crosson, E. Farhi, C. Lin, H.-H. Lin, and P. Shor, e-print arXiv:1401.7320 (2014).
- Mandrà et al. [2017] S. Mandrà, Z. Zhu, and H. G. Katzgraber, Phys. Rev. Lett. 118, 070502 (2017).
- Barahona [1982] F. Barahona, J. Phys. A: Math. Gen. 15, 3241 (1982).
- Choi [2008] V. Choi, Quantum Inf. Process. 7, 193 (2008).
- Choi [2020] V. Choi, Quantum Inf. Process. 19, 90 (2020).
- Amin [2009] M. H. S. Amin, Phys. Rev. Lett. 1102, 220401 (2009).
- Amin and Choi [2009] M. H. S. Amin and V. Choi, Phys. Rev. A 80, 062326 (2009).
- Choi [2022] V. Choi, e-print arXiv:2105.02110v2 (2022).
- Braida and Martiel [2021] A. Braida and S. Martiel, Quantum Inf. Process. 20, 260 (2021).
- Fujii et al. [2022] T. Fujii, K. Komuro, Y. Okudaira, R. Narita, and M. Sawada, e-print arXiv:2202.05927v1 (2022).
- Dickson [2011] N. G. Dickson, New J. Phys. 13, 073011 (2011).
- Wilkinson [1989] M. Wilkinson, J. Phys. A: Mathematical and General 22, 2795 (1989).