Hamiltonian simulation (also referred to as quantum simulation) is a problem in quantum information science that attempts to find the computational complexity and quantum algorithms needed for simulating quantum systems. Hamiltonian simulation is a problem that demands algorithms which implement the evolution of a quantum state efficiently. The Hamiltonian simulation problem was proposed by Richard Feynman in 1982, where he proposed a quantum computer as a possible solution since the simulation of general Hamiltonians seem to grow exponentially with respect to the system size.
Problem statement In the Hamiltonian simulation problem, given a Hamiltonian H {\displaystyle H} ( 2 n × 2 n {\displaystyle 2^{n}\times 2^{n}} hermitian matrix acting on n {\displaystyle n} qubits), a time t {\displaystyle t} and maximum simulation error ϵ {\displaystyle \epsilon } , the goal is to find an algorithm that approximates U {\displaystyle U} such that | | U − e − i H t | | ≤ ϵ {\displaystyle ||U-e^{-iHt}||\leq \epsilon } , where e − i H t {\displaystyle e^{-iHt}} is the ideal evolution and | | ⋅ | | {\displaystyle ||\cdot ||} is the spectral norm. A special case of the Hamiltonian simulation problem is the local Hamiltonian simulation problem. This is when H {\displaystyle H} is a k-local Hamiltonian on n {\displaystyle n} qubits where H = ∑ j = 1 m H j {\displaystyle H=\sum _{j\mathop {=} 1}^{m}H_{j}} and H j {\displaystyle H_{j}} acts non-trivially on at most k {\displaystyle k} qubits instead of n {\displaystyle n} qubits. The local Hamiltonian simulation problem is important because most Hamiltonians that occur in nature are k-local.
Techniques
Product formulas
Also known as Trotter formulas or Trotter–Suzuki decompositions, Product formulas simulate the sum-of-terms of a Hamiltonian by simulating each one separately for a small time slice. If H = A + B + C {\displaystyle H=A+B+C} , then U = e − i ( A + B + C ) t {\displaystyle U=e^{-i(A+B+C)t}} is well-approximated by ( e − i A t / r e − i B t / r e − i C t / r ) r {\displaystyle (e^{-iAt/r}e^{-iBt/r}e^{-iCt/r})^{r}} for a large r {\displaystyle r} ; where r {\displaystyle r} is the number of time steps to simulate for. The larger the r {\displaystyle r} , the more accurate the simulation. If the Hamiltonian is represented as a Sparse matrix, the distributed edge coloring algorithm can be used to decompose it into a sum of terms; which can then be simulated by a Trotter–Suzuki algorithm.
Taylor series
… excerpt ends here. Continue reading the full article.
