<?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">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2025-26-5-94-110</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-2125</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>Article</subject></subj-group></article-categories><title-group><article-title>Алгоритм факторизации вектора состояния квантовой системы</article-title><trans-title-group xml:lang="en"><trans-title>Algoritm for factoring the state vector of a quantum system</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Боева</surname><given-names>Анастасия Валерьевна</given-names></name><name name-style="western" xml:lang="en"><surname>Boeva</surname><given-names>Anastasiya Valer’evna</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><bio xml:lang="en"><p>master’s student</p></bio><email xlink:type="simple">anastasiavaleri555@gmail.com</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>Lomonosov Moscow State 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>21</day><month>01</month><year>2026</year></pub-date><volume>26</volume><issue>5</issue><fpage>94</fpage><lpage>109</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Боева А.В., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Боева А.В.</copyright-holder><copyright-holder xml:lang="en">Boeva A.V.</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.chebsbornik.ru/jour/article/view/2125">https://www.chebsbornik.ru/jour/article/view/2125</self-uri><abstract><p>Работа посвящена рассмотрению многокубитовых и многокудитовых квантовых систем в чистых состояниях, их описанию с точки зрения разбиения на непересекающиеся множества запутанных кубитов (кудитов) — наборы запутанности, представлена формула логарифмической запутанности многокубитовых и многокудитовых квантовых систем в чистых и смешанных состояниях. С помощью методов искусственного интеллекта произведена классификация многокубитовых систем, учитывающая максимальное по вектору состояния значение мгновенной запутанности и логарифмическую запутанность, построены диаграммы распределения этих характеристик в зависимости от факторизации вектора состояния системы на наборы запутанности. Построена формула средней по ансамблю логарифмической запутанности для многокубитовых и многокудитовых квантовых систем вчистых состояниях.</p></abstract><trans-abstract xml:lang="en"><p>The work is devoted to the consideration of multi-qubit and multi-qudit quantum systemsin pure states, their description in terms of partitioning into non-overlapping sets of entangled qubits (qudits) — sets of entanglement, the formula of logarithmic entanglement of multiqubit and multi-qudit quantum systems in pure and mixed states is presented. Using artificial intelligence methods, the classification of multi-qubit systems is made, taking into account the maximum instantaneous entanglement value and logarithmic entanglement, diagrams of the distribution of these characteristics depending on the factorization of the system state vector into sets of entanglement are constructed. A formula for the ensemble-averaged logarithmic entanglement for multi-qubit and multi-qudit quantum systems in pure states has been constructed.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>квантовая запутанность</kwd><kwd>многокубитовые системы</kwd><kwd>многокудитовые системы</kwd><kwd>кубиты</kwd><kwd>кудиты</kwd><kwd>наборы запутанности</kwd><kwd>средняя по ансамблю квантовая запутанность для многокубитовых и многокудитовых квантовых систем.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>quantum entanglement</kwd><kwd>multi-qubit systems</kwd><kwd>multi-qudit systems</kwd><kwd>qubits</kwd><kwd>qudits</kwd><kwd>entanglement sets</kwd><kwd>ensemble-average quantum entanglement for multi-qubit and multi-qudit quantum systems.</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">Горбачев, В. Н., Физические основы современных информационных процессов или учеб. пос. / В.Н. Горбачев , А. И. Жилиба // Санкт-Петербург, 2001. — 43 c.</mixed-citation><mixed-citation xml:lang="en">Gorbachev, V. N., Zhiliba, V. N. 2001, “The physical foundations of modern information processes”, St. Petersburg, 43 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Холево, А. С. Введение в квантовую теорию информации. / А. С. Холево — М.: МЦНМО, 2002. — 128 c.</mixed-citation><mixed-citation xml:lang="en">Holevo, A. S. 2002, “Introduction to the quantum theory of information”, MCCME, Moscow, 128 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Имре, Ш. Квантовые вычисления и связь. / Ш. Имре, Ф. Балаж — М.: Физматлит, 2008. — 319 c.</mixed-citation><mixed-citation xml:lang="en">Imre, Sh. &amp; Balazs, F. 2008, "Quantum computing and communication Fizmatlit, Moscow, 319 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Benenti, G., Principles of quantum computation and information (Vol. 1 Basic concepts) / G. Benenti , G. Casati , G. Strini / World Scientific, 2004. — 273 p.</mixed-citation><mixed-citation xml:lang="en">Benenti, G. 2004, “Principles of quantum computation and information”, vol. 1 Basic concepts, World Scientific, Italy, 273 p.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Di´osi, L. A Short Course in Quantum Information Theory. Lect. Notes Phys. 713 // Springer, Berlin Heidelberg, 2007. — 161 p.</mixed-citation><mixed-citation xml:lang="en">Di´osi, L. 2007, “A Short Course in Quantum Information Theory”, Lect. Notes Phys. 713, Springer, Berlin Heidelberg, 161 p.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Lvovsky, A. I. Quantum Physics An Introduction Based on Photons / A. I. Lvovsky // Springer, University of Calgary, Canada, 2018. – 303 p.</mixed-citation><mixed-citation xml:lang="en">Lvovsky, A. I. 2018, “Quantum Physics An Introduction Based on Photons”, Springer, University of Calgary, Canada, 303 p.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Baumester, D., The Physics of Quantum Information / D. Baumester, A. Ekert, A. Tsailinger // Springer Berlin, Heidelberg, 2002 – 315 p.</mixed-citation><mixed-citation xml:lang="en">Baumester, D., Ekert, A., Tsailinger, A. 2002, “ The Physics of Quantum Information ” Springer Berlin, Heidelberg, 315 p.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Валиев К. А. Квантовые компьютеры: надежды и реальность / К. А. Валиев, А. А. Кокин // Ижевск: "Регулярная и хаотическая динамика 2001. — 352 с.</mixed-citation><mixed-citation xml:lang="en">Valiev, K. A. 2001, “Quantum computers: hopes and reality”, Regular and Chaotic Dynamics, Izhevsk, 352 p.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Nielsen M., Chang I. Quantum computing and quantum information. [Nil’sen M., CHang I. Kvantovye vychisleniya i kvantovaya informaciya]. Moscow: MIR, 2006, 824 p.</mixed-citation><mixed-citation xml:lang="en">Nielsen, M. &amp; Chang, I. 2006, “Quantum computing and quantum information”, MIR, Moscow, 824 p.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Валиев, К. А. Квантовые компьютеры и квантовые вычисления / К. А. Валиев // Успехи физических наук. — 2005. — Т. 175, № 31. — С. 3–39.</mixed-citation><mixed-citation xml:lang="en">Valiev, K. A. 2005, “Quantum computers and quantum computing”, Phisics — Uspekhi, no. 48(1), pp. 3–39.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Калачев, А. А. Квантовая информатика в задачах: учеб.-метод. пос. / А.А. Калачев. — Казань: Казан. ун-т, 2012 — 48 с.</mixed-citation><mixed-citation xml:lang="en">Kalachev, A. A. 2012, “Quantum computer science in problems”, Kazan Federal University, Kazan, 48 p.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Холево, А. С. Математические основы квантовой информатики [Текст] / А. С. Холево. - Москва : МИАН, 2018. - 117 с. : ил.; 29 см. - (Лекционные курсы НОЦ/ Математический</mixed-citation><mixed-citation xml:lang="en">Holevo, A. S. 2018, “ Matematicheskie osnovi kvantovoi informatiki ”, Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, 117 p.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">институт им. В. А. Стеклова Российской академии наук, ISSN 2226-8782; вып. 30).; ISBN 978-5-98419-080-7</mixed-citation><mixed-citation xml:lang="en">Preskill, J. 1998, “Quantum computation and information” California Institute of Technology, Caltech, 321 p.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Preskill J. / Quantum computation and information // California Institute of Technology, Caltech 1998. — 321 p.</mixed-citation><mixed-citation xml:lang="en">Kaye, P., Laflamme, R. &amp; Mosca, M. 2007, “Introduction to Quantum Computing” Oxford University Press, Oxford, 274 p.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Kaye P. An Introduction to Quantum Computing / P. Kaye, R. Laflamme, M. Mosca // Oxford University Press, 2007. — 274 p.</mixed-citation><mixed-citation xml:lang="en">Greenberger, D., Horne, M. A. &amp; Zeilinger, A. 1989, “Going beyond Bell’s Theorem in Bell’s Theorem, Quantum Theory, and Conceptions of the universe” , M. Kafatos (Ed.), Knower, Dordrecht, pp. 69-72.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">D. Greenberger, M. A. Horne, A. Zeilinger, Going beyond Bell’s Theorem in“Bell’s Theorem, Quantum Theory, and Conceptions of the universe”, M. Kafatos (Ed.), Knower, Dordrecht, p. 69-72 (1989).</mixed-citation><mixed-citation xml:lang="en">Stib, V.-H.&amp; Hardy., J. 2007, “Problems and their solutions in quantum computing and quantum information theory”, SIC "Regular and chaotic dynamics Moscow-Izhevsk, 296 p.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Stib, V.-H. Problems and their solutions in quantum computing and quantum information theory. [Stib, V.-H. Zadachi i ih resheniya v kvantovyh vychisleniyah i kvantovoj teorii informacii ]. / V.-H., Stib, J. Hardy. – Moscow-Izhevsk: SIC "Regular and chaotic dynamics 2007. – 296 p.</mixed-citation><mixed-citation xml:lang="en">N. P. Stadnaya, A. V. Boeva, A. F. Klinskikh, 2023, “Transitivity of entanglement states in multiqubit systems”, Proceedings of Voronezh State University. Series: Physics. Mathematics, no. 2, pp. 16-21.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Стадная, Н. П., Боева, А. В., Клинских, А. Ф., Запутанность в чистых многокубитовых системах / Н. П. Стадная, А. В. Боева, А. Ф. Клинских // Вестник Воронежского государственного университета. Серия: Физика. Математика. – 2023. – № 2. – С. 16-21.</mixed-citation><mixed-citation xml:lang="en">Стадная, Н. П., Боева, А. В., Клинских, А. Ф., Запутанность в чистых многокубитовых системах / Н. П. Стадная, А. В. Боева, А. Ф. Клинских // Вестник Воронежского государственного университета. Серия: Физика. Математика. – 2023. – № 2. – С. 16-21.</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>
