Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
Abstract
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.