Efficient quantum algorithms for simulating sparse Hamiltonians
| dc.creator | Berry, Dominic W. | |
| dc.creator | Ahokas, Graeme | |
| dc.creator | Cleve, Richard | |
| dc.creator | Sanders, Barry C. | |
| dc.date | 2005-08-18 | |
| dc.date | 2006-02-08 | |
| dc.date.accessioned | 2026-07-07T07:55:15Z | |
| dc.date.available | 2026-07-07T07:55:15Z | |
| dc.description | We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and |H| is bounded by a constant, we may select any positive integer $k$ such that the simulation requires O((\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible. | |
| dc.description | 9 pages, 2 figures, substantial revisions | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0508139 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0508139 | |
| dc.identifier | Communications in Mathematical Physics 270, 359 (2007) | |
| dc.identifier | doi:10.1007/s00220-006-0150-x | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/126901 | |
| dc.subject | Quantum Physics | |
| dc.title | Efficient quantum algorithms for simulating sparse Hamiltonians | |
| dc.type | text |