Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Известия Южного федерального университета. Технические науки

Моделирование квантовых вычислений на основе QuIDD-графов

Евсеев Олег Константинович, Гушанский Сергей Михайлович, Гузик Вячеслав Филиппович

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Creating algorithms for quantum computing requires the ability to verify their results through the use of physical or mathematical models of quantum computer. Mathematical models are available to any developer, but their efficiency is too low to simulate the register with volume more than 12 bits. This article describes the structure and algorithms of developed 2-level model of increased efficiency. The enhanced algorithms for permutation of q-bits and QuIDD-graph synthesis by removing the bits of index of original matrix elements are proposed. The direction for further optimization for QuIDD techniques are defined.

Related papers

Метод моделирования квантовых вычислений на основе QuIDD-графов

Евсеев Олег Константинович, Гушанский Сергей Михайлович, Гузик Вячеслав Филиппович

Quantum computer simulation requires processing of huge-size matrixes containing several distinct elements. The most effective method of decreasing calculation costs for simulation was developed in the University of Michigan and was called Quantum Information Decision Diagrams. In order to improve the efficiency of the base QuIDD methodic this article covers its key aspects and advises level-wise recursive methods of QuIDD graph reduction and matrix member-wise operations. Methods set out in this article can be used for developing a graph-based mathematical model of a universal quantum computer, operating at the maximal dimension of the quantum register of about 50 q-bits.

Известия Южного федерального университета. Технические науки•Jan 1, 2013•0 citations

Аппаратный подход к моделированию квантовых вычислений с использованием алгоритма оптимизации

Гузик Вячеслав Филиппович, Гушанский Сергей Михайлович, Кубраков Евгений Сергеевич

A hardware approach for the quantum computing modeling was considered. A common mathematical model of the quantum computer was described; a methodic of mathematical modeling of the quantum computing was shown. During the mathematical methodic description the most resource-intensive parts of the model are allocated. Considered questions connected with data parallelizing with a hardware accelerator, which is used for quantum computer modeling. A common scheme of the accelerator’s work algorithm was shown. Suggested more compact data format for accelerator implementation, that will reduce time costs spent by elementary arithmetic operations. Proposed the use of the optimization algorithm for data minimization during the calculations in the phase of transforming model of quantum register with quantum gates in quantum computer simulators. Shown results of optimization algorithm execution and compared results with classic mathematical approach.

Известия Южного федерального университета. Технические науки•Jan 1, 2014•0 citations

Моделирование быстрого алгоритма квантового поиска на классических компьютерах: информационный анализ проблемы останова

Сергей Викторович Ульянов, S.V. Ulyanov, В.С. Ульянов +1 more

The paper describes the simplest technique for simulating a quantum algorithm based on the direct matrix representation of quantum operators.This approach is stable and precise, but it requires allocation of operator's matrices in the computer memory.Since the size of the operators grows exponentially, this approach is useful for simulating quantum algorithms with a relatively small number of qubits (e.g., approximately 11 qubits on a typical desktop computer).This approach enables relatively simple simulation of the operation of the solution quality control system and performance of a reliability analysis.A more efficient fast quality control simulation method is based on computing all or a part of operator matrices as needed on a current computational basis.This method makes it possible to avoid storing all or a part of the operator matrices.In this case, the number of qubits to be simulated (e.g., the number of input qubits or the number of qubits in the system state register) is affected by: (I) the exponential growth in the number of operations required to calculate the result of matrix products; and (II) the size of the state vector allocated in computer memory.It is reasonable if one embodiment of this approach involves simulating up to 19 or more qubits on typical desktop computer, and even more in a system with a vector architecture.Due to particularities of the memory addressing and access processes in a typical desktop computer (such as, for example, a Pentium PC), when a number of qubits is relatively small, the on-demand computing tends to be faster than the direct storage approach.The compute-on-demand approach benefits from applying the results of studying quantum operators and their structure that enables computing the matrix elements more efficiently.The paper considers effective simulation of Grover's quantum search algorithm using a computer with classical architecture.

