Talk:Hidden subgroup problem

General quantum solution in polynomial time.
I recently came across this research paper that claims to solve this problem in the general case in polynomial time with a quantum computer.

If someone with more expertise could look at it, and if it's valid update the pages for cryptography schemes like some of the lattice problems that can be reduced to HSP to say they're not quantum secure, that would be neat

Here's the arxiv paper: https://arxiv.org/abs/2204.03295 31.112.125.8 (talk) 18:47, 21 April 2023 (UTC)