Card game: Hide queen

After the execution you can see how many iteration are for quantum and for classical computer:

Quantum: 1 attempt, Classical: 2 attempts

And a short explanation:

In this example, the Quantum Experience simulates quantum physics to search all of the potential possibilities, and find the queen on the first try. The classical computer computes one step at a time and could take four tries.

Here you can find a small simulation of this game in python running 1000 shuffled decks of cards:

as you can the attempts are almost equal around 25 %. The biggest number is 3 - which means that this algorithm finds the queen most of the times in 3 attempts. Or we could say that it finds the queen as quantum computer in 1 shot only in 25 % of the time.

How quantum computer work

The quantum computer implement a Grover's algorithm. This algorithm use an oracle function which simulate all the 4 versions of the card positions and find the most probable of all just in one shot.

One this link you can find discussion about the algorithm and how it works: