グローバーのアルゴリズム
1. Grover's algorithmGrover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N) time and using O(log N) storage space. It was discovered by Lov Grover in 1996. In models of classical computation, searching an unsorted database cannot be done in less than linear time (so merely searching through every item is optimal).
Read “Grover's algorithm” on English Wikipedia
Read “グローバーのアルゴリズム” on Japanese Wikipedia
Read “Grover's algorithm” on DBpedia
Read “Grover's algorithm” on English Wikipedia
Read “グローバーのアルゴリズム” on Japanese Wikipedia
Read “Grover's algorithm” on DBpedia
Discussions
Log in to talk about this word.