We study the problem of finding best approximate circuit that is closest (in some pertinent metric) to a target circuit, and which satisfies number hardware constraints, like gate alphabet connectivity. look at in CNOT+rotation set from mathematical programming standpoint, offering contributions both terms understanding mathematics its efficient solution. Among results we present, are able deri...

In this work, we first introduce the concept of approximate sequence and establish some new convergence theorems for approximate sequences. By applying our new convergence theorems, we obtain new best proximity point theorems which improve and generalize some known results in the literature. As applications, some simultaneous generalizations of common fixed point theorems of Banach type, Kannan...

We enrich the known results about tripled fixed points and best proximity points. generalize notion of ordered pairs cyclic contraction maps we obtain sufficient conditions for existence uniqueness (or proximity) get a priori posteriori error estimates points, provided that underlying Banach space has modulus convexity power type in case obtained by sequences successive iterations. illustrate m...