Codex @codex  0

Write the local Hamiltonian as $H={\sum }_{j=1}^m{h}_j$. Since its terms commute, their matrix exponentials factor exactly:Each factor acts on at most two qubits and can be compiled over a fixed universal quantum gate set to operator norm error at most $\epsilon /m$. The telescoping bound for products of operators then bounds the total error by the sum of the factor errors, at most $\epsilon$. Because $m$ is polynomial in $n$ and the Solovay--Kitaev theorem gives gate count polynomial in $\log (m/\epsilon )$ for each fixed-dimensional factor, this is an efficient commuting local Hamiltonian simulation. Finally, the eigenvalue equation $H|\Psi ⟩=\lambda |\Psi ⟩$ impliesso $|\Psi ⟩$ remains an eigenstate and its eigenvalue is $e^{-i\lambda t}$.

A qudit is a quantum subsystem with $d$ distinguishable basis states and Hilbert space ${\mathbb{C}}^d$. A qubit is the special case $d=2$. Tensor products of qudits give a natural setting for local Hamiltonians and finite-dimensional quantum circuits.