<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" 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" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mireabulletin</journal-id><journal-title-group><journal-title xml:lang="ru">Russian Technological Journal</journal-title><trans-title-group xml:lang="en"><trans-title>Russian Technological Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-3210</issn><issn pub-type="epub">2500-316X</issn><publisher><publisher-name>RTU MIREA</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.32362/2500-316X-2025-13-6-25-46</article-id><article-id custom-type="edn" pub-id-type="custom">XEUFSE</article-id><article-id custom-type="elpub" pub-id-type="custom">mireabulletin-1292</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАЦИОННЫЕ СИСТЕМЫ. ИНФОРМАТИКА. ПРОБЛЕМЫ ИНФОРМАЦИОННОЙ БЕЗОПАСНОСТИ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATION SYSTEMS. COMPUTER SCIENCES. ISSUES OF INFORMATION SECURITY</subject></subj-group></article-categories><title-group><article-title>Подход к выявлению оптимального набора кубит квантовых вычислительных устройств на примере модели генерации случайных двоичных последовательностей</article-title><trans-title-group xml:lang="en"><trans-title>Approach for identifying the optimal set of qubits of quantum computing devices based on a model for generating binary random sequences</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0003-4862-4816</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Корольков</surname><given-names>А. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Korolkov</surname><given-names>A. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Корольков Андрей Вячеславович, к.т.н., член-корреспондент Академии криптографии Российской Федерации, член-корреспондент Академии Инженерных наук им. А.М. Прохорова Российской Федерации, заведующий кафедрой информационной безопасности, Институт искусственного интеллекта, ФГБОУ ВО «МИРЭА – Российский технологический университет» </p><p>119454, Москва, пр-т Вернадского, д. 78 </p></bio><bio xml:lang="en"><p>Andrey V. Korolkov, Cand. Sci. (Eng.), Corresponding Member of the Academy of Cryptography of the Russian Federation, Corresponding Member of the A.M. Prokhorov Academy of Engineering Sciences of the Russian Federation, Head of the Department of Information Security, Institute of Artificial Intelligence, MIREA – Russian Technological University  </p><p>78, Vernadskogo pr., Moscow, 119454 </p></bio><email xlink:type="simple">korolkov@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0002-4750-6204</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Крючков</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Kryuchkov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Крючков Андрей Андреевич, старший преподаватель, кафедра информационной безопасности, Институт искусственного интеллекта </p><p>119454, Москва, пр-т Вернадского, д. 78 </p></bio><bio xml:lang="en"><p>Andrey A. Kryuchkov, Senior Lecturer, Department of Information Security, Institute of Artificial Intelligence </p><p>78, Vernadskogo pr., Moscow, 119454 </p></bio><email xlink:type="simple">kryuchkov_a@mirea.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>МИРЭА – Российский технологический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>MIREA – Russian Technological University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>05</day><month>12</month><year>2025</year></pub-date><volume>13</volume><issue>6</issue><fpage>25</fpage><lpage>46</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Корольков А.В., Крючков А.А., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Корольков А.В., Крючков А.А.</copyright-holder><copyright-holder xml:lang="en">Korolkov A.V., Kryuchkov A.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.rtj-mirea.ru/jour/article/view/1292">https://www.rtj-mirea.ru/jour/article/view/1292</self-uri><abstract><sec><title> Цели</title><p> Цели. Отсутствие квантовых компьютеров, устойчивых к ошибкам, а также невозможность обеспечить беспрепятственный и полнофункциональный физический доступ к облачным квантовым системам поднимает актуальный вопрос о необходимости разработки методов оценки и верификации облачных квантовых компьютеров. Авторам видится перспективным использование подхода к анализу возможностей квантового процессора в контексте его применимости для решения некоторых задач, возникающих при оценке систем защиты информации. Одним из примеров теста квантового вычислительного устройства (КВУ) на предмет выявления уровня производительности и качества вычислений может послужить модель генерации случайной двоичной последовательности, анализ которой предоставляет информацию о корректности и надежности исследуемого квантового регистра. Цель работы заключается в разработке программного комплекса, с помощью которого представляется возможным моделирование работы КВУ в режиме квантового генератора случайных чисел. </p></sec><sec><title>Методы</title><p>Методы. Программная реализация по взаимодействию с облачными квантовыми компьютерами выполнена с использованием библиотеки Qiskit. Интерфейс программного комплекса реализован средствами Qt5, кроссплатформенного набора инструментов и виджетов для создания графических приложений. Анализ генерируемой двоичной последовательности выполнен статистическими тестами NIST STS1. </p></sec><sec><title>Результаты</title><p>Результаты. Разработан программный комплекс, предоставляющий пользователю в графическом режиме возможность выполнения опционального исследования некоторых облачных квантовых компьютеров на предмет выявления оптимального и наиболее устойчивого к ошибкам набора кубит. Приведены результаты экспериментов на трех облачных КВУ. </p></sec><sec><title>Выводы</title><p>Выводы. В условиях накладываемых ограничений на вычислительные мощности и время использования облачных КВУ предложенный подход отличается минимальными требованиями к производительности устройства, предоставляет наглядные и однозначно-интерпретируемые сведения об исследуемых технических характеристиках квантового компьютера, является воспроизводимым, легко масштабируемым и универсальным. </p></sec></abstract><trans-abstract xml:lang="en"><sec><title>Objectives</title><p>Objectives. The absence of error-resistant quantum computers, coupled with the challenges associated with providing unrestricted and fully operational physical access to cloud quantum computing systems, prompts a critical examination of the necessity to develop universal and independent methods for evaluating and verifying cloud quantum computers. A promising approach involves evaluating the capabilities of a quantum computer in relation to its effectiveness in addressing specific challenges encountered in the assessment of information security systems. A potential test for ascertaining the performance and computational quality of a quantum computing device (QCD) is based on a model designed to generate a random binary sequence. By analyzing this sequence, insights can be obtained into the accuracy and reliability of the quantum register under study. The paper presents a software program developed for simulating the operation of a quantum random number generator.</p></sec><sec><title>Methods</title><p>Methods. The software implementation for interacting with cloud quantum computers was performed using the Qiskit open-source software kit. The graphical user interface of the software package was developed using a Qt5 crossplatform set of tools and widgets for creating applications. The analysis of the generated binary sequence was performed using a set of statistical tests NIST STS2.</p></sec><sec><title>Results</title><p>Results. The developed software package provides users with a graphical interface for conducting an analysis of a cloud QCD to identify the optimal and most error-resistant set of qubits. The findings from experiments conducted on three cloud quantum computing devices are reported.</p></sec><sec><title>Conclusions</title><p>Conclusions. The proposed approach, which is constrained by limitations of computing power and duration of access to cloud-based QCD, imposes minimal demands on the productive capabilities of the quantum system. It offers clear and unequivocally interpretable insights into the technical characteristics of a cloud quantum computer, while also being reproducible, easily scalable, and universally applicable. </p></sec></trans-abstract><kwd-group xml:lang="ru"><kwd>квантовый компьютер</kwd><kwd>квантовое вычислительное устройство</kwd><kwd>генератор случайных чисел</kwd><kwd>оценка производительности</kwd></kwd-group><kwd-group xml:lang="en"><kwd>quantum computer</kwd><kwd>quantum computer device</kwd><kwd>random number generator</kwd><kwd>benchmarking</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Proctor T., Young K., Baczewski A.D., Blume-Kohout R. Benchmarking quantum computers: arXiv. 2024. arXiv:2407.08828. https://doi.org/10.48550/arXiv.2407.08828</mixed-citation><mixed-citation xml:lang="en">Proctor T., Young K., Baczewski A.D., Blume-Kohout R. Benchmarking quantum computers. arXiv. 2024. arXiv:2407.08828. https://doi.org/10.48550/arXiv.2407.08828</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Amico M., Zhang H., Jurcevic P., et al. Defining Standard Strategies for Quantum Benchmarks. IBM Publications. 2023. URL: https://research.ibm.com/publications/defining-standard-strategies-for-quantum-benchmarks. Дата обращения 15.05.2025.</mixed-citation><mixed-citation xml:lang="en">Amico M., Zhang H., Jurcevic P., et al. Defining Standard Strategies for Quantum Benchmarks. IBM Publications. 2023. Available from URL: https://research.ibm.com/publications/defining-standard-strategies-for-quantum-benchmarks. Accessed May 15, 2025.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Acuaviva A., Aguirre D., Pena R., Sanz M. Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach: arXiv. 2024. arXiv:2407.10941. https://doi.org/10.48550/arXiv.2407.10941</mixed-citation><mixed-citation xml:lang="en">Acuaviva A., Aguirre D., Pena R., Sanz M. Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach. arXiv. 2024. arXiv:2407.10941. https://doi.org/10.48550/arXiv.2407.10941</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Eisert J., Hangleiter D., Walk N., et al. Quantum certification and benchmarking. Nat. Rev. Phys. 2020;2:382–390. https://doi.org/10.1038/s42254-020-0186-4</mixed-citation><mixed-citation xml:lang="en">Eisert J., Hangleiter D., Walk N., et al. Quantum certification and benchmarking. Nat. Rev. Phys. 2020;2:382–390. https://doi.org/10.1038/s42254-020-0186-4</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Крючков А.А. О необходимости принятия единого стандарта по оценке производительности и сертификации квантовых вычислительных устройств. Информационно-экономические аспекты стандартизации и технического регулирования. Сборник научных трудов участников I Научно-практической конференции «Стандартизация: траектория науки», посвященной 100-летию деятельности ФГБУ «Институт стандартизации». 2024;6(81):43–49.</mixed-citation><mixed-citation xml:lang="en">Kryuchkov A.A. On the need to adopt a single standard for evaluating the performance and certification of quantum computers. Informatsionno-ehkonomicheskie aspekty standartizatsii i tekhnicheskogo regulirovaniya = Information and Economic Aspects of Standardization and Technical Regulation. 2024;6(81):43–49 (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Wack A., Paik H., Javadi-Abhari A., Jurcevic P., Faro I., Gambetta J.M., Johnson B.R. Scale, Quality, and Speed: three key attributes to measure the performance of near-term quantum computers.arXiv. 2021. arXiv:2110.14108.https://doi.org/10.48550/arXiv.2110.14108</mixed-citation><mixed-citation xml:lang="en">Wack A., Paik H., Javadi-Abhari A., Jurcevic P., Faro I., Gambetta J.M., Johnson B.R. Scale, Quality, and Speed: three key attributes to measure the performance of near-term quantum computers. arXiv. 2021. arXiv:2110.14108. https://doi.org/10.48550/arXiv.2110.14108</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">McKay D.C., Hincks I., Pritchett E.J., Carroll M., Govia L.C.G., Merkel S.T. Benchmarking Quantum Processor Performance at Scale. arXiv. 2023. arXiv:2311.05933. https://doi.org/10.48550/arXiv.2311.05933</mixed-citation><mixed-citation xml:lang="en">McKay D.C., Hincks I., Pritchett E.J., Carroll M., Govia L.C.G., Merkel S.T. Benchmarking Quantum Processor Performance at Scale. arXiv. 2023. arXiv:2311.05933. https://doi.org/10.48550/arXiv.2311.05933</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Amico M., Zhang H., Jurcevic P., Bishop L.S., Nation P., Wack A., McKay D.C. Defining Standard Strategies for Quantum Benchmarks. arXiv. 2023. arXiv:2303.02108 https://doi.org/10.48550/arXiv.2303.02108</mixed-citation><mixed-citation xml:lang="en">Amico M., Zhang H., Jurcevic P., Bishop L.S., Nation P., Wack A., McKay D.C. Defining Standard Strategies for Quantum Benchmarks. arXiv. 2023. arXiv:2303.02108 https://doi.org/10.48550/arXiv.2303.02108</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Shor P.W. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE; 1994. P. 124–134. https://doi.org/10.1109/SFCS.1994.365700</mixed-citation><mixed-citation xml:lang="en">Shor P.W. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE; 1994. P. 124–134. https://doi.org/10.1109/SFCS.1994.365700</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Балыгин К.А., Кулик С.П., Молотков С.Н. Реализация квантового генератора случайных чисел: экстракция доказуемо случайных битовых последовательностей из коррелированных марковских цепочек. Письма в ЖЭТФ. 2024;119(7):533–544. https://doi.org/10.31857/S1234567824070115</mixed-citation><mixed-citation xml:lang="en">Balygin K.A., Kulik S.P., Molotkov S.N. Implementation of a Quantum Generator of Random Numbers: Extraction of Provably Random Bit Sequences from Correlated Markov Chains. Jetp. Lett. 2024;119(7):538–548. https://doi.org/10.1134/S0021364024600575 [Original Russian Text: Balygin K.A., Kulik S.P., Molotkov S.N. Implementation of a Quantum Generator of Random Numbers: Extraction of Provably Random Bit Sequences from Correlated Markov Chains. Pis’ma v Zhurnal ehksperimental’noi i teoreticheskoi fiziki (Pis’ma v ZHEHTF). 2024;119(7):533–544 (in Russ.). https://doi.org/10.31857/S1234567824070115 ]</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Гайдаш А.А., Гончаров Р.К., Козубов А.В., Яковлев П.В. Математическая модель квантового генератора случайных чисел на основе флуктуации вакуума. Вестник Санкт-Петербургского университета. Прикладная математика. Информатика. Процессы управления. 2024;20(2):136–153. https://doi.org/10.21638/spbu10.2024.202</mixed-citation><mixed-citation xml:lang="en">Gaidash A.A., Goncharov R.K., Kozubov A.V., Yakovlev P.V. Mathematical model of random number generator based on vacuum fluctuations. Vestnik Sankt-Peterburgskogo universiteta. Prikladnaya matematika. Informatika. Protsessy upravleniya = Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes. 2024;20(2):136–153 (in Russ.). https://doi.org/10.21638/spbu10.2024.202</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Петренко А.А., Ковалев А.В., Бугров В.Е. Генерация случайных чисел с использованием массива связанных лазеров на основе микростолбиков с квантовыми точками. Научно-технический вестник информационных технологий, механики и оптики. 2021;21(6):962–968. https://doi.org/10.17586/2226-1494-2021-21-6-962-968</mixed-citation><mixed-citation xml:lang="en">Petrenko A.A., Kovalev A.V., Bougrov V.E. Random number generation with arrays of coupled quantum-dot micropillar lasers. Nauchno-tekhnicheskii vestnik informatsionnykh tekhnologii, mekhaniki i optiki = Scientific and Technical Journal of Information Technologies, Mechanics and Optics. 2021;21(6):962–968 (in Russ.). https://doi.org/10.17586/2226-1494-2021-21-6-962-968</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Орлов М.А., Нечаев К.А., Резниченко С.А. Оценка статистических свойств и криптографической стойкости случайных последовательностей, полученных квантовым компьютером IBM. Безопасность информационных технологий. 2023;30(1):14–26. http://doi.org/10.26583/bit.2023.1.01</mixed-citation><mixed-citation xml:lang="en">Orlov M.A., Nechaev K.A., Reznichenko S.A. Evaluation of statistical properties and cryptographic strength of random sequences obtained by an IBM quantum computer. Bezopasnost’ informatsionnykh tekhnologii = IT Security (Russia). 2023;30(1):14–26 (in Russ.). http://doi.org/10.26583/bit.2023.1.01</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Li Y., Fei Y., Wang W., et al. Quantum random number generator using a cloud superconducting quantum computer based on source-independent protocol. Sci Rep. 2021;11:23873. https://doi.org/10.1038/s41598-021-03286-9</mixed-citation><mixed-citation xml:lang="en">Li Y., Fei Y., Wang W., et al. Quantum random number generator using a cloud superconducting quantum computer based on source-independent protocol. Sci Rep. 2021;11:23873. https://doi.org/10.1038/s41598-021-03286-9</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Salehi R., Razaghi M., Fotouhi B. Hybrid Hadamard and Controlled-Hadamard Based Quantum Random Number Generators in IBM QX. Physica Scripta. 2022;97(6):065101. https://doi.org/10.1088/1402-4896/ac698b</mixed-citation><mixed-citation xml:lang="en">Salehi R., Razaghi M., Fotouhi B. Hybrid Hadamard and Controlled-Hadamard Based Quantum Random Number Generators in IBM QX. Physica Scripta. 2022;97(6):065101. https://doi.org/10.1088/1402-4896/ac698b</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Yadav A., Mishra S., Pathak A. Partial loopholes free device-independent quantum random number generator using IBM’s quantum computers. Physica Scripta. 2024;99(11):115103. https://doi.org/10.1088/1402-4896/ad7c02</mixed-citation><mixed-citation xml:lang="en">Yadav A., Mishra S., Pathak A. Partial loopholes free device-independent quantum random number generator using IBM’s quantum computers. Physica Scripta. 2024;99(11):115103. https://doi.org/10.1088/1402-4896/ad7c02</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Feynman R.P. Quantum Mechanical Computers. Optics News. 1985;11(2):11–20. URL: https://www.optica-opn.org/home/articles/on/volume_11/issue_2/features/quantum_mechanical_computers/. Дата обращения 15.05.2025. /. Accessed May 15, 2025.</mixed-citation><mixed-citation xml:lang="en">Feynman R.P. Quantum Mechanical Computers. Optics News. 1985;11(2):11–20. Available from URL: https://www.opticaopn.org/home/articles/on/volume_11/issue_2/features/quantum_mechanical_computers/. Accessed May 15, 2025.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Крючков А.А. QISs_v.0.3.9: свидетельство о государственной регистрации Программы для ЭВМ RU 2025613655 РФ. Заявка № 2025611456; заявл. 28.01.2025; опубл. 13.02.2025. Бюл. № 2.</mixed-citation><mixed-citation xml:lang="en">Kryuchkov A.A. QISs_v.0.3.9: Computer Program RU2025613655 RF. Publ. 13.02.2025 (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Крючков А.А., Комогоров К.Е. Моделирование процесса генерации случайных чисел на квантовых вычислительных устройствах. В сб.: Материалы VIII НПК «Актуальные проблемы и перспективы радиотехнических и инфокоммуникационных систем» (18–22 ноября 2024 г., Москва). М.: РТУ МИРЭА; 2024. С. 501–506.</mixed-citation><mixed-citation xml:lang="en">Kryuchkov A.A., Komogorov K.E. Simulation of the random number generation process on quantum computing devices. In: Proceedings of the 8th Scientific and Practical Conference “Actual Problems and Prospects of Radio Engineering and Infocommunication Systems.” Moscow: RTU MIREA; 2024. P. 501–506 (in Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Acharya R., Abanin D.A., Aghababaie-Beni L., et al. Quantum error correction below the surface code threshold. Nature. 2025;638:920–926. https://doi.org/10.1038/s41586-024-08449-y</mixed-citation><mixed-citation xml:lang="en">Acharya R., Abanin D.A., Aghababaie-Beni L., et al. Quantum error correction below the surface code threshold. Nature. 2025;638:920–926. https://doi.org/10.1038/s41586-024-08449-y</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Verma S., Kumari S.S., Kumar R.S. Topological quantum error correction with semions. Int. J. Phys. Math. 2024:6(2):44–47. https://doi.org/10.33545/26648636.2024.v6.i2a.95</mixed-citation><mixed-citation xml:lang="en">Verma S., Kumari S.S., Kumar R.S. Topological quantum error correction with semions. Int. J. Phys. Math. 2024:6(2):44–47. https://doi.org/10.33545/26648636.2024.v6.i2a.95</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Webster M., Browne D. Engineering Quantum Error Correction Codes Using Evolutionary Algorithms. IEEE Trans. Quantum Eng. 2025;6:3100514. https://doi.org/10.1109/TQE.2025.3538934</mixed-citation><mixed-citation xml:lang="en">Webster M., Browne D. Engineering Quantum Error Correction Codes Using Evolutionary Algorithms. IEEE Trans. Quantum Eng. 2025;6:3100514. https://doi.org/10.1109/TQE.2025.3538934</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