arXiv:2304.09745•Международный журнал Программные продукты и системы•Aug 28, 2023•3 citations

Efficient quantum circuit simulation.

John P. Hayes, Igor L. Markov, George F. Viamontes

Quantum-mechanical phenomena are playing an increasing role in information processing as transistor sizes approach the nanometer level, while the securest forms of communication rely on quantum data encoding. When they involve a finite number of basis states, these phenomena can be modeled as quantum circuits, the quantum analogue of conventional or classical logic circuits. Simulation of quantum circuits can therefore be used as a tool to evaluate issues in the design of quantum information processors. Unfortunately, simulating such phenomena efficiently is exceedingly difficult. The matrices representing quantum operators (gates) and vectors modeling quantum states grow exponentially with the number of quantum bits. The information represented by quantum states and operators often exhibits structure that can be exploited when simulating certain classes of quantum circuits. We study the development of simulation methods that run on classical computers and take advantage of such repetitions and redundancies. In particular, we define a new data structure for simulating quantum circuits called the quantum information decision diagram (QuIDD). A QuIDD is a compressed graph representation of a vector or matrix and permits computations to be performed directly on the compressed data. We develop a comprehensive set of algorithms for operating on QuIDDs in both the state-vector and density-matrix formats, and evaluate their complexity. These algorithms have been implemented in a general-purpose simulator program for quantum-mechanical applications called QuIDDPro. Through extensive experiments conducted on representative quantum simulation applications, including Grover's search algorithm, error characterization, and reversible circuits, we demonstrate that QuIDDPro is faster than other existing quantum-mechanical simulators such as the National Institute of Standards and Technology's QCSim program, and is far more memory-efficient. Using QuIDDPro, we explore the advantages of quantum computation over classical computation, simulate quantum errors and error correction, and study the impact of numerical precision on the fidelity of simulations. We also develop several novel algorithms for testing quantum circuit equivalence and compare them empirically. The QuIDDPro software is equipped with a user-friendly interface and is distributed with numerous example scripts. It has been used as a laboratory supplement for quantum computing courses at several universities.

•Jan 1, 2007•15 citations

Application of machine learning methods to optimize quantum algorithms in cryptographic analysis tasks

T. Zhuo

In recent years, quantum computing has attracted considerable attention due to its potential to solve complex problems inaccessible to classical computers. One of the priority areas of application of quantum algorithms is cryptographic analysis, since quantum computers are able to effectively crack widely used cryptosystems such as RSA and ECC. However, the development of quantum algorithms faces a number of difficulties related to optimizing their structure and parameters. This study examines the application of machine learning (ML) methods to improve the efficiency of quantum algorithms in cryptographic analysis tasks. To achieve this goal, hybrid quantum-classical approaches were used, combining the advantages of quantum computing and machine learning. Learning algorithms with and without a teacher were used to automatically adjust the parameters of quantum algorithms, including noise reduction and optimization parameters. The research was based on simulation of quantum operations on simulators and testing on real quantum processors. The use of machine learning methods made it possible to reduce the execution time of quantum algorithms by 20-30% while maintaining the accuracy of the result. In addition, learning optimization has reduced the need for quantum resources, such as the number of gates, which opens up opportunities for performing complex tasks on quantum devices with limited power. The use of such approaches has been demonstrated by the example of cryptographic analysis of the Shor algorithm. The results obtained show the effectiveness of integrating machine learning methods into the process of developing quantum algorithms. This opens up prospects for further research aimed at creating more powerful tools for cryptanalysis and other tasks. The study proves the feasibility of using machine learning to optimize quantum algorithms, improving their performance and expanding the scope of possible applications, including cryptographic analysis. В последние годы квантовые вычисления привлекают значительное внимание из-за своего потенциала решения сложных задач, недоступных классическим компьютерам. Одной из приоритетных областей применения квантовых алгоритмов является криптографический анализ, поскольку квантовые компьютеры способны эффективно взламывать такие широко используемые криптосистемы, как RSA и ECC. Однако разработка квантовых алгоритмов сталкивается с рядом трудностей, связанных с оптимизацией их структуры и параметров. В данном исследовании рассматривается применение методов машинного обучения (МО) для повышения эффективности квантовых алгоритмов в задачах криптографического анализа. Для достижения этой цели были использованы гибридные квантово-классические подходы, объединяющие преимущества квантовых вычислений и машинного обучения. Для автоматической настройки параметров квантовых алгоритмов, включая параметры шумоподавления и оптимизации, использовались алгоритмы обучения с учителем и без него. Исследование проводилось на основе моделирования квантовых операций на симуляторах и тестирования на реальных квантовых процессорах. Использование методов машинного обучения позволило сократить время выполнения квантовых алгоритмов на 20-30% при сохранении точности результата. Кроме того, оптимизация обучения снизила потребность в квантовых ресурсах, таких как количество вентилей, что открывает возможности для выполнения сложных задач на квантовых устройствах с ограниченной мощностью. Использование таких подходов продемонстрировано на примере криптографического анализа алгоритма Шора. Полученные результаты показывают эффективность интеграции методов машинного обучения в процесс разработки квантовых алгоритмов. Это открывает перспективы для дальнейших исследований, направленных на создание более мощных инструментов для криптоанализа и других задач. Исследование доказывает целесообразность использования машинного обучения для оптимизации квантовых алгоритмов, повышения их производительности и расширения сферы возможных приложений, включая криптографический анализ.

