<?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="oration" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Informacionnye Tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Informacionnye Tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Информационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">1684-6400</issn><publisher><publisher-name xml:lang="en">New Technologies Publishing House</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">702327</article-id><article-id pub-id-type="doi">10.17587/it.30.584-594</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</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>Conference Report, Theses of Report</subject></subj-group></article-categories><title-group><article-title xml:lang="en">A QSimulator quantum programming system</article-title><trans-title-group xml:lang="ru"><trans-title>Система квантового программирования <italic>QSimulator</italic></trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Stepanenko</surname><given-names>K. 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>Postgraduate</p></bio><bio xml:lang="ru"><p>аспирант</p></bio><email>kiri2l.stepanenk0@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Shorina</surname><given-names>O. 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>Postgraduate</p></bio><bio xml:lang="ru"><p>аспирант</p></bio><email>olga.shorina27@gmail.com</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Kazan (Volga region) Federal University</institution></aff><aff><institution xml:lang="ru">Казанский (Приволжский) федеральный университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2024-11-15" publication-format="electronic"><day>15</day><month>11</month><year>2024</year></pub-date><volume>30</volume><issue>11</issue><issue-title xml:lang="ru">Информационные технологии</issue-title><fpage>584</fpage><lpage>594</lpage><history><date date-type="received" iso-8601-date="2026-02-07"><day>07</day><month>02</month><year>2026</year></date><date date-type="accepted" iso-8601-date="2026-02-07"><day>07</day><month>02</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, Informacionnye Tehnologii</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024, Информационные технологии</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">Informacionnye Tehnologii</copyright-holder><copyright-holder xml:lang="ru">Информационные технологии</copyright-holder></permissions><self-uri xlink:href="https://journals.eco-vector.com/1684-6400/article/view/702327">https://journals.eco-vector.com/1684-6400/article/view/702327</self-uri><abstract xml:lang="en"><p>In this paper the authors propose their own QSimulator quantum programming system, which is a software tool for developing and debugging quantum algorithms in a high-level C++ language. The basic structure of the presented system is described, including quantum algorithms and quantum operations, available to the programmer. The components of the system and their fundamental basis are briefly outlined. This system emulates the behaviour of a quantum coprocessor in a standard computational basis and thus can be used for debugging and programming quantum algorithms in the language of quantum circuits. The system proposed by the authors also implements the Grover search algorithm and the Durr-Hoyer minimization algorithm based on it. Many tasks can be formulated in terms of the search task. In particular, the SAT problem. In this article, we also propose a variant of constructing an oracle in the form of a quantum circuit for the SAT problem, which can be integrated into the Grover algorithm implemented in the presented system. Automatic oracle generation for the SAT task will help save time in developing quantum algorithms related to this task when working with our system.</p></abstract><trans-abstract xml:lang="ru"><p>Предложена система для квантового программирования QSimulator, представляющая собой программное средство разработки и отладки квантовых алгоритмов на языке высокого уровня С++. Рассматривается основная структура представляемой системы, включая доступные для программиста квантовые алгоритмы и квантовые операции. На примере NP-полной задачи SAT рассматривается процесс генерации оракула в виде квантовой схемы для алгоритма поиска Гровера. Проводится анализ сложности представленной схемы.</p></trans-abstract><kwd-group xml:lang="en"><kwd>quantum computing</kwd><kwd>quantum simulator</kwd><kwd>quantum algorithms</kwd><kwd>Grover search algorithm</kwd><kwd>Boolean satisfiability problem (SAT)</kwd><kwd>quantum emulation</kwd><kwd>quantum circuit</kwd><kwd>quantum circuit complexity</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>квантовые вычисления</kwd><kwd>квантовый симулятор</kwd><kwd>квантовые алгоритмы</kwd><kwd>алгоритм поиска Гровера</kwd><kwd>проблема "выполнимость" (SAT)</kwd><kwd>квантовая эмуляция</kwd><kwd>квантовые схемы</kwd><kwd>сложность квантовых схем</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Shor P. Algorithms for Quantum Computation: Discrete Logarithms and Factoring, Proc. 35th Ann. Symp. Foundations of Computer Science, IEEE CS Press, Los Alamitos, Calif., 1994, p. 124.</mixed-citation><mixed-citation xml:lang="ru">Shor P. Algorithms for Quantum Computation: Discrete Logarithms and Factoring // Proc. 35th Ann. Symp. Foundations of Computer Science, IEEE CS Press, Los Alamitos, Calif. 1994. P. 124.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Grover L. A Fast Quantum Mechanical Algorithm for Database Search / Grover L., Proc. 28th Ann. ACM Symp. Theory of Computation, ACM Press, New York, 1996, p. 212—219.</mixed-citation><mixed-citation xml:lang="ru">Grover L. A Fast Quantum Mechanical Algorithm for Database Search / Grover L. // Proc. 28th Ann. ACM Symp. Theory of Computation, ACM Press, New York. 1996. P. 212—219</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Bernstein E., Vazirani U. Quantum complexity theory, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, 1993, pp. 11—20.</mixed-citation><mixed-citation xml:lang="ru">Bernstein E., Vazirani U. Quantum complexity theory // Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. 1993. P. 11—20.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Deutsch D. Quantum theory, the Church—Turing principle and the universal quantum computer, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985, vol. 400, no. 1818, pp. 97—117.</mixed-citation><mixed-citation xml:lang="ru">Deutsch D. Quantum theory, the Church—Turing principle and the universal quantum computer //Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences. 1985. Vol. 400, N. 1818. P. 97—117.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Aharonov D. Fault-Tolerant Computation with Constant Error / Aharonov D., Ben-Or M., Proc. 29th Ann. ACM Symp. Theory of Computing, ACM Press, New York, 1997, pp. 176—188.</mixed-citation><mixed-citation xml:lang="ru">Aharonov D. Fault-Tolerant Computation with Constant Error / Aharonov D., Ben-Or M. // Proc. 29th Ann. ACM Symp. Theory of Computing, ACM Press, New York. 1997. P. 176—188.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">D-Wave Systems Inc. Hundreds of Quantum Applications. [Electronic resourse], 2024, available at: https://www.dwavesys.com/learn/featured-applications/?items=all&amp;thirdParty=-1#resource-list (date of access: 30.07.2024).</mixed-citation><mixed-citation xml:lang="ru">D-Wave Systems Inc. Hundreds of Quantum Applications. [Электронный ресурс]. 2024.URL: https://www.dwavesys.com/learn/featured-applications/?items=all&amp;thirdParty=-1#resourcelist (дата обращения: 30.07.2024).</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">D-Wave Systems Inc. Quantum in production: optimizing e-commerce logistics. [Electronic resourse], 2024. available at: https://www.dwavesys.com/media/2sof3qhz/the-pattison-foodgroup_case_storyv8.pdf (date of access: 30.07.2024).</mixed-citation><mixed-citation xml:lang="ru">D-Wave Systems Inc. Quantum in production: optimizing e-commerce logistics. [Электронный ресурс]. 2024. URL: https://www.dwavesys.com/media/2sof3qhz/the-pattison-foodgroup_case_story_v8.pdf (дата обращения: 30.07.2024).</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Javadi-Abhari A. et al. Quantum computing with Qiskit, arXiv preprint arXiv:2405.08810, 2024.</mixed-citation><mixed-citation xml:lang="ru">Javadi-Abhari A. et al. Quantum computing with Qiskit // arXiv preprint arXiv:2405.08810. 2024.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">AWS: Amazon Braket. What is Amazon Braket [Electronic resourse, 2024 available at: https://docs.aws.amazon.com/braket/latest/developerguide/what-is-braket.html (date of access: 07.08.2024).</mixed-citation><mixed-citation xml:lang="ru">AWS: Amazon Braket. What is Amazon Braket [Электронный ресурс] — 2024. URL: https://docs.aws.amazon.com/braket/latest/developerguide/what-is-braket.html (дата обращения: 07.08.2024).</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Abhari A. J. et al. Scaffold: Quantum programming language, Princeton Univ NJ Dept of Computer Science, 2012.</mixed-citation><mixed-citation xml:lang="ru">Abhari A. J. et al. Scaffold: Quantum programming language // Princeton Univ NJ Dept of Computer Science. 2012.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">LaRose R. Overview and comparison of gate level quantum software platforms, Quantum, 2019, vol. 3, pp. 130.</mixed-citation><mixed-citation xml:lang="ru">LaRose R. Overview and comparison of gate level quantum software platforms // Quantum. 2019. Vol. 3. P. 130.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Khammassi N. et al. OpenQL: A portable quantum programming framework for quantum accelerators, ACM Journal on Emerging Technologies in Computing Systems (JETC), 2021, vol. 18, no. 1, pp. 1—24.</mixed-citation><mixed-citation xml:lang="ru">Khammassi N. et al. OpenQL: A portable quantum programming framework for quantum accelerators // ACM Journal on Emerging Technologies in Computing Systems (JETC). 2021. Vol. 18, N. 1. P. 1—24.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Certificate of state registration of a computer program 2023683330 Russian Federation. Program for the development of quantum algorithms and simulation of a quantum coprocessor: N 2023682323: application 25.10.2023: publ. 07.11.2023 / K. A. Stepanenko, O. A. Shorina; applicant and copyright holder is the FSAEI HE KFU. 1 p. (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Свидетельство о государственной регистрации программы для ЭВМ 2023683330 Российская Федерация. Программа для разработки квантовых алгоритмов и симуляции квантового сопроцессора: N 2023682323: заявл. 25.10.2023 г.: опубл. 07.11.2023 / К. А. Степаненко, О. А. Шорина; заявитель и правообладатель ФГАОУ ВО КФУ. 1 с.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">Qiskit. Qiskit Aer documentation [Electronic resourse], 2024, available at: https://qiskit.github.io/qiskit-aer/index.html (date of access: 31.07.2024).</mixed-citation><mixed-citation xml:lang="ru">Qiskit. Qiskit Aer documentation [Электронный ресурс]. 2024. URL: https://qiskit.github.io/qiskit-aer/index.html (дата обращения: 31.07.2024).</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Gill S. S. et al. Quantum computing: A taxonomy, systematic review and future directions, Software: Practice and Experience, 2022, vol. 52, no. 1, pp. 66—114.</mixed-citation><mixed-citation xml:lang="ru">Gill S. S. et al. Quantum computing: A taxonomy, systematic review and future directions // Software: Practice and Experience. 2022. Vol. 52, N. 1. P. 66—114</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">IBM. IBM Debuts Next-Generation Quantum Processor &amp; IBM Quantum System Two, Extends Roadmap to Advance Era of Quantum Utility [Electronic resourse], 2024., available at: https://newsroom.ibm.com/2023-12-04-IBM-Debuts-NextGeneration-Quantum-Processor-IBM-Quantum-System-Two-Extends-Roadmap-to-Advance-Era-of-Quantum-Utility (date of access: 31.07.2024).</mixed-citation><mixed-citation xml:lang="ru">IBM. IBM Debuts Next-Generation Quantum Processor &amp; IBM Quantum System Two, Extends Roadmap to Advance Era of Quantum Utility [Электронный ресурс] 2024. URL:https://newsroom.ibm.com/2023-12-04-IBM-Debuts-Next-GenerationQuantum-Processor-IBM-Quantum-System-Two,-Extends-Roadmap-to-Advance-Era-of-Quantum-Utility (дата обращения: 31.07.2024).</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">Serrano M. A. et al. Qua ntum software components and platforms: Overview and quality assessment, ACM Computing Surveys, 2022, vol. 55, no. 8, pp. 1—31.</mixed-citation><mixed-citation xml:lang="ru">Serrano M. A. et al. Quantum software components and platforms: Overview and quality assessment // ACM Computing Surveys. 2022. Vol. 55, N. 8. P. 1—31.</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">Maronese M. et al. Quantum compiling, Quantum Computing Environments, Cham, Springer International Publishing, 2022, pp. 39—74.</mixed-citation><mixed-citation xml:lang="ru">Maronese M. et al. Quantum compiling // Quantum Computing Environments. Cham: Springer International Publishing, 2022. P. 39—74.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">Nielsen M., Chang I. Quantum computing and quantum information, Moscow, Mir, 2006, 822 p. (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Нильсен М., Чанг И. Квантовые вычисления и квантовая информация. М.: Мир, 2006. 822 с.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">Cook S. A. The complexity of theorem-proving procedures, Logic, automata, and computational complexity: The works of Stephen A. Cook, 2023, pp. 143—152.</mixed-citation><mixed-citation xml:lang="ru">Cook S. A. The complexity of theorem-proving procedures // Logic, automata, and computational complexity: The works of Stephen A. Cook. 2023. P. 143—152.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">Dantsin E., Kre inovich V., Wolpert A. On quantum versions of record-breaking algorithms for SAT, ACM SIGACT News, 2005, vol. 36, no. 4, pp. 103—108.</mixed-citation><mixed-citation xml:lang="ru">Dantsin E., Kreinovich V., Wolpert A. On quantum versions of record-breaking algorithms for SAT // ACM SIGACT News. 2005. Vol. 36, N. 4. P. 103—108.</mixed-citation></citation-alternatives></ref><ref id="B22"><label>22.</label><citation-alternatives><mixed-citation xml:lang="en">Varmantchaonala C. M. et al. Quantum hybrid algorithm for solving sat problem, Engineering Applications of Artificial Intelligence, 2023, vol. 121, pp. 106058.</mixed-citation><mixed-citation xml:lang="ru">Varmantchaonala C. M. et al. Quantum hybrid algorithm for solving sat problem // Engineering Applications of Artificial Intelligence. 2023. Vol. 121. P. 106058.</mixed-citation></citation-alternatives></ref><ref id="B23"><label>23.</label><citation-alternatives><mixed-citation xml:lang="en">Bullock S. S., Markov I. L. Asymptotically optimal circuits for arbitrary n-qubit diagonal computations, arXiv preprint quant-ph/0303039, 2008.</mixed-citation><mixed-citation xml:lang="ru">Bullock S. S., Markov I. L. Asymptotically optimal circuits for arbitrary n-qubit diagonal computations // arXiv preprint quant-ph/0303039. 2008.</mixed-citation></citation-alternatives></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">Iten R. et a l. Quantum circuits for isometries, Physical Review A, 2016, vol. 93, no. 3, pp. 032318.</mixed-citation><mixed-citation xml:lang="ru">Iten R. et al. Quantum circuits for isometries // Physical Review A. 2016. Vol. 93, N. 3. P. 032318.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><citation-alternatives><mixed-citation xml:lang="en">Gainutdinova A. F. Fundamentals of quantum computing, Laboratory of operational printing of KSU Publishing House, 2009 (in Russian).</mixed-citation><mixed-citation xml:lang="ru">Гайнутдинова А. Ф. Основы квантовых вычислений. Казань: Лаборатория оперативной полиграфии Издательства КГУ, 2009. 100 с.</mixed-citation></citation-alternatives></ref><ref id="B26"><label>26.</label><citation-alternatives><mixed-citation xml:lang="en">Boyer M. et al. Tight bounds on quantum searching, Fortschritte der Physik: Progress of Physics, 1998, vol. 46, no. 4—5, pp. 493—505.</mixed-citation><mixed-citation xml:lang="ru">Boyer M. et al. Tight bounds on quantum searching // Fortschritte der Physik: Progress of Physics. 1998. Vol. 46, N. 4—5. P. 493—505.</mixed-citation></citation-alternatives></ref><ref id="B27"><label>27.</label><citation-alternatives><mixed-citation xml:lang="en">Durr C., Hoyer P. A quantum algorithm for finding the minimum, arXiv preprint quant-ph/9607014, 1996.</mixed-citation><mixed-citation xml:lang="ru">Durr C., Hoyer P. A quantum algorithm for finding the minimum // arXiv preprint quant-ph/9607014. 1996.</mixed-citation></citation-alternatives></ref><ref id="B28"><label>28.</label><citation-alternatives><mixed-citation xml:lang="en">Marques-Silva J. Practical applications of boolean satisfiability, 2008 9th International Workshop on Discrete Event Systems, IEEE, 2008, pp. 74—80.</mixed-citation><mixed-citation xml:lang="ru">Marques-Silva J. Practical applications of boolean satisfiability // 2008 9th International Workshop on Discrete Event Systems. IEEE, 2008. P. 74—80.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
