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

Physics of Particles and Nuclei

Quantum Approximation Optimization Algorithm for the Ising Model in an External Magnetic Field

Yu. G. Palii, Alla A. Bogolubskaya, Denis A. Yanovich

Published Jun 1, 2024• 2 citations
Publisher

Abstract

Abstract A representation of the Ising model in a longitudinal magnetic field on a quantum computer is introduced. The ansatz of the wave function of the model for a quantum approximation optimization algorithm is constructed. The scheme and the result of its operation for a lattice of size 2 × 2 are presented.
DOI
10.1134/s106377962403064x

Related papers

Simulating QAOA operation using Cirq and qsim quantum frameworks

Yuri Palii, Alla A. Bogolubskaya, Denis A. Yanovich

The problem of finding the lowest-energy state in the Ising model with a longitudinal magnetic field is studied for two- and three-dimensional lattices of various sizes using the Quantum Approximate Optimization Algorithm (QAOA). The basis states of the quantum computer register correspond to spin configurations on a spatial lattice, and the Hamiltonian of the model is implemented using a sequence of quantum gates. The average energy value is efficiently measured using the Hadamard test. We simulate the QAOA operation on increasingly complex lattice configurations using the software libraries Cirq and qsim. The results of optimization, obtained using gradient-based and gradient-free methods, demonstrate the superiority of the latter in both modeling performance and quantum computer usage. Key arguments in favor of the advantages of quantum computation for this problem are presented.

Вестник Российского университета дружбы народов. Серия: Математика, информатика, физика•Dec 7, 2025•0 citations

Simulation of the QAOA Algorithm at the JINR Quantum Testbed

Yu. G. Palii, D. V. Belyakov, Alla A. Bogolubskaya +2 more

Abstract Simulation of the Quantum Approximate Optimization Algorithm (QAOA) was performed using the Cirq software library installed on the HybriLIT quantum computing testbed at JINR. The problem of finding the lowest energy state for the Ising model with a longitudinal magnetic field was solved for two- and three-dimensional lattices of various sizes. Quantum circuits with registers up to 27 qubits were investigated during the study. Optimization of the variational ansatz parameters was carried out using both gradient-based and gradient-free methods. The processes and results of optimization carried out by various methods were compared by a number of parameters.The influence of the configuration of the computing resources used on the efficiency of calculations has been demonstrated.

Physics of Particles and Nuclei•Aug 1, 2025•1 citation

Construction of an approximate solution for an Ising magnet in an external magnetic field

S. V. Semkin, Виктор Павлович Смагин, Elena G. Lavrushina

A method of approximate calculation of the magnetization of an Ising magnet located in an external magnetic field is proposed. This method is based on using an exact or approximate expression for the spontaneous magnetization of an Ising magnet on the same lattice. The method uses the ratio of effective fields for clusters of one and two lattice nodes. Using the proposed method for a magnet located in an external field, the dependence of magnetization on temperature and the magnitude of the external field is calculated. The proposed method is applied in the work to the solution in the mean field approximation, to the solution in the Beta approximation and to the exact solution on a square lattice; for all these solutions, critical indices characterizing the behavior of a magnet in an external field are calculated. Keywords: the Ising model, phase transitions, the influence of an external field.

Physics of the Solid State•Jan 1, 2023•0 citations

Quantum algorithm for an additive approximation of Ising partition functions

Akira Matsuo, Keisuke Fujii, Nobuyuki Imoto

We investigate quantum-computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by M. Van den Nest, W. D\"ur, and H. J. Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurement-based quantum computation (MBQC). We specify an algorithmic domain, on which the proposed algorithm works, and an approximation scale, which determines the accuracy of the approximation. We show that the proposed algorithm performs a nontrivial task, which would be intractable on any classical computer, by showing that the problem that is solvable by the proposed quantum algorithm is BQP-complete. In the construction of the BQP-complete problem coupling strengths and magnetic fields take complex values. However, the Ising models that are of central interest in statistical physics and computer science consist of real coupling strengths and magnetic fields. Thus we extend the algorithmic domain of the proposed algorithm to such a real physical parameter region and calculate the approximation scale explicitly. We found that the overlap mapping and its MBQC interpretation improve the approximation scale exponentially compared to a straightforward constant-depth quantum algorithm. On the other hand, the proposed quantum algorithm also provides partial evidence that there exist no efficient classical algorithm for a multiplicative approximation of the Ising partition functions even on the square lattice. This result supports the observation that the proposed quantum algorithm also performs a nontrivial task in the physical parameter region.

arXiv:1405.2749•Physical Review A•Aug 5, 2014•18 citations

Approximate thermodynamics of the two-dimensional Ising model in an external magnetic field

Mathieu Gaudreault

