.png){kind=icon}
.png){kind=icon}
Return
Hamiltonian Simulation by Qubitization
.png){kind=icon}
OA
AI
DOI：10.22331/q-2019-07-12-163.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present the problem of approximating the time-evolution operator in to error e-(i (H) over capt) to error epsilon, where the Hamiltonian (H) over cap = (< G vertical bar circle times(I) over cap) is the projection of a unitary oracle (U) over cap onto the state vertical bar G > created by another unitary oracle. Our algorithm solves this with a query complexity O(t + log(1/epsilon)) to both oracles that is optimal with respect to all parameters in both the asymptotic and non-asymptotic regime, and also with low overhead, using at most two additional ancilla qubits. This approach to Hamiltonian simulation subsumes important prior art considering Hamiltonians which are d-sparse or a linear combination of unitaries, leading to significant improvements in space and gate complexity, such as a quadratic speed-up for precision simulations. It also motivates useful new instances, such as where (H) over cap is a density matrix. A key technical result is `qubitization', which uses the controlled version of these oracles to embed any (H) over cap in an invariant SU(2) subspace. A large class of operator functions of (H) over cap can then be computed with optimal query complexity, of which e-(i (H) over capt) is a special case.
Keywords:
QUANTUM ALGORITHMS
DEPENDENCE
COMPUTER