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

The Herald of the Siberian State University of Telecommunications and Information Science

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

Viktor Potapov, S.M. Gushansky

Published Dec 18, 2021• 0 citations
Publisher

Abstract

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.

DOI
10.55648/1998-6920-2021-15-4-76-83

Related papers

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

The Methodology of Implementation and Simulation of Quantum Algorithms and Processes

Sergey M. Gushanskiy, Maxim Polenov, Victor Potapov

This paper describes a detailed analysis of the fundamental components involved in the quantum algorithms design in accordance with the narrowly defined software and hardware for the implementation of quantum algorithms and the stages of their design. A modular development and subsequent simulation of the process of super dense quantum coding and quantum teleportation was realized. In accordance with the use of vector and matrix algebra, within the framework of quantum algorithms, the “quantum” software is defined. This software consists of quantum intermediate representation of information, quantum language of physical operations and quantum assembler. The software environment for quantum algorithms design and further implementation according to the defined stages is proposed and considered.

IEEE International Conference on Application of Information and Communication Technologies (AICT)•Sep 1, 2017•15 citations

Engineering quantum computing technologies: from compact modelling to applications

Giovanni Amedeo Cirillo

Quantum computing could impact Society and Industry in an unprecedented way, especially in critical domains, such as optimization problem solving, computational chemistry and artificial intelligence.Properties of quantum mechanics, such as superposition and entanglement, can be exploited to define problem-specific quantum algorithms with lower computational complexity than their best corresponding classical counterparts.A common limitation of quantum computers is the presence of hardware non-idealities, such as decoherence, dramatically affecting performance and reliability.In any case, efforts in improving hardware and investigating short and long-term quantum algorithms can be already done.The goal of this doctorate thesis is to explore different levels of quantum computing engineering, from devices to applications.In particular, the attention was focused on two activities: the definition of a compact-model-based simulation methodology for quantum technologies for the general-purpose quantum circuit model and the proposal of an approach for solving the users scheduling optimization problem in Joint-Transmission-based wireless communication systems, exploiting the quantumcompliant Quadratic Unconstrained Binary Optimization (QUBO) formalism.Classical simulation of quantum computers allows a preliminary estimation of their capabilities in specific applications.Canonical simulation of qubits affected by non-ideality phenomena requires solving the computationally expensive Lindblad master equation.A compact model of a quantum technology, obtained through fitting operations or specific mimic algorithms, is thought to describe qubits evolution under quantum gates, taking into account the device-characteristic physical parameters and not numerically solving Lindblad equation, thus permitting faster and more scalable simulations.Compact models of two families of spin-based molecular quantum computers, switch-based and Nuclear Magnetic Resonance, were developed, both involving two other general non-ideality models: decoherence and off-resonance of untargeted qubits.A quantum circuits simulator, involving all these compact models and interfaceable with OpenQASM 2.0 language, was entirely developed in MATLAB.The compact model approximations were compared with either results already available in the state of art or through numerical simulations with consolidated formalisms, at both Hamiltonian and circuit levels.The achieved results give evidence that the proposed simulation methodology provides iii results fast and close to the references, thus paving the way for fast and reliable technology-dependent quantum circuits simulation.Joint Transmission (JT) is a modern mechanism for Multiple-Input-Multiple-Output (MIMO) wireless communication systems, where multiple antennas co-operate to transmit signals to users with minimized interference.An optimization problem, looking for the best users subset servable in JT, can be defined.In a practical scenario, this cannot be efficiently solved with a brute-force-only approach, since it could imply a too high number of combinations.This thesis presents a strategy for solving the JT optimization problem, based on a QUBO model, which is responsible of a first selection of users among all available.The subset selected with QUBO is then brute-force explored, to find the best solution.In all executed tests, the obtained results permit to say that the proposed method achieves a quite good compromise between solution quality and total execution time.Even though the obtained results in both contexts can still be further expanded and improved, they are quite encouraging and prove that these research activities, if continued in the future, can help in improving quantum computing engineering, at both hardware and software levels, with the hope that it can concretely solve problems of interest for Society and Industry. Part I Introductory chapters 1 BackgroundIn this first section, an intuitive description of the main actors of quantum computing is provieded, with a historical timeline with the milestones of this computational paradigm.

•Jul 22, 2022•0 citations

A software methodology for compiling quantum programs

Thomas Häner, Damian S. Steiger, Krysta M. Svore +1 more

Abstract Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions. We describe the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow. For each layer of the stack, we discuss the underlying methods for compilation and optimization. Our software methodology facilitates more rapid innovation among quantum algorithm designers, quantum hardware engineers, and experimentalists. It enables scalable compilation of complex quantum algorithms and can be targeted to any specific quantum hardware implementation.

arXiv:1604.01401•Quantum Science and Technology•Jan 8, 2018•188 citations

Quantum Computers and Their Simulation.

Thomas Lippert

Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.

ARCS Workshops•Jan 1, 2004•0 citations

A quantum computer architecture perspective: executing quantum applications on real quantum processors

Carmen G. Almudéver

