SearcharxivSearch

arXiv subjects

Petr Anisimov

Publications and source records attributed to Petr Anisimov.

2 recordsLinked to original sources

Quantum Algorithm Implementations for Beginners

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims to explain the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM's quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.

cs.ET

Gradient Symplectic Algorithms for Solving the Radial Schrodinger Equation

The radial Schrodinger equation for a spherically symmetric potential can be regarded as a one dimensional classical harmonic oscillator with a time-dependent spring constant. For solving classical dynamics problems, symplectic integrators are well known for their excellent conservation properties. The class of {\it gradient} symplectic algorithms is particularly suited for solving harmonic oscillator dynamics. By use of Suzuki's rule for decomposing time-ordered operators, these algorithms can be easily applied to the Schrodinger equation. We demonstrate the power of this class of gradient algorithms by solving the spectrum of highly singular radial potentials using Killingbeck's method of backward Newton-Ralphson iterations.

physics.comp-ph