Designing a Quantum Algorithm for Real-Valued Addition Using Posit Arithmetic

Bachelor thesis (2019)

Authors

T.C.P. Driebergen Electrical Engineering, Mathematics and Computer Science

Contributors

M. Möller Numerical Analysis - EEMCS (supervisor 1)
Cornelis Vuik Numerical Analysis - EEMCS (supervisor 2)
J.G. Spandaw Analysis - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2019 Tim Driebergen
More Info
expand_more

Published Date

2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Currently there are no efficient quantum algorithms for the addition of real-valued numbers. In classical computers addition is performed by using barrel shifters, a concept proven to be very inefficient as a quantum circuit due to its many garbage outputs when the barrel shifter is made reversible. This thesis aims to design a quantum algorithm able to perform floating-point arithmetic. It uses the new Posit format as its number format so the algorithm can be built on a very small scale, which makes it possible to easily implement the entire algorithm. The designed Quantum Posit Adding Algorithm uses a tablebase approach, examining each number checking if it changes during addition. An optimized version of the algorithm is also designed, removing any unnecessary controls. Finally a method to extend the algorithm is proposed along with an approach to building a similar subtractor, also presenting some non-working ideas.