Journal of Physics Conference Series

A new method of simulations for the propagators of multi-qubit registers

M. V. Bastrakova, N. V. Klenov, Сатанин Аркадий Михайлович

Published Feb 1, 2019• 0 citations

Abstract

A numerical method of simulations for the evolution operators (propagators) of coupled qubits was developed on the basis of Magnus representation. The propagator of a multi-qubit system can be expressed by a N × N matrix whose size increases as N = 2 n with the number of qubits n . Therefore, the standard approach to the propagator calculation requires the involvement of numerically expensive procedures. We have shown that the calculations of the propagator at the current time can be reduced to the inversion of the Vandermonde matrix, which occurs when constructing interpolation polynomials. In this case, due to the recurrence relations, the number of required flops increases only as ∼ O ( N 2 ) (in opposite to ∼ O ( N 3 ) flops for the matrix of the general form). This fact allows us to speed up the calculation of the propagator for multi-qubit systems.

DOI: 10.1088/1742-6596/1163/1/012076

Related papers

Manipulations with qubit states by short control pulses: the interpolation method for evolution operator and fidelity

M. V. Denisenko, N. V. Klenov, Сатанин Аркадий Михайлович

In this article the dynamics of the qubits states based on solution of the time-dependent Schrödinger equation is investigated. Using the Magnus method we obtain an explicit interpolation representation for the propagator, which allows to find wave function at an arbitrary time. To illustrate the effectiveness of the approach, the population of the levels a single and two coupled qubits have been calculated by applying the Magnus propagator and the result have been compared with the numerical solution of the Schrödinger equation. As a measure of the approximation of the wave function, we calculate fidelity, which indicates proximity when the exact and approximate evolution operator acts on the initial state. We discuss the possibility of extending the developed methods to multi-qubits system, when high-speed calculation methods of the operators of evolution is particularly relevant.

Journal of Physics Conference SeriesJan 1, 20182 citations

Dynamics of Qubits in the Field of Unipolar Pulses: Magnus Propagator, Generalized Area Theorem, and Motion on Groups

M. V. Denisenko, N. V. Klenov, Сатанин Аркадий Михайлович

Abstract The problem of speeding up quantum computations through controlling the states of qubits by short large-amplitude unipolar pulses is discussed. A new method is proposed to describe the dynamics of qubits that is based on the Magnus representation for the evolution operator (propagator) of qubits, which allows one to find a solution to the quantum control problem outside the framework of perturbation theory. The evolution of the states of a multiqubit system is represented as a motion on a special unitary group SU(N), similar to the rotation of the Bloch vector on the group SU(2) in the case of a single qubit. As an example, unitary transformations of single-qubit states under different excitation modes are considered. A general formula is found that establishes a relation between the shape of a pulse and the result of its action, similar to the well-known “area theorem” for Rabi pulses. The effect of unipolar pulses on a two-qubit system is analyzed in detail. Two situations are considered: first, a symmetric configuration, when the parameters of qubits do not differ and are acted upon by the same magnetic field from a fluxon, and second, when the configuration of levels arises in which, for one of the qubits, a transition to the nearest level becomes possible under perturbation. The general case of two interacting qubits—a four-level system—is considered analytically. A direct numerical simulation of the dynamics of a multiqubit system is performed to estimate the accuracy of approximation, and fidelity is used as a criterion of accuracy of operations. It is shown that the expressions obtained for the propagator allow one to formulate conditions for the pulse parameters that are necessary to perform logical operations.

Journal of Experimental and Theoretical PhysicsFeb 1, 20194 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.

Международный журнал Программные продукты и системыAug 28, 20232 citations

Simulation of n-qubit quantum systems: A computer-algebraic approach

Thomas Radtke, S. Fritzsche, A. Surzhykov

During the last decade, the field of quantum computation has attracted a lot of interest and motivated many theoretical and experimental studies of n -qubit quantum systems. But apart from the promise of more efficient quantum algorithms, these investigations also revealed a number of obstacles which still have to be overcome in practice. In this context, the use of simulation programs has proved to be an appropriate method. In order to facilitate the simulation of n -qubit quantum systems, we present the Feynman software program to provide the necessary tools to define and to deal with quantum registers as well as the operators acting on them. Using an interactive design within the framework of the computer algebra system Maple, we hope that the Feynman software program will be useful not only for teaching the basic elements of quantum computing but also for studying their physical realization in the future.

Physics of Particles and Nuclei LettersMar 1, 20072 citations

Large-Sized VQE Performance Profiling in Quantum Chemistry Using a Multi-Node Quantum Simulator

Keisuke Fukada, Tatsuhiko Shirai, Mikio Morita +3 more

Quantum simulators have been actively developed that faithfully simulate the quantum computer operations on a classical computer. Since the amount of memory and operations required by quantum simulators increases exponentially with the number of qubits, MPI (Message Passing Interface) and distributed processing, which are methods to effectively use a large number of computing resources, can be used to achieve higher computation speed. In this paper, we profile the performance of the variational quantum eigensolver (VQE) algorithm by applying it to a multi-node quantum simulator to calculate the energy values of carbon dioxide (CO2) molecule. We also discuss how the size of CI (configuration interaction) ansatz and the convergence threshold of the classical optimization change the energy values. Experimental results demonstrate that the computational time is reduced as the number of computation nodes increases. The speed-up ratio is increased as the number of qubits increases. When the qubit size is 30, a maximum of 12.2 times speed-up is achieved if the computing node size is increased from 1 to 128.

IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 15, 20240 citations

Hybrid mechanics of coupled qubits

Merfat Alzomai, Dmitrii V. Shalashilin

We find that a technique analogous to hybrid mechanics previously developed for Gaussian coherent states and molecular vibrations, can be extended to SU(2) coherent states describing coupled qubits. This formulation reveals a sparse structure of the propagator, leading to a computationally efficient scheme while maintaining numerical accuracy. As a result, the method enables simulations of larger qubit systems on classical computers. In particular, we demonstrate accurate real-time propagation for systems of up to 21 qubits, which would be computationally demanding using straightforward quantum-dynamics approaches.

The Journal of Chemical PhysicsOct 28, 20260 citations