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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.