Paper
4 August 2003 Quantum modeling
Author Affiliations +
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.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Darin A Goldstein "Quantum modeling", Proc. SPIE 5105, Quantum Information and Computation, (4 August 2003); https://doi.org/10.1117/12.485746
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Quantum computing

Data modeling

Mathematical modeling

Quantum communications

Evolutionary algorithms

Binary data

RELATED CONTENT


Back to Top