Advanced Search
MyIDEAS: Login

Path Integration on a Quantum Computer

Contents:

Author Info

  • Joseph F. Traub
  • Henryk Wozniakowski
Registered author(s):

    Abstract

    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.

    Download Info

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below under "Related research" 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.

    Bibliographic Info

    Paper provided by Santa Fe Institute in its series Working Papers with number 01-10-055.

    as in new window
    Length:
    Date of creation: Oct 2001
    Date of revision:
    Handle: RePEc:wop:safiwp:01-10-055

    Contact details of provider:
    Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
    Web page: http://www.santafe.edu/sfi/publications/working-papers.html
    More information through EDIRC

    Related research

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

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.