Practical Implementation of a Quantum Algorithm for the Solution of Systems of Linear Systems of Equations

Practical Implementation of a Quantum Algorithm for the Solution of Systems of Linear Systems of Equations

Ubbens, Otmar (TU Delft Applied Sciences; TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Numerical Analysis; TU Delft Computer Engineering)

Möller, M. (mentor)
Almudever, Carmen G. (mentor)
Groenevelt, W.G.M. (graduation committee)
Vandersypen, L.M.K. (graduation committee)

Delft University of Technology

Applied Mathematics | Applied Physics

2019-09-13

With the rapid development of Quantum Computers (QC) and QC Simulators, there will be an increased demand for functioning Quantum Algorithms in the near future. Some of the most ubiquitously useful algorithms are solvers for linear systems of equations. Since the conception of the Quantum Linear Solver Algorithm (QLSA) by Harrow, Hassidim and Lloyd (HHL) in 2009, many improvements have been made, although a generic implementation for arbitrary matrices and vectors is still not available. In this thesis a variant of the HHL QLSA is studied, and the open challenges are investigated. Solutions for two of the challenges, namely the Eigenvalue Inversion subroutine and the Higher-Order Ancilla Rotation subroutine, are discussed. As part of the thesis project, these subroutines have been implemented in the QX Quantum Computer Simulator, and the subroutines are combined to form a complete Quantum Linear Solver (QLS), with the restraint that the implementation for the vector and Hamiltonian of the matrix must be provided by the user. A proof-of-concept QLS by Cao et al. is also implemented in the QX simulator, and using the implementation of the vector and Hamiltonian of Cao et al. the complete solver is tested. In the process of this thesis, a framework for basic Quantum Arithmetic is built providing three variants of Integer Adders, two variants of Integer Subtracters, one Integer Multiplier and one Integer Divider. In addition, gates not natively available in the QX simulator are implemented, and a number of improvements and extensions of algorithms presented in the literature are given, making the described algorithms function on the QX simulator and extending features.

quantum computing
quantum algorithms
quantum linear equation solver
numerical linear algebra
quantum simulator

http://resolver.tudelft.nl/uuid:444580f0-a661-4adc-a937-51c5660916d9

Student theses

bachelor thesis

© 2019 Otmar Ubbens