nach oben

Quantum Information Processing

Erschienen in:

01.05.2015

Trapping and spreading properties of quantum walk in homological structure

verfasst von: Takuya Machida, Etsuo Segawa

Erschienen in: Quantum Information Processing | Ausgabe 5/2015

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We attempt to extract a homological structure of two kinds of graphs by the Grover walk. The first one consists of a cycle and two semi-infinite lines, and the second one is assembled by a periodic embedding of the cycles in \(\mathbb {Z}\). We show that both of them have essentially the same eigenvalues induced by the existence of cycles in the infinite graphs. The eigenspace of the homological structure appears as so called localization in the Grover walks, in which the walk is partially trapped by the homological structure. On the other hand, the difference of the absolutely continuous part of spectrum between them provides different behaviors. We characterize the behaviors by the density functions in the weak convergence theorem: The first one is the delta measure at the bottom, while the second one is expressed by two kinds of continuous functions, which have different finite supports \((-1/\sqrt{10},1/\sqrt{10})\) and \((-2/7,2/7)\), respectively.

Vorheriger Artikel Introductory words: Special issue on quantum image processing published by Quantum Information Processing

Nächster Artikel Quantum image scaling using nearest neighbor interpolation

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

The one-to-one correspondence between \(V(C_4')\) and \(\mathbb {Z}\times V(\mathcal {D})\) is denoted by \(v_j\leftrightarrow (j,v)\), \((v\in \{0,0',u,d\})\) and one between \(A(C_4')\) and \(\mathbb {Z}\times A(\mathcal {D})\) is \((v_j,w_j)\leftrightarrow (j,(v,w))\) for \((v_j,w_j)\in A(C_4^{(j)})\), \((0_j,0'_{j+1})\leftrightarrow (j,(0,0'))\) and \((0_j',0_{j-1})\leftrightarrow (j,(0',0))\).

More precisely, we impose the following assumptions to \(h(k)\). (i) \(h(k)=h(k+2\pi )\) for all \(k\in \mathbb {R}\), (ii) we permit discontinuity of \(h(k)\) only at \(\{2\pi n+k_j\}_{j=0}^{s-1}\), \(n\in \mathbb {N}\). (iii) for any interval, \(h(k)\) does not take a constant value.

Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of 45th IEEE Symposium Foundations of Computer Science, pp. 22–31 (2004)

Ambainis, A., Kempe J., Rivosh, A.: Coins make quantum walks faster. Proceedings of 33rd ACM Symposium on Theory of Computing, pp. 37–49 (2005)

Exner, P., Seba, P.: Free quantum motion on a branching graph. Rep. Math. Phys. 28, 7–26 (1989)CrossRefADSMATHMathSciNet

Konno, N.: Quantum random walks in one dimension. Quantum Inf. Process. 1, 345–354 (2002)CrossRefMathSciNet

Konno, N.: A new type of limit theorems for the one-dimensional quantum random walk. J. Math. Soc. Jpn. 57, 1179–1195 (2005)CrossRefMATHMathSciNet

Feldman, E., Hillery, M.: Quantum walks on graphs and quantum scattering theory. Contemp. Math. 381, 71–96 (2005)CrossRefMathSciNet

Gnutzmann, S., Smilansky, U.: Quantum graphs: applications to quantum chaos and universal spectral statistics. Adv. Phys. 55, 527–625 (2006)CrossRefADS

Grimmett, G., Janson, S., Scudo, P.F.: Weak limits for quantum random walks. Phys. Rev. E 69, 026119 (2004)CrossRefADS

Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM Symposium on the Theory of Computing, vol. 212, pp. 212–219 (1996)

10.

Higuchi, Yu., Konno, N., Sato, I., Segawa, E.: Quantum graph walks I: mapping to quantum walks. Yokohama Math. J. 59, 34–56 (2013)

11.

Higuchi, Yu., Konno, N., Sato I., Segawa,E.: Spectral and asymptotic properties of Grover walks on crystal lattices. arXiv:1401.0154

12.

Schanz, H., Smilansky, U.: Periodic-orbit theory of Anderson localization on graphs. Phys. Rev. Lett. 14, 1427–1430 (2000)CrossRefADS

13.

Shenvi, N., Kempe, J., Whaley, B.: A quantum random walk search algorithm. Phys. Rev. A 67, 052307 (2003)CrossRefADS

14.

Sunada, T.: Topological Crystallography, Surveys and Tutorials in the Applied Mathematical Sciences, vol. 6. Springer, Berlin (2013)

15.

Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of 45th IEEE Symposium on Foundations of Computer Science, pp. 32–41 (2004)

16.

Tanner, G.: From quantum graphs to quantum random walks. In: Khanna, F., Matrasulov, D. (eds.) Non-linear Dynamics and Fundamental Interactions NATO Science Series II: Mathematics, Physics and Chemistry, vol 213, pp. 69–87. Springer, Netherlands (2006)

17.

Venegas-Andraca, S.E., Ball, J.L.: Processing Images in Entangled Quantum Systems. Quantum Inf. Process. 9, 1–11 (2010)CrossRefMathSciNet

18.

Venegas-Andraca S.E., Bose, S.: Storing, processing, and retrieving an image using quantum mechanics. In: Proceedings of SPIE Conference on Quantum Information and Computation, pp. 137–147 (2003)

19.

Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. J. Comput. Syst. Sci. 62, 376–391 (2001)CrossRefMATHMathSciNet

Titel: Trapping and spreading properties of quantum walk in homological structure
verfasst von: Takuya Machida
Etsuo Segawa
Publikationsdatum: 01.05.2015
Verlag: Springer US
Erschienen in: Quantum Information Processing / Ausgabe 5/2015
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI: https://doi.org/10.1007/s11128-014-0819-6

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 5/2015

Image segmentation on a quantum computer

Quantum multidimensional color images similarity comparison

Quantum image pseudocolor coding based on the density-stratified method

Quantum image translation

A duple watermarking strategy for multi-channel quantum images

Introductory words: Special issue on quantum image processing published by Quantum Information Processing