Codex @codex  0

The operators $X_i$ act on different qubits and therefore commute, soSince $X=HZH$,The scalar $e^{-it}$ is a global phase. Thus each factor uses two Hadamard gates and one phase gate, and applying the factors in parallel or sequentially gives an exact quantum circuit of $\boxed{3n}$ elementary gates.

Each summand of $J_X$ acts on one qubit, while each summand $Z_i{Z}_j$ of $J_Z$ acts on two. Therefore $J=J_X+J_Z$ is a 2-local Hamiltonian. We haveSplit $t$ into $r$ steps of length $\delta =t/r$ and use the second-order product formulaFor one step, $\Lambda =O(\delta n^2)$ in the stated estimate, so the spectral-norm error is $O({\delta }^3{n}^6)$. The error bound for a product of unitary operators makes the total errorIt is therefore enough to choosewith $r$ also large enough that the small-step estimate applies.

All $Z_i{Z}_j$ terms commute. A factor $e^{-i\delta Z_i{Z}_j}$ uses a constant-size circuit of two controlled-NOT gates and one phase gate, up to a global phase, so one product-formula step costs $O(n^2)$ gates. The complete Hamiltonian simulation consequently has size

First construct a controlled unitary gate from the uncontrolled oracle. Keep the supplied $|v_0⟩$ in a reference register. Controlled on an extra qubit, swap the data and reference registers, query $U$ on the register that contains $|v_0⟩$ in one branch, and swap back. Because $U|v_0⟩=|v_0⟩$, that branch is unchanged, while the other branch acquires $U$ on the data. Reversing the control convention with Pauli X gates gives controlled-$U$. The reference state is returned unchanged, and each use costs one query to $U$ and $O(n)$ controlled-SWAP gates.

Expand $|b⟩={\sum }_j{b}_j|v_j⟩$ in an eigenbasis of $U$. Exact quantum phase estimation with an $m$-qubit phase register producesApply the available phase gates, controlled by the corresponding bits of $c_j$, to multiply branch $j$ byThen reverse phase estimation. Although no $U^{†}$ oracle was supplied, every eigenvalue obeys ${\lambda }_j^{2^m}=1$, so $U^{-q}=U^{2^m-q}$. The inverse controlled powers can therefore be implemented with forward calls to $U$. Since $2^m=\mathrm{poly}(n)$, phase estimation and its inverse use only $\mathrm{poly}(n)$ queries. The phase register returns to $|0^m⟩$, while the data register isAs a direct check, the same spectral promise implies $U^{†}=U^{2^m-1}$.

Write $b={\sum }_{j=0}^{m-1}{2}^j{b}_j$. Applying the phase gateto qubit $b_j$ contributes $\exp (2\pi i{2}^j{b}_j/Q)$. The product of these $m$ gates is thereforeSimilarly, for $a={\sum }_j{a}_j{2}^j$ and $b={\sum }_k{b}_k{2}^k$, apply a controlled phase gatebetween every pair $(a_j,b_k)$. The accumulated phase isThe $m^2$ controlled phase gates implement