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

Panhellenic Conference on Informatics

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

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

Published Nov 26, 2021• 1 citation
Publisher

Abstract

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.

DOI
10.1145/3503823.3503894

Related papers

Method of Modeling Quantum Computations Using a Hardware Accelerator

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

During the study, software techniques for optimizing the quantum computer model were considered. The main goal of techniques that increase the efficiency of modeling is to reduce the amount of data that must be processed when modeling quantum gates. The most suitable algorithm for implementing a hardware accelerator was considered and modeled in the experimental part. Algorithms of graph theory or decision diagrams are not very suitable for this task, since their implementation will require the implementation of tensor matrix products, which is more convenient to do on a software simulator. It is also worth noting the increasingly growing interest in modeling quantum computing on special hardware, such as video cards or supercomputers. Therefore, the technique presented in the work is relevant, because it combines software solutions in the field of optimization over the past few years and recently studied methods for modeling quantum computing.

International Russian Automation Conference (RusAutoCon)•Sep 1, 2020•1 citation

Development and Research of a Quantum Control System for the Computational Process and the Execution of Algorithms

Sergey M. Gushanskiy, Viktor Potapov, Н М Коробейникова

Currently, the theory of quantum computing is actively developing. Despite the fact that a quantum computer has some features, any algorithm designed for a classical computer can be implemented for a quantum one. The relevance of the topic of quantum computers is confirmed by the fact that even now banking systems, cryptography and encryption of information require enormous resources of computing systems, these are just some examples, but the most important and vivid ones that relate to the everyday life of a huge part of the world's population. A hardware computing core has been developed and simulated, which is the main part of an accelerator based on field-programmable gate array with computer aided design Altera Quartus. Considering the obtained time dependence of the number of cycles required for the impact of a single-qubit quantum gate on a quantum register on the number of qubits and parallel arithmetic logic units in the hardware computing core, when simulating quantum computing, a method was developed to determine the increase in hardware performance and ways to improve the performance of an accelerator based on a hardware computing core were developed. based on field-programmable gate array.

International Russian Automation Conference (RusAutoCon)•Sep 10, 2023•0 citations

DEVELOPMENT OF METHODS OF OPTIMIZATION AND PARALLELIZATION OF COMPUTATIONAL PROCESSES IN QUANTUM ACCELERATORS

S. M. Gushanskiy, Viktor Potapov, Божич Владимир Иванович

Recently, there has been a rapid increase in interest in quantum computers. Their work isbased on the use of quantum-mechanical phenomena such as superposition and entanglement forcomputing to transform input data into outputs that can actually provide effective performance3–4 orders of magnitude higher than any modern computing devices, which will allow solving theabove and others. tasks in real- and accelerated-time scale. This article is devoted to solving theproblem of research and development of methods for optimizing quantum computing within theframework of the application of quantum accelerators. A block diagram of a hardware acceleratoris proposed to increase the performance of simulated quantum computing. The development of thestructural diagram of the communication module of the hardware accelerator and the softwaremodel was carried out. The relevance of these studies lies in mathematical and software modelingand implementation of correction codes for correcting several types of quantum errors in the developmentand implementation of quantum algorithms for solving classes of problems of a classicalnature. The scientific novelty of this direction is expressed in the elimination of one of the disadvantagesof the quantum computational process. The scientific novelty of this area is primarilyexpressed in the constant updating and supplementation of the field of quantum research in anumber of areas, and the computer simulation of quantum physical phenomena and features ispoorly covered in the world.

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

Genetic Algorithm Based Quantum Circuits Optimization for Quantum Computing Simulation

Wei Lü, Zhong Ma, Yuqing Cheng +1 more

Quantum computing simulation platform can simulate the computation results of the quantum computer based on traditional computers, which is an effective way to promote the development of quantum computing software, algorithms and hardware at the current immature stage of the real quantum computer. Since quantum computers have exponential calculation acceleration compared with traditional computers, the main problems in implementing quantum computing simulation on traditional computers are low computational efficiency and long time-consuming. A quantum circuit which is a sequence of quantum gates acting on a collection of qubits is the general quantum computing model. So by the means of quantum circuit optimization, the calculation speed can be significantly increased while keeping the calculation result unchanged. The existing empirical rules of quantum circuit optimization methods have limitations and there is no common and automatic quantum circuit optimization method. In this paper, a general and automatic quantum circuit optimization method based on the genetic algorithm is proposed, by which the equivalent optimal quantum circuit is obtained through a finite number of searching in a large searching space. This method is not limited by the hardware of the quantum computing simulation and the composition of the quantum circuit. The experimental results show that for the QFT algorithm of 29 qubits, the running time can be shortened by 41.4% and for the variational circuit of 6 qubits, the running time can be shortened by 18.8% compared with the state-of-the-art quantum circuit optimization method. So this method can improve the quantum computing simulation capability and operating efficiency and provide a rapid development way for quantum algorithms and applications.

