Grover’s Search Algorithm

Abstract

Let us consider a children’s game called hiding the key : one player hides the key in the house, and the others try to find it. The one who has hidden the key is permanently advising the others by using phrases like “freezing”, “cold”, “warm”, and “hot”, depending on how close the seekers are to the hiding place. Without this advice, the game would obviously last much longer. Or, can you develop a strategy for finding the key without searching through the entire house?