The execution of quantum algorithms requires two key considerations. On the one hand, it should meet connectivity constraint requirements circuit mapping for architectures, and on other needs to consider reducing probability errors in circuits as much possible. This paper proposes a novel optimization technique based template matching that satisfy both requirements. method can significantly red...

Abstract At present, few published template matching algorithms can achieve the performance of commercial software. This paper studies and optimizes existing geometric feature algorithm, combines it with improved Fourier Merlin transform registration finally obtains a fast small target location algorithm. The time algorithm is 1-4ms, its positioning accuracy sub-pixel level, angle less than 1 °...

We consider the fundamental problem of matching a template to signal. do so by M-estimation, which encompasses procedures that are robust gross errors (i.e., outliers). Using standard results from empirical process theory, we derive convergence rate and asymptotic distribution M-estimator under relatively mild assumptions. also discuss optimality estimator, both in finite samples minimax sense ...