@article{oai:uec.repo.nii.ac.jp:00006818,
 author = {西野, 哲朗 and Nishino, Tetsuro},
 issue = {1},
 journal = {電気通信大学紀要},
 month = {Jul},
 note = {In 1985, David Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum parallel computations. Algorithms executed on QTMs are called quantum algorithms. It is well known that Peter Shor designed a polynomial time quantum algorithm for integer factoring in 1994. In this paper, we first illustrate several major methods of designing efficient quantum algorithms with Shor's algorithm as an example. On the other hand, many researchers are studying how to physically implement quantum computers based on QTM. Among others, NMR (Nuclear Magnetic Resonance) offers an appealing prospect for implementation of quantum computers because of a number of reasons. But, quantum computations performed on NMR is slightly different from those performed on QTMs. For example, Shor's factoring algorithm cannot be executed on an NMR quantum computer as it is. In this paper, we show how to factor integers in polynomial time by using NMR quantum computers.},
 pages = {23--29},
 title = {量子計算と量子アルゴリズム},
 volume = {16},
 year = {2003},
 yomi = {ニシノ, テツロウ}
}