Simulating QAOA operation using Cirq and qsim quantum frameworks


Cite item

Full Text

Abstract

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.

About the authors

Yuri G. Palii

Joint Institute for Nuclear Research

Email: palii@jinr.ru
ORCID iD: 0000-0001-9000-9794

Candidate of Physical and Mathematical Sciences, Senior Researcher of Laboratory of Information Technologies

Russian Federation, 6 Joliot-Curie St, Dubna, 141980, Russian Federation

Alla A. Bogolubskaya

Joint Institute for Nuclear Research

Email: abogol@jinr.ru
ORCID iD: 0000-0003-4356-8336
Scopus Author ID: 6508333497

Candidate of Physical and Mathematical Sciences, Senior Researcher of Laboratory of Information Technologies

Russian Federation, 6 Joliot-Curie St, Dubna, 141980, Russian Federation

Denis A. Yanovich

Joint Institute for Nuclear Research

Author for correspondence.
Email: yan@jinr.ru

Senior Researcher of Laboratory of Information Technologies

Russian Federation, 6 Joliot-Curie St, Dubna, 141980, Russian Federation

References

  1. Pedersen, J. W., Lamm, H., Lawrence, S. & Yeter-Aydeniz, K. Quantum Simulation of Finite Temperature Schwinger Model via Quantum Imaginary Time Evolution. Phys. Rev. D 108, 114506. doi: 10.1103/PhysRevD.108.114506. arXiv: 2304.01144 [hep-lat] (2023).
  2. Jordan, S. P., Lee, K. S. M. & Preskill, J. Quantum Algorithms for Quantum Field Theories. Science 336, 1130-1133. doi: 10.1126/science.1217069. arXiv: 1111.3633 [hep-th] (2012).
  3. Abhijith, J. et al. Quantum Algorithm Implementations for Beginners. Quantum 6, 881. doi: 10.22331/q-2022-12-22-881. arXiv: 1804.03719 [cs.ET] (2022).
  4. Bharti, K. et al. Noisy intermediate-scale quantum (NISQ) algorithms. Rev. Mod. Phys. 94, 015004. doi: 10.1103/RevModPhys.94.015004. arXiv: 2101.08448 [quant-ph] (2022).
  5. Hidary, J. D. Quantum Computing: An Applied Approach 2nd. doi: 10.1007/978-3-030-23927-6 (Springer Nature Switzerland AG, Cham, Switzerland, 2021).
  6. Farhi, E., Goldstone, J. & Gutmann, S. A Quantum Approximate Optimization Algorithm 2014. arXiv: 1411.4028 [quant-ph].
  7. Lotshaw, P. C. et al. Simulations of Frustrated Ising Hamiltonians using Quantum Approximate Optimization. Phil. Trans. R. Soc. Lond. A 381, 20210414. doi: 10.1098/rsta.2021.0414. arXiv: 2206.05343 [quant-ph] (2022).
  8. Ozaeta, A., van Dam, W. & McMahon, P. L. Expectation Values from the Single-Layer Quantum Approximate Optimization Algorithm on Ising Problems. Quantum Sci. Technol. 7, 045036. doi: 10.1088/2058-9565/ac88d4. arXiv: 2012.0342 [quant-ph] (2022).
  9. AI, G. Q. Cirq: Quantum approximate optimization algorithm for the Ising model https://quantumai.google/cirq/experiments/qaoa/qaoa_ising. Accessed: 2024-04-01. 2023.
  10. Bengtsson, I. & Życzkowski, K. Geometry of Quantum States.Introduction to Quantum Entanglement Second. doi: 10.1017/9781139030710 (Cambridge University Press, Cambridge, UK, 2017).
  11. Palii, Y., Bogolubskaya, A. & Yanovich, D. Quantum Approximation Optimization Algorithm for the Ising Model in an External Magnetic Field. Phys. Part. Nucl. 55, 600-602. doi: 10.1134/S1063779624040185 (2024).
  12. Belyakov, D. V., Bogolyubskaya, A. A., Zuev, M. I., Palii, Y. G., Podgajny, D. V., Streltsova, O. I. & Yanovich, D. A. Polygon for quantum computing on the heterogeneous HybriLIT platform Russian. in Proc. of the International Conference “Information Technologies and Mathematical Methods” (ITTMM-2024) (In Russian) (2024), 303.
  13. Corporation, N. NVIDIA cuStateVec: A High-Performance Library for Quantum Circuit Simulation https://docs.nvidia.com/cuda/cuquantum/custatevec/index.html. Accessed: 2024-04-01. 2023.
  14. Bayraktar, H. et al. NVIDIA cuQuantum SDK, Accelerate quantum computing research 2023. arXiv: 2308.01999 [quant-ph].
  15. Powell, M. J. D. A direct search optimization method that models the objective and constraint functions by linear interpolation. Advances in Optimization and Numerical Analysis (eds Gomez, S. & Hennart, J.-P.) 51-67. doi: 10.1007/978-94-015-8330-5_4 (1994).
  16. Powell, M. J. D. An efficient method for finding the minimum of a function of several variables without calculating derivatives.Comput. J. 7, 155-162. doi: 10.1093/comjnl/7.2.155 (1964).
  17. Nelder, J. A. & Mead, R. A simplex method for function minimization.Comput. J. 7, 308-313. doi: 10.1093/comjnl/7.4.308 (1965).
  18. Xiang, Y., Sun, D. Y., Fan, W. & Gong, X. G. Generalized simulated annealing algorithm and its application to the Thomson model. Phys. Lett. A 233, 216-220. doi: 10.1016/S0375-9601(97)00484-1 (1997).
  19. Endres, S. C., Sandrock, C. & Focke, W. W. A simplicial homology algorithm for Lipschitz optimization. J. Glob. Optim. 72, 181-217. doi: 10.1007/s10898-018-0645-y (2018).
  20. Palii,Y., Belyakov, D., Bogolubskaya, A., Zuev, M. &Yanovich, D. Simulation of the QAOA algorithm at the JINR quantum testbed Russian. in Proc. of the International Conference “Mathematical Problems in Quantum Information Technologies” (MPQIT 2024) In press (Dubna, JINR, 2024).

Supplementary files

Supplementary Files
Action
1. JATS XML
Download