|
Accession number;99A0793686
|
| Title;Quantum algorithm of knapsack problem. |
| Author;
SUZUNO SATOSHI
(Sci. Univ. of Tokyo, Fac. of Sci. and Technol.)
MASUDA NATSUKI
(Sci. Univ. of Tokyo, Fac. of Sci. and Technol.)
OYA MASANORI
(Sci. Univ. of Tokyo, Fac. of Sci. and Technol.)
|
Journal Title;IEIC Technical Report (Institute of Electronics, Information and Communication Engineers)
|
Journal Code:S0532B
|
ISSN:0913-5685
|
|
VOL.99;NO.187(IT99 15-32);PAGE.49-54(1999)
|
| Figure&Table&Reference;FIG.11, REF.8 |
| Pub. Country;Japan |
| Language;Japanese |
| Abstract;Quantum computer is a computer based on quantum dynamics. More precisely, the quantum coherence of states is used for quantum computation, which enables the computation with much higher speed compared with digital computer. Knapsack problem belongs to class of NP-complete and its effective algorithm has not been found yet. In this paper, we discuss the quantum algorithm of the knapsack problem and show that it can be solved in polynomial time if the qu-bit, i.e. the superposition of pure states is detected. (author abst.) |
|
|
|
Related Articles;
|
