Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over 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)t1+1/2k) accesses to matrix entries of H. We also show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible.

[1]  R. Feynman.  Simulating physics with computers , 1999 .

[2]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[3]  M. Suzuki,et al.  Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations , 1990 .

[4]  M. Suzuki,et al.  General theory of fractal path integrals with applications to many‐body theories and statistical physics , 1991 .

[5]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[6]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Seth Lloyd,et al.  Universal Quantum Simulators , 1996, Science.

[8]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[9]  M. Sipser,et al.  Limit on the Speed of Quantum Computation in Determining Parity , 1998, quant-ph/9802045.

[10]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[12]  Edward Farhi,et al.  An Example of the Difference Between Quantum and Classical Random Walks , 2002, Quantum Inf. Process..

[13]  K. Birgitta Whaley,et al.  Quantum random-walk search algorithm , 2002, quant-ph/0210064.

[14]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[15]  Amnon Ta-Shma,et al.  Adiabatic quantum state generation and statistical zero knowledge , 2003, STOC '03.

[16]  Andrew M. Childs,et al.  Quantum information processing in continuous time , 2004 .

[17]  Graeme Ahokas.  Improved algorithms for approximate quantum fourier transforms and sparse hamiltonian simulations , 2004 .

[18]  Andris Ambainis,et al.  Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.

[19]  Andrew M. Childs,et al.  Spatial search by quantum walk , 2003, quant-ph/0306054.

[20]  Andris Ambainis,et al.  Coins make quantum walks faster , 2004, SODA '05.

[21]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.

[22]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.