| 摘要 |
<P>PROBLEM TO BE SOLVED: To reduce global calculation in quantum search processing, improve a calculation speed, and reduce an error occurrence probability. <P>SOLUTION: An input section 11 accepts an input of a search object x. In an initial quantum state generation section, initial quantum states of a calculation bit and an "antira" bit (a qubit having a quantum state of ¾a<SB>0</SB>'>)¾ψ<SB>0</SB>>(×)¾a<SB>0</SB>> are generated. Also, in an operation section, to the quantum state of an operation target ¾ψ<SB>j-1</SB>>(×)¾a<SB>0</SB>>, the processing of a calculation U<SB>x</SB>¾y>(×)¾m> satisfying U<SB>x</SB>¾y>(×)¾a<SB>0</SB>>=G(×)Id¾y>(×)¾a<SB>0</SB>> (G:=exp(i×β¾x><x¾), -π<β=-βu×2<SP>1-βd</SP>×π<0, where βu and βd are natural numbers) to the calculation bit and the "antira" bit and the processing of a local calculation U<SB>s</SB>(x)Id are performed repetitively. <P>COPYRIGHT: (C)2006,JPO&NCIPI |
