@article{oai:kanagawa-u.repo.nii.ac.jp:00006934,
 author = {小澤, 宏 and Ozawa, Hiroshi and 天野, 力 and Amano, Chikara and 岡部, 建次 and Okabe, Kenji and 坂口, 潮 and Sakaguchi, Ushio and 福見, 俊夫 and Fukumi, Toshio and 峯岸, 安津子 and Minegishi, Atsuko},
 journal = {Science Journal of Kanagawa University},
 month = {May},
 note = {On an (n+2)-bit quantum network, a gate for conditional NOT operation with n≧5 bits of controls (a C^nNOT gate) can be simulated with 24n-64 gate of conditional two-bit operations, as well as with 32n-4 gates of CNOT and one-bit operations. These small numbers of elementary gates (which are approximately half or two thirds of the number known so far) help toward implementation of the oracle U_f: |x>|y>→|x>|y+f(x)> on quantum computers.},
 pages = {99--100},
 title = {NMR量子コンピュータ(2005年度神奈川大学総合理学研究所助成共同研究)},
 volume = {17},
 year = {2006}
}