Continuous quantum hidden subgroup algorithms

Samuel J. Lomonaco Jr.; Louis H. Kauffman

doi:10.1117/12.487763

4 August 2003 Continuous quantum hidden subgroup algorithms

Samuel J. Lomonaco Jr., Louis H. Kauffman

Proceedings Volume 5105, Quantum Information and Computation; (2003) https://doi.org/10.1117/12.487763
Event: AeroSense 2003, 2003, Orlando, Florida, United States

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² paths x:[0,1] → Rⁿ in real n-space Rⁿ.

Citation Download Citation

Samuel J. Lomonaco Jr. and Louis H. Kauffman "Continuous quantum hidden subgroup algorithms", Proc. SPIE 5105, Quantum Information and Computation, (4 August 2003); https://doi.org/10.1117/12.487763

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available