Countinuous Quantum Hidden Subgroup Algorithms
Abstract
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals R mod 1, i.e., the circle, and the additive group Paths of L2 paths x:[0,1]-->Rn in real n-space Rn. Also included is a curious discrete QHS algorithm which is dual to Shor's algorithm.
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.