On the efficiency of quantum algorithms for Hamiltonian simulation

On the efficiency of quantum algorithms for Hamiltonian simulation We study algorithms simulating a system evolving with Hamiltonian $${H = \sum_{j=1}^m H_j}$$ , where each of the H j , j = 1, . . . ,m, can be simulated efficiently. We are interested in the cost for approximating $${e^{-iHt}, t \in \mathbb{R}}$$ , with error $${\varepsilon}$$ . We consider algorithms based on high order splitting formulas that play an important role in quantum Hamiltonian simulation. These formulas approximate e −iHt by a product of exponentials involving the H j , j = 1, . . . ,m. We obtain an upper bound for the number of required exponentials. Moreover, we derive the order of the optimal splitting method that minimizes our upper bound. We show significant speedups relative to previously known results. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

On the efficiency of quantum algorithms for Hamiltonian simulation

Loading next page...
 
/lp/springer_journal/on-the-efficiency-of-quantum-algorithms-for-hamiltonian-simulation-OQjI3cfqtr
Publisher
Springer US
Copyright
Copyright © 2011 by Springer Science+Business Media, LLC
Subject
Physics; Physics, general; Theoretical, Mathematical and Computational Physics; Quantum Physics; Computer Science, general; Mathematics, general
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-011-0263-9
Publisher site
See Article on Publisher Site

Abstract

We study algorithms simulating a system evolving with Hamiltonian $${H = \sum_{j=1}^m H_j}$$ , where each of the H j , j = 1, . . . ,m, can be simulated efficiently. We are interested in the cost for approximating $${e^{-iHt}, t \in \mathbb{R}}$$ , with error $${\varepsilon}$$ . We consider algorithms based on high order splitting formulas that play an important role in quantum Hamiltonian simulation. These formulas approximate e −iHt by a product of exponentials involving the H j , j = 1, . . . ,m. We obtain an upper bound for the number of required exponentials. Moreover, we derive the order of the optimal splitting method that minimizes our upper bound. We show significant speedups relative to previously known results.

Journal

Quantum Information ProcessingSpringer Journals

Published: Jul 28, 2011

References

  • An example of the difference between quantum and classical random walks
    Childs, A.; Farhi, E.; Gutmann, S.
  • General theory of fractal path integrals with application to many-body theories and statistical physics
    Suzuki, M.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off