Simon's problem needs quantum solver #82
Description
Simon's problem has a classical solver, but needs a quantum solver. This one is more complicated than Bernstein-Varirani or Deutsch-Jozsa because it's an arbitrary n-bit to m-bit function that must be constructed on the fly.
It may be possible to create m n-bit -> 1-bit circuits using the sum-of-products method and turn the result into a concatenation of boolean expressions.