- Tür:
- Kitap Bölümü
- Yayın yılı:
- 2007
- Yayıncı:
- Cambridge University Press
Suppose you know that exactly one n-bit integer satisfies a certain condition, and suppose you have a black-boxed subroutine that acts on the N = 2n different n-bit integers, outputting 1 if the integer satisfies the condition and 0 otherwise. In the absence of any other information, to find the special integer you can do no better with a classical computer than to apply the subroutine repeatedly to different random numbers until you hit on the special one. If you apply it to M different integers the probability of your finding the special number is M/N. You must test ½N different integers to have a 50% chance of success.
Bu kitabı edinin
ⓘ Bu bağlantılar satış ortaklığı (affiliate) bağlantılarıdır; bir alışveriş yapmanız hâlinde sitemize komisyon kazandırabilir, size ek bir maliyet getirmez.
Künye/erişim: kaynak bağlantısı
Sıkça sorulan sorular
- Searching with a quantum computer ne hakkında?
- Suppose you know that exactly one n-bit integer satisfies a certain condition, and suppose you have a black-boxed subroutine that acts on the N = 2n different n-bit integers, outputting 1 if the integer satisfies the condition and 0 otherwise.