Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Numerical characteristics of quantum computer simulation

Andrey Yu. Chernyavskiy, Kamil Khamitov, Alexey Teplov, Владимир Валентинович Воеводин, Владимир Валентинович Воеводин

Published Dec 30, 2016• 0 citations

Abstract

The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

DOI: 10.1117/12.2267077

Related papers

Properties of the numerical algorithms for problems of quantum information technologies: Benefits of deep analysis

Andrey Yu. Chernyavskiy, Kamil Khamitov, Alexey Teplov +2 more

In recent years, quantum information technologies (QIT) showed great development, although, the way of the implementation of QIT faces the serious difficulties, some of which are challenging computational tasks. This work is devoted to the deep and broad analysis of the parallel algorithmic properties of such tasks. As an example we take one- and two-qubit transformations of a many-qubit quantum state, which are the most critical kernels of many important QIT applications. The analysis of the algorithms uses the methodology of the AlgoWiki project (algowiki-project.org) and consists of two parts: theoretical and experimental. Theoretical part includes features like sequential and parallel complexity, macro structure, and visual information graph. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia) and includes the analysis of locality and memory access, scalability and the set of more specific dynamic characteristics of realization. This approach allowed us to obtain bottlenecks and generate ideas of efficiency improvement.

AIP conference proceedingsJan 1, 20160 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 WorkshopsJan 1, 20040 citations

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, 20201 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, 20230 citations

Building an effective general-purpose quantum simulator for the design and analysis of quantum circuits

Michael Anshel, Anh Quoc Nguyen

Recently quantum computing has achieved significant results both in theoretical and experimental areas and quantum algorithms have drawn the attention of many scientists. At the present there exist several experiments that realized some parts of certain important quantum algorithms. While those experiments work with only up to seven qubits, quantum simulators allow scientists to design algorithms with many more qubits. The existing simulators have one or more of the following restrictions: either they require powerful computers and additional computation packages such as Matlab or Mathematica or they don't provide an easy method for interacting between the classical and quantum parts of an algorithm. More importantly, none of them can simulate a generic 64-qubit circuit. It is important at this stage of quantum computing development to investigate technological improvements in simulating quantum circuit design. In this thesis we developed a specialized data structure, QSV, for quantum simulators along with new method for calculation of the new state vector after application of a quantum gate in a quantum simulator. We also developed a technique that speeds up the simulation time with our QSV vectors. With those results we built a quantum simulator that overcomes many shortcomings in other simulators and it has many advanced features. Our simulator can simulate many 64-qubit circuits and it can directly simulate multiple qubit gates as well as allows users to define gates with up to 10 qubits. The simulation time is much less in comparison with other simulators we tested. The simulator defines specifications so that users can easily design and test quantum circuits. With the simulator we also developed some new quantum circuits and verified many designs and constructions.

Jan 1, 20060 citations

A Parallel Quantum Computer Simulator

James E Fischer

The unique principles of quantum mechanics may one day enable computers to perform operations that would be impossible on a classical computer. Although no one knows whether it will be possible to build a large-scale, functional, and stable quantum computer, researchers can study quantum-mechanical systems and develop algorithms and circuits by simulating quantum systems in software. Performance and memory bottlenecks prevent most current quantum computer simulators from being able to simulate quantum systems that are large enough to be useful. In this thesis, we develop a matrix-free sequential quantum computer simulator to vastly improve both time and memory performance of sequential code on a single processor. Next, we distribute the matrix-free algorithm over multiple parallel processors using the Message Passing Interface in order to simulate quantum systems that are too large to reside wholly within the memory of a single processor. Finally, we simulate various quantum circuits using the Hamming high-performance computing cluster in order to conduct algorithmic analysis.

Sep 1, 20160 citations