427 B
427 B
Simon’s problem was presented at a conference in 1994 together with Shor’s algorithms, and the full paper was published in 1997. It is a quantum algorithm exponentially faster than the best deterministic or randomized equivalent classical algorithm. It is a remarkable but underestimated scientific contribution to quantum computing. Simon’s algorithm explores not only quantum parallelism but also maximal entanglement.