Need Threads on Grapevine: Here's what I did with Quantum Computing

Created a Quantum Circuit that implements Bernstein Vazirani algorithm to find a secret binary substring faster than a classical computer.

Essentially, if there is a secret substring S then it will take |S| tries for a classical computer to guess it.
But using Bernstein Vazirani Algorithm does it in a single try.

So, for a secret substring 1001, on a 4 qubit quantum computer, we can do a single shot computation and arrive at the string which was not seen by the circuit.

Bernstein Vazirani algorithm gets the secret substring exactly as 1001 in ~636 out of every 1000 times. The erroneous values in the histogram for other possible combinations, our original secret substring was 1001, but we can also see that 0000, 0001 …. 1111 were also computed in a few cases, this error seen in the histogram is due to the quantum computing error.