| |
|
|
|
Algorithm for Quantum Simulation |
|
|
|
PP: 117-122 |
|
|
|
Author(s) |
|
|
|
Barry C. Sanders,
|
|
|
|
Abstract |
|
|
| We summarize our algorithm for simulating Hamiltonian evolution and show that the
cost of the simulation, in terms of black-box calls to the Hamiltonian oracle, is nearly
linear in time and the space complexity for given sparseness is nearly constant. |
|
|
|
|
 |
|
