On the Efficiency of Quantum Algorithms for Hamiltonian Simulation

Details On the Efficiency of Quantum Algorithms for Hamiltonian Simulation On the Efficiency of Quantum Algorithms for Hamiltonian Simulation

2010-05-08

arxiv.org/abs/1005.1318v3

Physics

Quantum Physics

15 pages

Scientific paper

We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $\e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results.

Affiliated with

Also associated with

No associations

Rating

On the Efficiency of Quantum Algorithms for Hamiltonian Simulation 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 On the Efficiency of Quantum Algorithms for Hamiltonian Simulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Efficiency of Quantum Algorithms for Hamiltonian Simulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303343