Pith. sign in

REVIEW

Quantum Modeling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0310029 v1 pith:N64A6JBW submitted 2003-10-04 quant-ph

classification quant-ph
keywords algorithmquantumdataperformancepolylogprobabilitysizeable
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present a modification 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.

Discussion (0). Continue with ORCID to comment.

Pith tools