Environmental management issues•Aug 15, 2024•0 citations

Developing a Hardware Approach to Simulating Quantum Computing Using an Optimization Algorithm

Пуховский Валерий Николаевич, Sergey M. Gushanskiy, Viktor Potapov

In the past few decades, there has been an acute problem of creating a quantum computer that uses quantum mechanical effects such as quantum parallelism and quantum entanglement for computations. Using these mechanisms, the quantum computer is able to solve some of the NP-class problems in polynomial time. A hardware approach to modeling quantum computing is considered, and a general mathematical model of the operation of a quantum computer is described, and a technique for mathematical modeling of quantum computing is presented. At the stage of consideration of the method of mathematical modeling, the most resource-intensive parts of the model are indicated. Also, issues related to data parallelization on a hardware accelerator, which are planned to be used to simulate quantum computing, were considered, and algorithms for the operation of this type of accelerator were given. A more compact data format is proposed, which is recommended to be used when implementing the accelerator. Using the proposed format, it is possible to reduce the resources spent on elementary arithmetic operations. The possibility of introducing an optimization algorithm to minimize the time spent in computations, as well as to speed up the execution of quantum algorithms in simulators of a quantum computer at the stage of the effect of quantum gates on the quantum register model, is proposed. The results of the optimization algorithm and its comparison with the classical mathematical approach using a software model are presented.

