IDEAS home Printed from
   My bibliography  Save this paper

Path Integration on a Quantum Computer


  • Joseph F. Traub
  • Henryk Wozniakowski


We study path integration on a quantum computer that performs quantum summation. We assume that the measure of path integration is Gaussian, with the eigenvalues of its covariance operator of order j^{-k} with k>1. For the Wiener measure occurring in many applications we have k=2. We want to compute an e-approximation to path integrals whose integrands are at least Lipschitz. We prove: 1. Path integration on a quantum computer is tractable. 2. Path integration on a quantum computer can be solved roughly e^{-1} times faster than on a classical computer using randomization, and exponentially faster than on a classical computer with a worst case assurance. 3. The number of quantum queries is the square root of the number of function values needed on a classical computer using randomization. 4.The number of qubits is polynomial in e^{-1}. Furthermore, for the Wiener measure the degree is 2 for Lipschitz functions, and the degree is 1 for smoother integrands.

Suggested Citation

  • Joseph F. Traub & Henryk Wozniakowski, 2001. "Path Integration on a Quantum Computer," Working Papers 01-10-055, Santa Fe Institute.
  • Handle: RePEc:wop:safiwp:01-10-055

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Heinrich, Stefan, 2003. "From Monte Carlo to quantum computation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 62(3), pages 219-230.

    More about this item


    Quantum computation; path integration; quantum summation; qubits; computational complexity;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:01-10-055. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.