Efficient quantum algorithms for simulating sparse Hamiltonians

Details Efficient quantum algorithms for simulating sparse Hamiltonians Efficient quantum algorithms for simulating sparse Hamiltonians

2005-08-18

arxiv.org/abs/quant-ph/0508139v2

Communications in Mathematical Physics 270, 359 (2007)

Physics

Quantum Physics

9 pages, 2 figures, substantial revisions

Scientific paper

10.1007/s00220-006-0150-x

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.

Affiliated with

Also associated with

No associations

Rating

Efficient quantum algorithms for simulating sparse Hamiltonians does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient quantum algorithms for simulating sparse Hamiltonians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum algorithms for simulating sparse Hamiltonians will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365619