Bibliographic Details
| Title: |
Quantum Interference Computation. |
| Authors: |
Finkelstein, David Ritz1 df4@mail.gatech.edu, Castagnoli, Giuseppe2 |
| Source: |
International Journal of Theoretical Physics. Aug2008, Vol. 47 Issue 8, p2158-2164. 7p. |
| Subjects: |
Quantum interference, Computational steering (Computer science), Superposition principle (Physics), Boolean algebra, Quantum theory, Quantum computers, Electronic data processing |
| Abstract: |
Quantum speed-up has been conjectured but not proven for a general computation. Quantum interference computation (QUIC) provides a general speed-up. It is a form of ground-mode computation that reinforces the ground mode in a beam of mostly non-ground modes by quantum superposition. It solves the general Boolean problem in the square root of the number of operations that a classical computer would need for the same problem. For example a typical 80-bit problem would take about 1024 cycles (107 years at 1 GHz) of classical computation and about 1012 cycles (20 minutes at 1 GHz) of QUIC. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Theoretical Physics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
