Approximating fractional time quantum evolution
From MaRDI portal
Abstract: An algorithm is presented for approximating arbitrary powers of a black box unitary operation, , where is a real number, and 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 and large , one should apply a total of times followed by our procedure for approximating the fractional power . An example is also given where for large integers this method is more efficient than direct application of copies of . Further applications and related algorithms are also discussed.
Recommendations
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Black-box Hamiltonian simulation and unitary implementation
- Algorithm for quantum simulation
- Hamiltonian simulation with nearly optimal dependence on spectral norm
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
Cited in
(4)- Quantum circuits cannot control unknown operations
- Time fractional Schrödinger equation: Fox's H-functions and the effective potential
- Product formulas for exponentials of commutators
- Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
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)