Multiplication algorithm on quantum computation

被引：0

作者：

Chen, CY

Hsueh, CC

机构：

来源：

FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science | 2005年

关键词：

quantum computing; quantum circuit;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper improves Florio and Picca quantum multiplication algorithm such that the number of the required quantum additions and quantum Fourier transfer operations is less. To multiply two n-bit integers x and y, Florio and Picca quantum multiplication algorithm uses Draper quantum addition to add x for y times. It requires O(2 '') quantum additions and O(2 '') quantum Fourier transfer operations. In this paper we use the binary method to reduce the number of the required quantum additions and quantum Fourier transfer operations. According to our analysis, our presented quantum multiplication algorithm only requires O(n) quantum additions and O(n) quantum Fourier transfer operations.

引用

页码：38 / 45

页数：8