International Conference on Information, Intelligence, Systems & Applications (IISA)•Jul 12, 2021•4 citations

Developing a Grover's quantum algorithm emulator on standalone FPGAs: optimization and implementation

S. Choi, Woojoo Lee

Quantum computing (QC) leverages superposition, entanglement, and parallelism to solve complex problems that are challenging for classical computing methods. The immense potential of QC has spurred explosive interest and research in both academia and industry. However, the practicality of QC based on large-scale quantum computers remains limited by issues of scalability and error correction. To bridge this gap, QC emulators utilizing classical computing resources have emerged, with modern implementations employing FPGAs for efficiency. Nevertheless, FPGA-based QC emulators face significant limitations, particularly in standalone implementations required for low-power, low-performance devices like IoT end nodes, embedded systems, and wearable devices, due to their substantial resource demands. This paper proposes optimization techniques to reduce resource requirements and enable standalone FPGA implementations of QC emulators. We specifically focused on Grover's algorithm, known for its excellent performance in searching unstructured databases. The proposed resource-saving optimization techniques allow for the emulation of the largest possible Grover's algorithm within the constrained resources of FPGAs. Using these optimization techniques, we developed a hardware accelerator for Grover's algorithm and integrated it with a RISC-V processor architecture. We completed a standalone Grover's algorithm-specific emulator operating on FPGAs, demonstrating significant performance enhancements and resource savings afforded by the proposed techniques.

AIMS Mathematics•Jan 1, 2024•5 citations

Efficient quantum computing simulation through dynamic matrix restructuring and distributed evaluation

Kareem S. Aggour, Robert M. Mattheyses, Joseph Shultz

Quantum computing has the potential to revolutionize the field of computing, but with hardware and algorithms unlike any in use today. Due to the primitive state of existing quantum hardware, simulation is one of the most effective methods for studying quantum computing issues. Our team previously developed a general-purpose simulator capable of modeling arbitrary quantum algorithms executing on any hardware device. The simulator performs over a thousand matrix multiplications per step as part of its operations. To improve the simulator performance, optimizations were designed to dynamically restructure the problem. The resulting calculations were then distributed across a cluster. These enhancements reduced both the order of the simulator operations and the memory overhead, achieving an overall performance improvement of 99.94% from the initial implementation of a key quantum algorithm, reducing the simulator run time for this algorithm from two days on a single processor to under two minutes on a cluster.

