Approximating fractional time quantum evolution

From MaRDI portal



Abstract: An algorithm is presented for approximating arbitrary powers of a black box unitary operation, mathcalUt, where t is a real number, and mathcalU is a black box implementing an unknown unitary. The complexity of this algorithm is calculated in terms of the number of calls to the black box, the errors in the approximation, and a certain `gap' parameter. For general mathcalU and large t, one should apply mathcalU a total of lfloortfloor times followed by our procedure for approximating the fractional power mathcalUt−lfloortfloor. An example is also given where for large integers t this method is more efficient than direct application of t copies of mathcalU. Further applications and related algorithms are also discussed.











This page was built for publication: Approximating fractional time quantum evolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628266)