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

Advances in intelligent systems and computing

Development Method of Building a Modular Simulator of Quantum Computations and Algorithms

Vyacheslav F. Guzik, Sergey M. Gushanskiy, Viktor Potapov

Published Jan 1, 2019• 0 citations
Publisher
DOI
10.1007/978-3-030-30329-7_3

Related papers

Title: Dynamically Generated Modular Quantum Circuit Design

Jincheng Zhang

This paper introduces a novel algorithm for the automatic generation of modular quantum circuits. The core aim is to provide a framework for designing complex quantum circuits with precise properties and constraints, significantly accelerating the design process. The algorithm utilizes a generative approach, starting with a set of rules and constraints and iteratively building circuits based on these parameters. This method offers a significant advantage over traditional circuit design techniques, allowing for the creation of circuits tailored to specific requirements. The algorithm's efficiency and flexibility make it potentially transformative for applications within quantum computing, simulations, and cryptography.

•Sep 6, 2026•0 citations

The Computational Structure of the Quantum Computer Simulator and Its Performance Evaluation

Viktor Potapov, Sergey M. Gushanskiy, Vyacheslav F. Guzik +1 more

Advances in intelligent systems and computing•May 16, 2018•15 citations

Simulation of Quantum Computation

Tzvetan S. Metodi, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2006•0 citations

Development and simulation of the quantum microarchitecture operation using an optimization algorithm for a quantum calculation process

Viktor Potapov, S.M. Gushansky

The theory of quantum computing is being actively developed. Despite the fact that quantum computing device has some peculiarities, any task designed for a classical computer can be reproduced on a quantum system. The aim of the research is to develop a methodology for constructing models of quantum systems simulators using hardware simulators. The subject of this research is methods for constructing quantum computing devices and systems. In the course of the research, the system analysis methods and computer modeling, methods of object-oriented design were used. Modern high-level languages were used to solve the problems of constructing a modular quantum system with an open architecture. The work of a quantum microarchitecture using an algorithm for optimizing a quantum computational process has been developed and modeled. A universal methodology for modeling algorithms of a quantum nature using the hardware core and requirements for the mutual operation of software and hardware components for the efficient operation of a quantum system is derived.

The Herald of the Siberian State University of Telecommunications and Information Science•Dec 18, 2021•0 citations

Quantum Modular Multiplication: A New Frontier in Quantum Computing

Mahankali Mani Teja, J. V. R. Ravindra, Sunku Rohan Sanjay Reddy +1 more

Quantum modular multipliers are a promising development in the field of quantum computing that aim to perform modular multiplication faster and more efficiently than classical algorithms. This is achieved by encoding the numbers being multiplied into quantum bits (qubits) and using quantum gates to manipulate them in a way that represents the calculation. Since quantum physics principles like superposition and entanglement dramatically speed up processing compared to conventional computing, many calculations may be run simultaneously. Quantum modular multipliers have the potential to have a significant impact in a range of fields, including cryptography and beyond, since they offer a faster and more efficient way to do modular multiplications. Several fields, including simulation, optimization, and cryptography, can benefit from the use of quantum computing.One of the crucial operations in many of these applications is modular multiplication, a sort of multiplication that requires obtaining the remainder of the product of two numbers when divided by a third number. In this paper, we provide a novel modular multiplication method based on a quantum algorithm. To examine its complexity and compare it to that of current adders, we employ a novel form of adder that is intended to not retain the final carry. This adder's decrease percentage in terms of gates and depth is roughly 70%. Our method takes advantage of the special qualities of qubits to complete the computation significantly more quickly than conventional algorithms. It is based on the fundamental ideas of quantum physics, such as superposition and entanglement.

IEEE International Conference for Convergence in Technology (I2CT)•Apr 7, 2023•0 citations

Simulation of Quantum Computation

Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2011•1 citation
This paper introduces a novel algorithm for the automatic generation of modular quantum circuits. The core aim is to provide a framework for designing complex quantum circuits with precise properties and constraints, significantly accelerating the design process. The algorithm utilizes a generative approach, starting with a set of rules and constraints and iteratively building circuits based on these parameters. This method offers a significant advantage over traditional circuit design techniques, allowing for the creation of circuits tailored to specific requirements. The algorithm's efficiency and flexibility make it potentially transformative for applications within quantum computing, simulations, and cryptography.
The theory of quantum computing is being actively developed. Despite the fact that quantum computing device has some peculiarities, any task designed for a classical computer can be reproduced on a quantum system. The aim of the research is to develop a methodology for constructing models of quantum systems simulators using hardware simulators. The subject of this research is methods for constructing quantum computing devices and systems. In the course of the research, the system analysis methods and computer modeling, methods of object-oriented design were used. Modern high-level languages were used to solve the problems of constructing a modular quantum system with an open architecture. The work of a quantum microarchitecture using an algorithm for optimizing a quantum computational process has been developed and modeled. A universal methodology for modeling algorithms of a quantum nature using the hardware core and requirements for the mutual operation of software and hardware components for the efficient operation of a quantum system is derived.
Quantum modular multipliers are a promising development in the field of quantum computing that aim to perform modular multiplication faster and more efficiently than classical algorithms. This is achieved by encoding the numbers being multiplied into quantum bits (qubits) and using quantum gates to manipulate them in a way that represents the calculation. Since quantum physics principles like superposition and entanglement dramatically speed up processing compared to conventional computing, many calculations may be run simultaneously. Quantum modular multipliers have the potential to have a significant impact in a range of fields, including cryptography and beyond, since they offer a faster and more efficient way to do modular multiplications. Several fields, including simulation, optimization, and cryptography, can benefit from the use of quantum computing.One of the crucial operations in many of these applications is modular multiplication, a sort of multiplication that requires obtaining the remainder of the product of two numbers when divided by a third number. In this paper, we provide a novel modular multiplication method based on a quantum algorithm. To examine its complexity and compare it to that of current adders, we employ a novel form of adder that is intended to not retain the final carry. This adder's decrease percentage in terms of gates and depth is roughly 70%. Our method takes advantage of the special qualities of qubits to complete the computation significantly more quickly than conventional algorithms. It is based on the fundamental ideas of quantum physics, such as superposition and entanglement.