IEEE International Conference on Cluster Computing (CLUSTER)•Jan 1, 2007•2 citations
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.
During the study, software techniques for optimizing the quantum computer model were considered. The main goal of techniques that increase the efficiency of modeling is to reduce the amount of data that must be processed when modeling quantum gates. The most suitable algorithm for implementing a hardware accelerator was considered and modeled in the experimental part. Algorithms of graph theory or decision diagrams are not very suitable for this task, since their implementation will require the implementation of tensor matrix products, which is more convenient to do on a software simulator. It is also worth noting the increasingly growing interest in modeling quantum computing on special hardware, such as video cards or supercomputers. Therefore, the technique presented in the work is relevant, because it combines software solutions in the field of optimization over the past few years and recently studied methods for modeling quantum computing.
Currently, the theory of quantum computing is actively developing. Despite the fact that a quantum computer has some features, any algorithm designed for a classical computer can be implemented for a quantum one. The relevance of the topic of quantum computers is confirmed by the fact that even now banking systems, cryptography and encryption of information require enormous resources of computing systems, these are just some examples, but the most important and vivid ones that relate to the everyday life of a huge part of the world's population. A hardware computing core has been developed and simulated, which is the main part of an accelerator based on field-programmable gate array with computer aided design Altera Quartus. Considering the obtained time dependence of the number of cycles required for the impact of a single-qubit quantum gate on a quantum register on the number of qubits and parallel arithmetic logic units in the hardware computing core, when simulating quantum computing, a method was developed to determine the increase in hardware performance and ways to improve the performance of an accelerator based on a hardware computing core were developed. based on field-programmable gate array.
Recently, there has been a rapid increase in interest in quantum computers. Their work isbased on the use of quantum-mechanical phenomena such as superposition and entanglement forcomputing to transform input data into outputs that can actually provide effective performance3–4 orders of magnitude higher than any modern computing devices, which will allow solving theabove and others. tasks in real- and accelerated-time scale. This article is devoted to solving theproblem of research and development of methods for optimizing quantum computing within theframework of the application of quantum accelerators. A block diagram of a hardware acceleratoris proposed to increase the performance of simulated quantum computing. The development of thestructural diagram of the communication module of the hardware accelerator and the softwaremodel was carried out. The relevance of these studies lies in mathematical and software modelingand implementation of correction codes for correcting several types of quantum errors in the developmentand implementation of quantum algorithms for solving classes of problems of a classicalnature. The scientific novelty of this direction is expressed in the elimination of one of the disadvantagesof the quantum computational process. The scientific novelty of this area is primarilyexpressed in the constant updating and supplementation of the field of quantum research in anumber of areas, and the computer simulation of quantum physical phenomena and features ispoorly covered in the world.
Quantum computing simulation platform can simulate the computation results of the quantum computer based on traditional computers, which is an effective way to promote the development of quantum computing software, algorithms and hardware at the current immature stage of the real quantum computer. Since quantum computers have exponential calculation acceleration compared with traditional computers, the main problems in implementing quantum computing simulation on traditional computers are low computational efficiency and long time-consuming. A quantum circuit which is a sequence of quantum gates acting on a collection of qubits is the general quantum computing model. So by the means of quantum circuit optimization, the calculation speed can be significantly increased while keeping the calculation result unchanged. The existing empirical rules of quantum circuit optimization methods have limitations and there is no common and automatic quantum circuit optimization method. In this paper, a general and automatic quantum circuit optimization method based on the genetic algorithm is proposed, by which the equivalent optimal quantum circuit is obtained through a finite number of searching in a large searching space. This method is not limited by the hardware of the quantum computing simulation and the composition of the quantum circuit. The experimental results show that for the QFT algorithm of 29 qubits, the running time can be shortened by 41.4% and for the variational circuit of 6 qubits, the running time can be shortened by 18.8% compared with the state-of-the-art quantum circuit optimization method. So this method can improve the quantum computing simulation capability and operating efficiency and provide a rapid development way for quantum algorithms and applications.
Quantum computing (QC) leverages superposition, entanglement, and parallelism to solve complex problems that are challenging for classical computing methods. The immense potential of QC has spurred explosive interest and research in both academia and industry. However, the practicality of QC based on large-scale quantum computers remains limited by issues of scalability and error correction. To bridge this gap, QC emulators utilizing classical computing resources have emerged, with modern implementations employing FPGAs for efficiency. Nevertheless, FPGA-based QC emulators face significant limitations, particularly in standalone implementations required for low-power, low-performance devices like IoT end nodes, embedded systems, and wearable devices, due to their substantial resource demands. This paper proposes optimization techniques to reduce resource requirements and enable standalone FPGA implementations of QC emulators. We specifically focused on Grover's algorithm, known for its excellent performance in searching unstructured databases. The proposed resource-saving optimization techniques allow for the emulation of the largest possible Grover's algorithm within the constrained resources of FPGAs. Using these optimization techniques, we developed a hardware accelerator for Grover's algorithm and integrated it with a RISC-V processor architecture. We completed a standalone Grover's algorithm-specific emulator operating on FPGAs, demonstrating significant performance enhancements and resource savings afforded by the proposed techniques.
Quantum computing has the potential to revolutionize the field of computing, but with hardware and algorithms unlike any in use today. Due to the primitive state of existing quantum hardware, simulation is one of the most effective methods for studying quantum computing issues. Our team previously developed a general-purpose simulator capable of modeling arbitrary quantum algorithms executing on any hardware device. The simulator performs over a thousand matrix multiplications per step as part of its operations. To improve the simulator performance, optimizations were designed to dynamically restructure the problem. The resulting calculations were then distributed across a cluster. These enhancements reduced both the order of the simulator operations and the memory overhead, achieving an overall performance improvement of 99.94% from the initial implementation of a key quantum algorithm, reducing the simulator run time for this algorithm from two days on a single processor to under two minutes on a cluster.