Abstract
A fast and efficient quantum search algorithm is established by using the ability of an exciton to propagate along a star graph that exhibits two identical energetic defects. The first defect lies on the well-defined input site where the exciton is initially created, whereas the second defect occupies the target site whose unknown position must be determined. It is shown that when the energetic defects are judiciously chosen, specific quantum interferences arise so that the probability to observe the exciton on the target site becomes close to unity at a very short time \(t^{*}\). Consequently, a measurement of the exciton quantum state at time \(t^{*}\) will reveal the identity of the position of the target site. The key point is that \(t^{*}\) is the shortest time independent on the size of the graph that is physically accessible to the exciton to tunnel.
Similar content being viewed by others
References
Feynman, R.: Simulating physics with computers. Int. J. Theor. Phys. 21, 467 (1982)
Deutsch, D.: Quantum theory, the Church–Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400, 97 (1985)
Shor, P.W.: Algorithms for quantum computation discrete log and factoring. In: Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, Los Alamos, p. 20 (1994)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484 (1997)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 212–219. ACM Press, New York (1996)
Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325 (1997)
Roland, J., Cerf, N.J.: Quantum search by local adiabatic evolution. Phys. Rev. A 65, 042308 (2002)
Dowling, J.P.: Quantum information: To compute or not to compute? Nature (London) 439, 919 (2006)
Daems, D., Guerin, S.: Adiabatic quantum search scheme with atoms in a cavity driven by lasers. Phys. Rev. Lett. 99, 170503 (2007)
Farhi, E., Gutmann, S.: Analog analogue of a digital quantum computation. Phys. Rev. A 57, 2403 (1998)
Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70, 022314 (2004)
Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67, 052307 (2003)
Szegedy, M.: Quantum speed-up of markov chain based algorithms. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science p. 32. IEEE Computer Society, Washington, DC (2004)
Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the 16th ACM–SIAM Symposium on Discrete Algorithms p. 1099. Society for Industrial and Applied Mathematics, Philadelphia (2005)
Santha, M.: Quantum walk based search algorithms. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) Proceedings of the Fifth International Conference on Theory and Applications of Models of Computation, TAMC 2008, Xi’an, China, 2008. Lecture Notes in Computer Science, p. 31. Springer, Berlin (2008)
Reitzner, D., Hillery, M., Feldman, E., Buzek, V.: Quantum searches on highly symmetric graphs. Phys. Rev. A 79, 012323 (2009)
Kahou, M.E., Feder, D.L.: Quantum search with interacting Bose–Einstein condensates. Phys. Rev. A 88, 032310 (2013)
Kahou, M.E.: Spatial search via non-linear quantum walk. Ph.D. Thesis, Department of Physics and Astronomy, Calgary (2013)
Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197198, 143 (1994)
Agliari, E., Blumen, A., Mulken, O.: Quantum-walk approach to searching on fractal structures. Phys. Rev. A 82, 012305 (2010)
Thilagam, A.: Grover-like search via Frenkel-exciton trapping mechanism. Phys. Rev. A 81, 032309 (2010)
Pouthier, V.: Vibrational exciton mediated quantum state transfer: simple model. Phys. Rev. B 85, 214303 (2012)
Pouthier, V.: Vibrons in finite size molecular lattices: a route for high-fidelity quantum state transfer at room temperature. J. Phys. Condens. Matter 24, 445401 (2012)
Mulken, O., Bierbaum, V., Blumen, A.: Coherent exciton transport in dendrimers and continuous-time quantum walks. J. Chem. Phys. 124, 124905 (2006)
Mulken, O., Blumen, A.: Continuous-time quantum walks: models for coherent transport on complex networks. Phys. Rep. 502, 37 (2011)
Pouthier, V.: Exciton localization–delocalization transition in an extended dendrimer. J. Chem. Phys. 139, 234111 (2013)
Pouthier, V.: Disorder-enhanced exciton delocalization in an extended dendrimer. Phys. Rev. E 90, 022818 (2014)
Pouthier, V.: The excitonic qubit on a star graph: dephasing-limited coherent motion. Quantum Inf. Process 14, 491 (2015)
Salimi, S.: Continuous-time quantum walks on star graphs. Ann. Phys. 324, 1185 (2009)
Xu, X.P.: Exact analytical results for quantum walks on star graphs. J. Phys. A Math. Theor. 42, 115205 (2009)
Ziletti, A., Borgonovi, F., Celardo, G.L., Izrailev, F.M., Kaplan, L., Zelevinsky, V.G.: Coherent transport in multibranch quantum circuits. Phys. Rev. B 85, 052201 (2012)
Anishchenko, A., Blumen, A., Mulken, O.: Enhancing the spreading of quantum walks on star graphs by additional bonds. Quantum Inf. Process 11, 1273 (2012)
Xu, X.P.: Coherent exciton transport and trapping on long-range interacting cycles. Phys. Rev. E 79, 011117 (2009)
Mulken, O., Blumen, A.: Efficiency of quantum and classical transport on graphs. Phys. Rev. E 73, 066117 (2006)
Wagner, M.: Unitary Transformations in Solid State Physics. North-Holland, Amsterdam (1986)
Cohen-Tannoudji, C., Dupont-Roc, J., Grynberg, G.: Atom–Photon Interactions: Basic Processes and Applications. Wiley, New York (1992)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pouthier, V. Exciton-mediated quantum search on a star graph. Quantum Inf Process 14, 3139–3159 (2015). https://doi.org/10.1007/s11128-015-1043-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-015-1043-8