IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v59y2007i2p199-216.html
   My bibliography  Save this article

Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm

Author

Listed:
  • M. A. Jafarizadeh
  • R. Sufiani
  • S. Salimi
  • S. Jafarizadeh

Abstract

In papers [Jafarizadehn and Salimi, Ann. Phys. 322, 1005 (2007) and J. Phys. A: Math. Gen. 39, 13295 (2006)], the amplitudes of continuous-time quantum walk (CTQW) on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated with their adjacency matrix. Here in this paper, it is shown that the CTQW on any arbitrary graph can be investigated by spectral analysis method, simply by using Krylov subspace-Lanczos algorithm to generate orthonormal bases of Hilbert space of quantum walk isomorphic to orthogonal polynomials. Also new type of graphs possessing generalized quantum decomposition (GQD) have been introduced, where this is achieved simply by relaxing some of the constrains imposed on QD graphs and it is shown that both in QD and GQD graphs, the unit vectors of strata are identical with the orthonormal basis produced by Lanczos algorithm. Moreover, it is shown that probability amplitude of observing the walk at a given vertex is proportional to its coefficient in the corresponding unit vector of its stratum, and it can be written in terms of the amplitude of its stratum. The capability of Lanczos-based algorithm for evaluation of CTQW on graphs (GQD or non-QD types), has been tested by calculating the probability amplitudes of quantum walk on some interesting finite (infinite) graph of GQD type and finite (infinite) path graph of non-GQD type, where the asymptotic behavior of the probability amplitudes at the limit of the large number of vertices, are in agreement with those of central limit theorem of [Phys. Rev. E 72, 026113 (2005)]. At the end, some applications of the method such as implementation of quantum search algorithms, calculating the resistance between two nodes in regular networks and applications in solid state and condensed matter physics, have been discussed, where in all of them, the Lanczos algorithm, reduces the Hilbert space to some smaller subspaces and the problem is investigated in the subspace with maximal dimension. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2007

Suggested Citation

  • M. A. Jafarizadeh & R. Sufiani & S. Salimi & S. Jafarizadeh, 2007. "Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 59(2), pages 199-216, September.
  • Handle: RePEc:spr:eurphb:v:59:y:2007:i:2:p:199-216
    DOI: 10.1140/epjb/e2007-00281-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2007-00281-5
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1140/epjb/e2007-00281-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    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:spr:eurphb:v:59:y:2007:i:2:p:199-216. See general information about how to correct material in RePEc.

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

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.