{
  "id": "1005.1318",
  "version": "v3",
  "published": "2010-05-08T02:08:01.000Z",
  "updated": "2010-10-11T19:57:19.000Z",
  "title": "On the Efficiency of Quantum Algorithms for Hamiltonian Simulation",
  "authors": [
    "Anargyros Papageorgiou",
    "Chi Zhang"
  ],
  "comment": "15 pages",
  "categories": [
    "quant-ph"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2010-10-11T19:57:19.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum algorithms",
      "efficiency",
      "high order splitting methods",
      "quantum hamiltonian simulation",
      "significant speedups"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1005.1318P"
    }
  }
}