Countinuous Quantum Hidden Subgroup Algorithms
arXiv:quant-ph/0304084 · doi:10.1117/12.487763
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 L^2 paths x:[0,1]-->R^n in real n-space R^n. Also included is a curious discrete QHS algorithm which is dual to Shor's algorithm.
9 pages, no figures, table of contents included
References in corpus (8)
- Quantum factoring, discrete logarithms and the hidden subgroup problem
- Introduction to Quantum Algorithms
- The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem
- Correspondence between continuous variable and discrete quantum systems of arbitrary dimensions
- Quantum searching with continuous variables
- An Analog Analogue of a Digital Quantum Computation
- Quantum Hidden Subgroup Problems: A Mathematical Perspective
- A Continuous Variable Shor Algorithm