Building a quantum computer is not only about having qubits or quantum processors, analogously to classical computers are not only based on transistors or integrated circuits. Accordingly, in the very recent times, a few unique research groups in academia and companies have been exploring and proposing high-level and low-level programming languages, compilers, microarchitecture and instruction set architectures for quantum computation as well as different computer architecture approaches. In other words, developing a quantum computer requires bridging quantum applications and quantum devices. This talk will address the main challenges of building a scalable full-stack quantum computing system followed by a discussion on its architecture focusing on fault tolerance and compilation of quantum algorithms on NISQ devices. I will also provide my vision on how the research community could accelerate the process towards building such a scalable quantum machine, potentially through vertical cross-layer co-design structured methodologies.

Photonics for Quantum (PfQ)•Aug 27, 2021•1 citation
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.
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.
This paper describes a detailed analysis of the fundamental components involved in the quantum algorithms design in accordance with the narrowly defined software and hardware for the implementation of quantum algorithms and the stages of their design. A modular development and subsequent simulation of the process of super dense quantum coding and quantum teleportation was realized. In accordance with the use of vector and matrix algebra, within the framework of quantum algorithms, the “quantum” software is defined. This software consists of quantum intermediate representation of information, quantum language of physical operations and quantum assembler. The software environment for quantum algorithms design and further implementation according to the defined stages is proposed and considered.
Quantum computing could impact Society and Industry in an unprecedented way, especially in critical domains, such as optimization problem solving, computational chemistry and artificial intelligence.Properties of quantum mechanics, such as superposition and entanglement, can be exploited to define problem-specific quantum algorithms with lower computational complexity than their best corresponding classical counterparts.A common limitation of quantum computers is the presence of hardware non-idealities, such as decoherence, dramatically affecting performance and reliability.In any case, efforts in improving hardware and investigating short and long-term quantum algorithms can be already done.The goal of this doctorate thesis is to explore different levels of quantum computing engineering, from devices to applications.In particular, the attention was focused on two activities: the definition of a compact-model-based simulation methodology for quantum technologies for the general-purpose quantum circuit model and the proposal of an approach for solving the users scheduling optimization problem in Joint-Transmission-based wireless communication systems, exploiting the quantumcompliant Quadratic Unconstrained Binary Optimization (QUBO) formalism.Classical simulation of quantum computers allows a preliminary estimation of their capabilities in specific applications.Canonical simulation of qubits affected by non-ideality phenomena requires solving the computationally expensive Lindblad master equation.A compact model of a quantum technology, obtained through fitting operations or specific mimic algorithms, is thought to describe qubits evolution under quantum gates, taking into account the device-characteristic physical parameters and not numerically solving Lindblad equation, thus permitting faster and more scalable simulations.Compact models of two families of spin-based molecular quantum computers, switch-based and Nuclear Magnetic Resonance, were developed, both involving two other general non-ideality models: decoherence and off-resonance of untargeted qubits.A quantum circuits simulator, involving all these compact models and interfaceable with OpenQASM 2.0 language, was entirely developed in MATLAB.The compact model approximations were compared with either results already available in the state of art or through numerical simulations with consolidated formalisms, at both Hamiltonian and circuit levels.The achieved results give evidence that the proposed simulation methodology provides iii results fast and close to the references, thus paving the way for fast and reliable technology-dependent quantum circuits simulation.Joint Transmission (JT) is a modern mechanism for Multiple-Input-Multiple-Output (MIMO) wireless communication systems, where multiple antennas co-operate to transmit signals to users with minimized interference.An optimization problem, looking for the best users subset servable in JT, can be defined.In a practical scenario, this cannot be efficiently solved with a brute-force-only approach, since it could imply a too high number of combinations.This thesis presents a strategy for solving the JT optimization problem, based on a QUBO model, which is responsible of a first selection of users among all available.The subset selected with QUBO is then brute-force explored, to find the best solution.In all executed tests, the obtained results permit to say that the proposed method achieves a quite good compromise between solution quality and total execution time.Even though the obtained results in both contexts can still be further expanded and improved, they are quite encouraging and prove that these research activities, if continued in the future, can help in improving quantum computing engineering, at both hardware and software levels, with the hope that it can concretely solve problems of interest for Society and Industry. Part I Introductory chapters 1 BackgroundIn this first section, an intuitive description of the main actors of quantum computing is provieded, with a historical timeline with the milestones of this computational paradigm.
Abstract Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions. We describe the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow. For each layer of the stack, we discuss the underlying methods for compilation and optimization. Our software methodology facilitates more rapid innovation among quantum algorithm designers, quantum hardware engineers, and experimentalists. It enables scalable compilation of complex quantum algorithms and can be targeted to any specific quantum hardware implementation.
Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.
Building a quantum computer is not only about having qubits or quantum processors, analogously to classical computers are not only based on transistors or integrated circuits. Accordingly, in the very recent times, a few unique research groups in academia and companies have been exploring and proposing high-level and low-level programming languages, compilers, microarchitecture and instruction set architectures for quantum computation as well as different computer architecture approaches. In other words, developing a quantum computer requires bridging quantum applications and quantum devices. This talk will address the main challenges of building a scalable full-stack quantum computing system followed by a discussion on its architecture focusing on fault tolerance and compilation of quantum algorithms on NISQ devices. I will also provide my vision on how the research community could accelerate the process towards building such a scalable quantum machine, potentially through vertical cross-layer co-design structured methodologies.