Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems

Abstract

In data processing, we input the results x<inf><i>i</i></inf> of measuring easy-to-measure quantities x<inf><i>i</i></inf> and use these results to find estimates y = <i>f</i> (x<inf>1</inf>, . . ., x<inf><i>n</i></inf>) for difficult-to-measure quantities <i>y</i> which are related to <i>x</i><inf><i>i</i></inf> by a known relation <i>y</i> = <i>f</i>(<i>x… (More)
DOI: 10.1145/1141277.1141663

Topics

  • Presentations referencing similar topics