<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">47507</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2025-33-4-440-460</article-id><article-id pub-id-type="edn">HYWEXV</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Physics and Astronomy</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Физика</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Simulating QAOA operation using Cirq and qsim quantum frameworks</article-title><trans-title-group xml:lang="ru"><trans-title>Моделирование работы QAOA с использованием квантовых фреймворков Cirq и qsim</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-9000-9794</contrib-id><name-alternatives><name xml:lang="en"><surname>Palii</surname><given-names>Yuri G.</given-names></name><name xml:lang="ru"><surname>Палий</surname><given-names>Ю. Г.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Senior Researcher of Laboratory of Information Technologies</p></bio><email>palii@jinr.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4356-8336</contrib-id><contrib-id contrib-id-type="scopus">6508333497</contrib-id><name-alternatives><name xml:lang="en"><surname>Bogolubskaya</surname><given-names>Alla A.</given-names></name><name xml:lang="ru"><surname>Боголюбская</surname><given-names>А. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Senior Researcher of Laboratory of Information Technologies</p></bio><email>abogol@jinr.ru</email><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Yanovich</surname><given-names>Denis A.</given-names></name><name xml:lang="ru"><surname>Янович</surname><given-names>Д. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Senior Researcher of Laboratory of Information Technologies</p></bio><email>yan@jinr.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Joint Institute for Nuclear Research</institution></aff><aff><institution xml:lang="ru">Объединённый институт ядерных исследований</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Joint Institute for Nuclear Research</institution></aff><aff><institution xml:lang="ru">Объединенный институт ядерных исследований</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-12-07" publication-format="electronic"><day>07</day><month>12</month><year>2025</year></pub-date><volume>33</volume><issue>4</issue><issue-title xml:lang="en">VOL 33, No4 (2025)</issue-title><issue-title xml:lang="ru">ТОМ 33, №4 (2025)</issue-title><fpage>440</fpage><lpage>460</lpage><history><date date-type="received" iso-8601-date="2025-12-06"><day>06</day><month>12</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Palii Y.G., Bogolubskaya A.A., Yanovich D.A.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Палий Ю.Г., Боголюбская А.А., Янович Д.А.</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Palii Y.G., Bogolubskaya A.A., Yanovich D.A.</copyright-holder><copyright-holder xml:lang="ru">Палий Ю.Г., Боголюбская А.А., Янович Д.А.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/47507">https://journals.rudn.ru/miph/article/view/47507</self-uri><abstract xml:lang="en"><p>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.</p></abstract><trans-abstract xml:lang="ru"><p>В работе рассмотрено решение задачи поиска состояния с минимальной энергией в модели Изинга с продольным магнитным полем для двух- и трёхмерных решёток различных размеров на квантовом компьютере с использованием квантового приближённого алгоритма оптимизации (QAOA). Базисные состояния квантового регистра соответствуют конфигурациям спинов на пространственной решётке, а гамильтониан модели реализуется с помощью последовательности квантовых вентилей. Среднее значение энергии эффективно измерено с помощью теста Адамара. Работа алгоритма QAOA моделируется для последовательно усложняющихся решёточных конфигураций с применением библиотек Cirq и qsim. Результаты оптимизации, проведённой градиентным и безградиентными методами, свидетельствуют о предпочтительности последних как с точки зрения моделирования работы, так и с точки зрения использования квантового компьютера. Приведены ключевые аргументы в пользу преимуществ квантовых вычислений для решения данной задачи.</p></trans-abstract><kwd-group xml:lang="en"><kwd>quantum computing</kwd><kwd>QAOA</kwd><kwd>Ising model</kwd><kwd>quantum simulation</kwd><kwd>optimization</kwd><kwd>Cirq</kwd><kwd>qsim</kwd><kwd>cuStateVec</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>квантовые вычисления</kwd><kwd>квантовый приближённый алгоритм оптимизации (QAOA)</kwd><kwd>модель Изинга</kwd><kwd>симуляция квантовых вычислений</kwd><kwd>оптимизация</kwd><kwd>Cirq</kwd><kwd>qsim</kwd><kwd>cuStateVec</kwd></kwd-group><funding-group/></article-meta><fn-group/></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Pedersen, J. W., Lamm, H., Lawrence, S. &amp; 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).</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Jordan, S. P., Lee, K. S. M. &amp; Preskill, J. Quantum Algorithms for Quantum Field Theories. Science 336, 1130-1133. doi:10.1126/science.1217069. arXiv: 1111.3633 [hep-th] (2012).</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>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).</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>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).</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Hidary, J. D. Quantum Computing: An Applied Approach 2nd. doi:10.1007/978-3-030-23927-6 (Springer Nature Switzerland AG, Cham, Switzerland, 2021).</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Farhi, E., Goldstone, J. &amp; Gutmann, S. A Quantum Approximate Optimization Algorithm 2014. arXiv: 1411.4028 [quant-ph].</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>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).</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Ozaeta, A., van Dam, W. &amp; 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).</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>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.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Bengtsson, I. &amp; Życzkowski, K. Geometry of Quantum States.Introduction to Quantum Entanglement Second. doi:10.1017/9781139030710 (Cambridge University Press, Cambridge, UK, 2017).</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Palii, Y., Bogolubskaya, A. &amp; 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).</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Belyakov, D. V., Bogolyubskaya, A. A., Zuev, M. I., Palii, Y. G., Podgajny, D. V., Streltsova, O. I. &amp; 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.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>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.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Bayraktar, H. et al. NVIDIA cuQuantum SDK, Accelerate quantum computing research 2023. arXiv: 2308.01999 [quant-ph].</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>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. &amp; Hennart, J.-P.) 51-67. doi:10.1007/978-94-015-8330-5_4 (1994).</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>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).</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Nelder, J. A. &amp; Mead, R. A simplex method for function minimization.Comput. J. 7, 308-313. doi:10.1093/comjnl/7.4.308 (1965).</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Xiang, Y., Sun, D. Y., Fan, W. &amp; 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).</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Endres, S. C., Sandrock, C. &amp; Focke, W. W. A simplicial homology algorithm for Lipschitz optimization. J. Glob. Optim. 72, 181-217. doi:10.1007/s10898-018-0645-y (2018).</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Palii,Y., Belyakov, D., Bogolubskaya, A., Zuev, M. &amp;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).</mixed-citation></ref></ref-list></back></article>
