Hamiltonian simulation

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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. A special case of the Hamiltonian simulation problem is the local Hamiltonian simulation problem.

This is when H is a k-local Hamiltonian on n qubits where H = \sum_{j \mathop =1}^m H_j and H_j acts non-trivially on at most k qubits instead of n qubits. The local Hamiltonian simulation problem is important because most Hamiltonians that occur in nature are k-local.

If H = A + B + C , then U = e^{-i(A + B + C)t} is well-approximated by (e^{-iAt/r}e^{-iBt/r}e^{-iCt/r})^r for a large r ; where r is the number of time steps to simulate for. The larger the 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. e^{-iHt} = \sum_{n \mathop = 0}^ \infty \frac{(-iHt)^{n}}{n!} = I - iHt - \frac{H^{2}t^{2}}{2} + \frac{iH^{3}t^{3}}{6} + \cdots by the Taylor series expansion. This says that during the evolution of a quantum state, the Hamiltonian is applied over and over again to the system with a various number of repetitions.

The first term is the identity matrix so the system doesn't change when it is applied, but in the second term the Hamiltonian is applied once. For practical implementations, the series has to be truncated \left( \sum_{n \mathop = 0}^N \frac{(-iHt)^{n}}{n!} \right) , where the bigger the N , the more accurate the simulation.

This truncated expansion is then implemented via the linear combination of unitaries (LCU) technique for Hamiltonian simulation. Namely, one decomposes the Hamiltonian H = \sum_{\ell=1}^L \alpha_\ell H_\ell such that each H_\ell is unitary (for instance, the Pauli operators always provide such a basis), and so each H^n = \sum_{\ell_1,\ldots,\ell_n=1}^L \alpha_{\ell_1} \cdots \alpha_{\ell_n} H_{\ell_1} \cdots H_{\ell_n} is also a linear combination of unitaries.

See also

Quantum simulator

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369792684 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001369792684 · captured 1786936575.0 · version history

Cite this page as: encyclopegia.org, “Hamiltonian simulation”, snapshot enwiki-001369792684. https://encyclopegia.org/a/hamiltonian-simulation

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.