Skip main navigation

New offer! Get 30% off one whole year of Unlimited learning. Subscribe for just £249.99 £174.99. New subscribers only. T&Cs apply

Find out more

Generalized search

In this video, Rodney Van Meter explains why Lov Grover's quantum search algorithm helps us solve problems like chess and go.

Computer scientist Lov Grover found a quantum algorithm, or perhaps more correctly an algorithmic framework, that allows quantum computing to be applied to almost any problem. It is commonly applied to search problems, where we are looking for a path across town or a trying to identify an input value for a function that will give us a particular output value. Small-data problems with high branching factors, like solving chess, shogi or go, are good candidates.


計算機科学者である、Lov Grover は、量子計算をほとんど全ての問題に応用できる、ある量子アルゴリズム(より正確にはアルゴリズムの枠組み)を発見しました。通常はある入力に応じて、特定の道順を出力する、探索問題に応用されます。チェス、将棋、囲碁といった、高い負荷分散を必要とする小規模データの問題がその一例です。

This article is from the free online

Understanding Quantum Computers

Created by
FutureLearn - Learning For Life

Reach your personal and professional goals

Unlock access to hundreds of expert online courses and degrees from top universities and educators to gain accredited qualifications and professional CV-building certificates.

Join over 18 million learners to launch, switch or build upon your career, all at your own pace, across a wide range of topic areas.

Start Learning now