Share Email Print
cover

Proceedings Paper

Quantum modeling
Author(s): Darin A Goldstein
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We present a modificaton of Simon's Algorithm that in some cases is able to fit experimentally obtained data to appropriately chosen trial functions with high probability. Modulo constants pertaining to the reliability and probability of success of the algorithm, the algorithm runs using only O[polylog(|Y|)] queries to the quantum database and O[polylog(|X|,|Y|)] elementary quantum gates where |X| is the size of the experimental data set and |Y| is the size of the parameter space. We discuss heuristics for good performance, analyze the performance of the algorithm in the case of linear regression, both one-dimensional and multidimensional, and outline the algorithm's limitations.

Paper Details

Date Published: 4 August 2003
PDF: 12 pages
Proc. SPIE 5105, Quantum Information and Computation, (4 August 2003); doi: 10.1117/12.485746
Show Author Affiliations
Darin A Goldstein, California State Univ./Long Beach (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