|
| related topics |
| {algorithm, log, probability} |
| {let, theorem, proof} |
| {equation, function, exp} |
| {state, phys, rev} |
| {measurement, state, measurements} |
| {vol, operators, histories} |
| {alice, bob, state} |
| {key, protocol, security} |
| {energy, gaussian, time} |
| {entanglement, phys, rev} |
|
A Continuous Variable Shor Algorithm
Samuel J. Lomonaco, Louis H. Jr.
abstract: In this paper, we use the methods found in quant-ph/0201095 to create a
continuous variable analogue of Shor's quantum factoring algorithm. By this we
mean a quantum hidden subgroup algorithm that finds the period P of a function
F:R-->R from the reals R to the reals R, where F belongs to a very general
class of functions, called the class of admissible functions.
One objective in creating this continuous variable quantum algorithm was to
make the structure of Shor's factoring algorithm more mathematically
transparent, and thereby give some insight into the inner workings of Shor's
original algorithm. This continuous quantum algorithm also gives some insight
into the inner workings of Hallgren's Pell's equation algorithm. Two key
questions remain unanswered. Is this quantum algorithm more efficient than its
classical continuous variable counterpart? Is this quantum algorithm or some
approximation of it implementable?
- oai_identifier:
- oai:arXiv.org:quant-ph/0210141
- categories:
- quant-ph
- comments:
- 13 pages; a substantial revision to the first version
- arxiv_id:
- quant-ph/0210141
- created:
- 2002-10-21
- updated:
- 2004-06-08
Full article ▸
|
|
| related documents |
| 0109038v1 |
| 0008095v3 |
| 0010057v1 |
| 0306042v1 |
| 9901068v1 |
| 0011052v2 |
| 0609220v1 |
| 0305031v1 |
| 0609166v1 |
| 0606077v1 |
| 0303074v1 |
| 0609160v1 |
| 0508156v3 |
| 0403071v1 |
| 0308016v1 |
| 0612052v2 |
| 0608156v1 |
| 0304013v1 |
| 0406226v1 |
| 0311133v2 |
| 0411027v1 |
| 0406104v1 |
| 0211034v2 |
| 0603206v1 |
| 0512100v1 |
|