Abstract We introduce approximate expressions for the thermodynamics of the two-dimensional Ising model in an external magnetic field. The external field breaks the system’s symmetry, which complicates the exact calculation of the free energy. To address this, we write the model in its quaternion representation to apply a small angle approximation with respect to a reference frame. The approximation simplifies the transfer matrix to a centrosymmetric matrix for which the largest eigenvalue is known and depends on the external field strength. We therefore write an approximate expression for the system’s free energy and derive the magnetization, susceptibility, internal energy, and specific heat. These results are compared with numerical simulations performed with the BKL algorithm. We find that the approximate expressions and numerical simulations agree in regions where the approximation is valid.

arXiv:2607.16735•Journal of Physics A Mathematical and Theoretical•Apr 15, 2025•0 citations

Simulating Ising spin glasses on a quantum computer

Daniel A. Lidar, Ofer Biham

A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down nor gets stuck in local minima. The algorithm can be applied in any dimension, to a class of spin-glass Ising models with a finite portion of frustrated plaquettes, diluted Ising models, and models with a magnetic field.

arXiv:quant-ph/9611038•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Sep 1, 1997•124 citations
The problem of finding the lowest-energy state in the Ising model with a longitudinal magnetic field is studied for two- and three-dimensional lattices of various sizes using the Quantum Approximate Optimization Algorithm (QAOA). The basis states of the quantum computer register correspond to spin configurations on a spatial lattice, and the Hamiltonian of the model is implemented using a sequence of quantum gates. The average energy value is efficiently measured using the Hadamard test. We simulate the QAOA operation on increasingly complex lattice configurations using the software libraries Cirq and qsim. The results of optimization, obtained using gradient-based and gradient-free methods, demonstrate the superiority of the latter in both modeling performance and quantum computer usage. Key arguments in favor of the advantages of quantum computation for this problem are presented.
Abstract Simulation of the Quantum Approximate Optimization Algorithm (QAOA) was performed using the Cirq software library installed on the HybriLIT quantum computing testbed at JINR. The problem of finding the lowest energy state for the Ising model with a longitudinal magnetic field was solved for two- and three-dimensional lattices of various sizes. Quantum circuits with registers up to 27 qubits were investigated during the study. Optimization of the variational ansatz parameters was carried out using both gradient-based and gradient-free methods. The processes and results of optimization carried out by various methods were compared by a number of parameters.The influence of the configuration of the computing resources used on the efficiency of calculations has been demonstrated.
A method of approximate calculation of the magnetization of an Ising magnet located in an external magnetic field is proposed. This method is based on using an exact or approximate expression for the spontaneous magnetization of an Ising magnet on the same lattice. The method uses the ratio of effective fields for clusters of one and two lattice nodes. Using the proposed method for a magnet located in an external field, the dependence of magnetization on temperature and the magnitude of the external field is calculated. The proposed method is applied in the work to the solution in the mean field approximation, to the solution in the Beta approximation and to the exact solution on a square lattice; for all these solutions, critical indices characterizing the behavior of a magnet in an external field are calculated. Keywords: the Ising model, phase transitions, the influence of an external field.
We investigate quantum-computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by M. Van den Nest, W. D\"ur, and H. J. Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurement-based quantum computation (MBQC). We specify an algorithmic domain, on which the proposed algorithm works, and an approximation scale, which determines the accuracy of the approximation. We show that the proposed algorithm performs a nontrivial task, which would be intractable on any classical computer, by showing that the problem that is solvable by the proposed quantum algorithm is BQP-complete. In the construction of the BQP-complete problem coupling strengths and magnetic fields take complex values. However, the Ising models that are of central interest in statistical physics and computer science consist of real coupling strengths and magnetic fields. Thus we extend the algorithmic domain of the proposed algorithm to such a real physical parameter region and calculate the approximation scale explicitly. We found that the overlap mapping and its MBQC interpretation improve the approximation scale exponentially compared to a straightforward constant-depth quantum algorithm. On the other hand, the proposed quantum algorithm also provides partial evidence that there exist no efficient classical algorithm for a multiplicative approximation of the Ising partition functions even on the square lattice. This result supports the observation that the proposed quantum algorithm also performs a nontrivial task in the physical parameter region.
Abstract We introduce approximate expressions for the thermodynamics of the two-dimensional Ising model in an external magnetic field. The external field breaks the system’s symmetry, which complicates the exact calculation of the free energy. To address this, we write the model in its quaternion representation to apply a small angle approximation with respect to a reference frame. The approximation simplifies the transfer matrix to a centrosymmetric matrix for which the largest eigenvalue is known and depends on the external field strength. We therefore write an approximate expression for the system’s free energy and derive the magnetization, susceptibility, internal energy, and specific heat. These results are compared with numerical simulations performed with the BKL algorithm. We find that the approximate expressions and numerical simulations agree in regions where the approximation is valid.
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down nor gets stuck in local minima. The algorithm can be applied in any dimension, to a class of spin-glass Ising models with a finite portion of frustrated plaquettes, diluted Ising models, and models with a magnetic field.