Fully graphical treatment of the quantum algorithm for the Hidden Subgroup Problem

@inproceedings{Gogioso2017FullyGT,
  title={Fully graphical treatment of the quantum algorithm for the Hidden Subgroup Problem},
  author={Stefano Gogioso and Aleks Kissinger},
  year={2017}
}
The abelian Hidden Subgroup Problem (HSP) is extremely general, and many problems with known quantum exponential speed-up (such as integers factorisation, the discrete logarithm and Simon’s problem) can be seen as specific instances of it. The traditional presentation of the quantum protocol for the abelian HSP is low-level, and relies heavily on the the… CONTINUE READING