Quantum Adder for Superposition States |
| |
| Authors: | Xiaowei Lu Nan Jiang Zhuoxiao Ji |
| |
| Affiliation: | 1.Faculty of Information Technology,Beijing University of Technology,Beijing,China;2.School of Information Science and Technology,Linyi University,Linyi,China;3.Beijing Key Laboratory of Trusted Computing,Beijing,China;4.National Engineering Laboratory for Critical Technologies of Information Security Classified Protection,Beijing,China |
| |
| Abstract: | ![]()
Quantum superposition is one of the essential features that make quantum computation surpass classical computation in space complexity and time complexity. However, it is a double-edged sword. For example, it is troublesome to add all the numbers stored in a superposition state. The usual solution is taking out and adding the numbers one by one. If there are (2^{n}) numbers, the complexity of this scheme is (O(2^{n})) which is the same as the complexity of the classical scheme (O(2^{n})). Moreover, taking account to the current physical computing speed, quantum computers will have no advantage. In order to solve this problem, a new method for summing all numbers in a quantum superposition state is proposed in this paper, whose main idea is that circularly shifting the superposition state and summing the new one with the original superposition state. Our scheme can effectively reduce the time complexity to (O(n)). |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