Panhellenic Conference on Informatics•Nov 26, 2021•1 citation
Creating algorithms for quantum computing requires the ability to verify their results through the use of physical or mathematical models of quantum computer. Mathematical models are available to any developer, but their efficiency is too low to simulate the register with volume more than 12 bits. This article describes the structure and algorithms of developed 2-level model of increased efficiency. The enhanced algorithms for permutation of q-bits and QuIDD-graph synthesis by removing the bits of index of original matrix elements are proposed. The direction for further optimization for QuIDD techniques are defined.
Quantum computer simulation requires processing of huge-size matrixes containing several distinct elements. The most effective method of decreasing calculation costs for simulation was developed in the University of Michigan and was called Quantum Information Decision Diagrams. In order to improve the efficiency of the base QuIDD methodic this article covers its key aspects and advises level-wise recursive methods of QuIDD graph reduction and matrix member-wise operations. Methods set out in this article can be used for developing a graph-based mathematical model of a universal quantum computer, operating at the maximal dimension of the quantum register of about 50 q-bits.
A hardware approach for the quantum computing modeling was considered. A common mathematical model of the quantum computer was described; a methodic of mathematical modeling of the quantum computing was shown. During the mathematical methodic description the most resource-intensive parts of the model are allocated. Considered questions connected with data parallelizing with a hardware accelerator, which is used for quantum computer modeling. A common scheme of the accelerator’s work algorithm was shown. Suggested more compact data format for accelerator implementation, that will reduce time costs spent by elementary arithmetic operations. Proposed the use of the optimization algorithm for data minimization during the calculations in the phase of transforming model of quantum register with quantum gates in quantum computer simulators. Shown results of optimization algorithm execution and compared results with classic mathematical approach.
The paper describes the simplest technique for simulating a quantum algorithm based on the direct matrix representation of quantum operators.This approach is stable and precise, but it requires allocation of operator's matrices in the computer memory.Since the size of the operators grows exponentially, this approach is useful for simulating quantum algorithms with a relatively small number of qubits (e.g., approximately 11 qubits on a typical desktop computer).This approach enables relatively simple simulation of the operation of the solution quality control system and performance of a reliability analysis.A more efficient fast quality control simulation method is based on computing all or a part of operator matrices as needed on a current computational basis.This method makes it possible to avoid storing all or a part of the operator matrices.In this case, the number of qubits to be simulated (e.g., the number of input qubits or the number of qubits in the system state register) is affected by: (I) the exponential growth in the number of operations required to calculate the result of matrix products; and (II) the size of the state vector allocated in computer memory.It is reasonable if one embodiment of this approach involves simulating up to 19 or more qubits on typical desktop computer, and even more in a system with a vector architecture.Due to particularities of the memory addressing and access processes in a typical desktop computer (such as, for example, a Pentium PC), when a number of qubits is relatively small, the on-demand computing tends to be faster than the direct storage approach.The compute-on-demand approach benefits from applying the results of studying quantum operators and their structure that enables computing the matrix elements more efficiently.The paper considers effective simulation of Grover's quantum search algorithm using a computer with classical architecture.
Quantum-mechanical phenomena are playing an increasing role in information processing as transistor sizes approach the nanometer level, while the securest forms of communication rely on quantum data encoding. When they involve a finite number of basis states, these phenomena can be modeled as quantum circuits, the quantum analogue of conventional or classical logic circuits. Simulation of quantum circuits can therefore be used as a tool to evaluate issues in the design of quantum information processors. Unfortunately, simulating such phenomena efficiently is exceedingly difficult. The matrices representing quantum operators (gates) and vectors modeling quantum states grow exponentially with the number of quantum bits. The information represented by quantum states and operators often exhibits structure that can be exploited when simulating certain classes of quantum circuits. We study the development of simulation methods that run on classical computers and take advantage of such repetitions and redundancies. In particular, we define a new data structure for simulating quantum circuits called the quantum information decision diagram (QuIDD). A QuIDD is a compressed graph representation of a vector or matrix and permits computations to be performed directly on the compressed data. We develop a comprehensive set of algorithms for operating on QuIDDs in both the state-vector and density-matrix formats, and evaluate their complexity. These algorithms have been implemented in a general-purpose simulator program for quantum-mechanical applications called QuIDDPro. Through extensive experiments conducted on representative quantum simulation applications, including Grover's search algorithm, error characterization, and reversible circuits, we demonstrate that QuIDDPro is faster than other existing quantum-mechanical simulators such as the National Institute of Standards and Technology's QCSim program, and is far more memory-efficient. Using QuIDDPro, we explore the advantages of quantum computation over classical computation, simulate quantum errors and error correction, and study the impact of numerical precision on the fidelity of simulations. We also develop several novel algorithms for testing quantum circuit equivalence and compare them empirically. The QuIDDPro software is equipped with a user-friendly interface and is distributed with numerous example scripts. It has been used as a laboratory supplement for quantum computing courses at several universities.
In recent years, quantum computing has attracted considerable attention due to its potential to solve complex problems inaccessible to classical computers. One of the priority areas of application of quantum algorithms is cryptographic analysis, since quantum computers are able to effectively crack widely used cryptosystems such as RSA and ECC. However, the development of quantum algorithms faces a number of difficulties related to optimizing their structure and parameters. This study examines the application of machine learning (ML) methods to improve the efficiency of quantum algorithms in cryptographic analysis tasks. To achieve this goal, hybrid quantum-classical approaches were used, combining the advantages of quantum computing and machine learning. Learning algorithms with and without a teacher were used to automatically adjust the parameters of quantum algorithms, including noise reduction and optimization parameters. The research was based on simulation of quantum operations on simulators and testing on real quantum processors. The use of machine learning methods made it possible to reduce the execution time of quantum algorithms by 20-30% while maintaining the accuracy of the result. In addition, learning optimization has reduced the need for quantum resources, such as the number of gates, which opens up opportunities for performing complex tasks on quantum devices with limited power. The use of such approaches has been demonstrated by the example of cryptographic analysis of the Shor algorithm. The results obtained show the effectiveness of integrating machine learning methods into the process of developing quantum algorithms. This opens up prospects for further research aimed at creating more powerful tools for cryptanalysis and other tasks. The study proves the feasibility of using machine learning to optimize quantum algorithms, improving their performance and expanding the scope of possible applications, including cryptographic analysis. В последние годы квантовые вычисления привлекают значительное внимание из-за своего потенциала решения сложных задач, недоступных классическим компьютерам. Одной из приоритетных областей применения квантовых алгоритмов является криптографический анализ, поскольку квантовые компьютеры способны эффективно взламывать такие широко используемые криптосистемы, как RSA и ECC. Однако разработка квантовых алгоритмов сталкивается с рядом трудностей, связанных с оптимизацией их структуры и параметров. В данном исследовании рассматривается применение методов машинного обучения (МО) для повышения эффективности квантовых алгоритмов в задачах криптографического анализа. Для достижения этой цели были использованы гибридные квантово-классические подходы, объединяющие преимущества квантовых вычислений и машинного обучения. Для автоматической настройки параметров квантовых алгоритмов, включая параметры шумоподавления и оптимизации, использовались алгоритмы обучения с учителем и без него. Исследование проводилось на основе моделирования квантовых операций на симуляторах и тестирования на реальных квантовых процессорах. Использование методов машинного обучения позволило сократить время выполнения квантовых алгоритмов на 20-30% при сохранении точности результата. Кроме того, оптимизация обучения снизила потребность в квантовых ресурсах, таких как количество вентилей, что открывает возможности для выполнения сложных задач на квантовых устройствах с ограниченной мощностью. Использование таких подходов продемонстрировано на примере криптографического анализа алгоритма Шора. Полученные результаты показывают эффективность интеграции методов машинного обучения в процесс разработки квантовых алгоритмов. Это открывает перспективы для дальнейших исследований, направленных на создание более мощных инструментов для криптоанализа и других задач. Исследование доказывает целесообразность использования машинного обучения для оптимизации квантовых алгоритмов, повышения их производительности и расширения сферы возможных приложений, включая криптографический анализ.
In the past few decades, there has been an acute problem of creating a quantum computer that uses quantum mechanical effects such as quantum parallelism and quantum entanglement for computations. Using these mechanisms, the quantum computer is able to solve some of the NP-class problems in polynomial time. A hardware approach to modeling quantum computing is considered, and a general mathematical model of the operation of a quantum computer is described, and a technique for mathematical modeling of quantum computing is presented. At the stage of consideration of the method of mathematical modeling, the most resource-intensive parts of the model are indicated. Also, issues related to data parallelization on a hardware accelerator, which are planned to be used to simulate quantum computing, were considered, and algorithms for the operation of this type of accelerator were given. A more compact data format is proposed, which is recommended to be used when implementing the accelerator. Using the proposed format, it is possible to reduce the resources spent on elementary arithmetic operations. The possibility of introducing an optimization algorithm to minimize the time spent in computations, as well as to speed up the execution of quantum algorithms in simulators of a quantum computer at the stage of the effect of quantum gates on the quantum register model, is proposed. The results of the optimization algorithm and its comparison with the classical mathematical approach using a software model are presented.