Share Email Print

Proceedings Paper

Continuous quantum hidden subgroup algorithms
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 4 August 2003
PDF: 9 pages
Proc. SPIE 5105, Quantum Information and Computation, (4 August 2003); doi: 10.1117/12.487763
Show Author Affiliations
Samuel J. Lomonaco Jr., Univ. of Maryland/Baltimore County (United States)
Louis H. Kauffman, Univ. of Illinois/Chicago (United States)

Published in SPIE Proceedings Vol. 5105:
Quantum Information and Computation
Eric Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?