Skip main navigation

New offer! Get 30% off your first 2 months of Unlimited Monthly. Start your subscription for just £35.99 £24.99. New subscribers only T&Cs apply

Find out more

Introduction to Grover’s Algorithm

Rod Van Meter and Takahiko Satoh outline the behavior of Grover's algorithm.

The most general quantum algorithm is Lov Grover’s search algorithm. Using entanglement and interference, it allows us to answer the question, “For what value of (x) does (f(x) = k), for some number (k)?”

A quantum computer allows us to calculate (f(x)) for a superposition of all values of (x) at the same time, but not to extract useful information from that superposition directly. Instead, we use the result to increase the amplitude of good values of (x), and repeat until we have a high probability of reading out the value we want.

In this video, we outline the behavior of the algorithm, then in the next two Steps will we see the operation in more detail.


最も一般的に認知されている量子アルゴリズムはLov Gloverの探索アルゴリズムです。 量子もつれと干渉を利用することで、「ある値(k) をもとに(f(x) = k)を満たす(x)の値を見つける」という問題を解くことができます。

量子コンピューターは、全ての値を重ね合わせることで、同時に多数の計算することが出来ますが、重ね合わさった出力から有益な情報を直接取り出すことはできません。 代わりに、その重ね合わせを利用し、解となる値の振幅を増やす作業を、必要としている値が観測される確率が十分に高くなるまで繰り返す必要があります。


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