For more information about this meeting, contact Sara Jamshidi.
|Title:||Algorithms for Simulating Hamiltonians|
|Seminar:||Tensor Networks and Applications Seminar|
|Speaker:||Nai-Hui Chia, Penn State University|
|Simulating the dynamics of quantum systems is one of the most important (and the earliest) motivation for studying quantum computer. Given the Hamiltonian of a system and a particular time, the problem is to obtain the state of the system after the time interval. For Hamiltonian which can be approximated by a sum of local Hamiltonians, we can obtain the state by Trotter formular. The idea is to decompose the system into several small subsystems to calculate the dynamics for each, and then merge them together. Finally, in order to approximate the true state within certain error bound, we repeat the process many times.
Note the efficiency of the process depends on the number and the simulating hardness of local Hamiltonians, it is interesting to figure out in which form Hamiltonians can be efficiently simulated. In this talk, I will introduce algorithms for simulating sparse Hamiltonians (where each row only has logarithmic number of non-zero entries) and some non-sparse Hamiltonians (including density matrices and matrices in particular form.)|
Room Reservation Information
|Date:||02 / 18 / 2014|
|Time:||03:50pm - 04:50pm|