Talk:Hidden subgroup problem

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

Talk:Hidden subgroup problem

General quantum solution in polynomial time.

Latest comment: 3 years ago1 comment1 person in discussion

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)Reply

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.