Advertisement

Quantum Information Processing

, Volume 12, Issue 4, pp 1719–1735 | Cite as

An improved formalism for quantum computation based on geometric algebra—case study: Grover’s search algorithm

  • James M. ChappellEmail author
  • Azhar Iqbal
  • M. A. Lohe
  • Lorenz von Smekal
  • Derek Abbott
Article

Abstract

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is desirable to represent it in the simplest and most intuitive formalism possible. We show firstly, that Clifford’s geometric algebra, provides a significantly simpler representation than the conventional bra-ket notation, and secondly, that the basis defined by the states of maximum and minimum weight in the Grover search space, allows a simple visualization of the Grover search analogous to the precession of a spin-\({\frac{1}{2}}\) particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations. We do not claim the development of an improved algorithm, but show in a tutorial paper that geometric algebra provides extremely compact and elegant expressions with improved clarity for the Grover search algorithm. Being a key algorithm in quantum computing and one of the most studied, it forms an ideal basis for a tutorial on how to elucidate quantum operations in terms of geometric algebra—this is then of interest in extending the applicability of geometric algebra to more complicated problems in fields of quantum computing, quantum decision theory, and quantum information.

Keywords

Grover search algorithm Quantum algorithms Geometric algebra Quantum computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Grover, L.: A framework for fast quantum mechanical algorithms. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, ACM, pp. 53–62 (1998)Google Scholar
  2. 2.
    Grover L.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329–4332 (1998)ADSCrossRefGoogle Scholar
  3. 3.
    Grover L.: From schrödingers equation to the quantum search algorithm. Am. J. Phys. 69(7), 769–777 (2001)ADSCrossRefGoogle Scholar
  4. 4.
    Grover L.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)ADSCrossRefGoogle Scholar
  5. 5.
    Nielsen M., Chuang I.: Quantum Computation and Quantum Information, 1st edn. Addison-Wesley, Cambridge (2002)Google Scholar
  6. 6.
    Ng J., Abbott D.: Introduction to solid-state quantum computation for engineers. Microelectron. J. 33(1–2), 171–177 (2002)CrossRefGoogle Scholar
  7. 7.
    Chappell J., Iqbal A., Lohe M., Von Smekal L.: An analysis of the quantum penny flip game using geometric algebra. J. Phys. Soc. Jpn. 78(5), 54801–54804 (2009)ADSCrossRefGoogle Scholar
  8. 8.
    Long G., Tu C., Li Y., Zhang W., Yan H.: An SO(3) picture for quantum searching. J. Phys. A Math. Gen. 34(4), 861–866 (2001)MathSciNetADSzbMATHCrossRefGoogle Scholar
  9. 9.
    Alves R., Lavor C.: Clifford algebra applied to Grover’s algorithm. Adv. Appl. Clifford Algebras 20, 477–488 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Somaroo S., Cory D., Havel T.: Expressing the operations of quantum computing in multiparticle geometric algebra. Phys. Lett. A 240(1–2), 1–7 (1998)MathSciNetADSzbMATHCrossRefGoogle Scholar
  11. 11.
    Gregorič M, Mankoč Borštnik N.: Quantum gates and quantum algorithms with clifford algebra techniques. Int. J. Theor. Phys. 48(2), 507–515 (2009)zbMATHCrossRefGoogle Scholar
  12. 12.
    Hestenes D., Sobczyk G.: Clifford Algebra to Geometric Calculus: A Unified Language for Mathematics and Physics, vol. 5. Springer, Berlin (1984)CrossRefGoogle Scholar
  13. 13.
    Hestenes, D.: Clifford Algebras and Their Applications in Mathematical Physics (Reidel, Dordrecht/Boston, 1986), chap. Clifford Algebra and the interpretation of quantum mechanics (1986)Google Scholar
  14. 14.
    Aerts D., Czachor M.: Cartoon computation: quantum-like computing without quantum mechanics. J. Phys. A Math. Theor. 40(13), F259 (2007)MathSciNetADSzbMATHCrossRefGoogle Scholar
  15. 15.
    Aerts D., Czachor M.: Tensor-product versus geometric-product coding. Phys. Rev. A 77, 012316 (2008)MathSciNetADSCrossRefGoogle Scholar
  16. 16.
    Aerts D., Czachor M., Orlowski L.: Teleportation of geometric structures in 3D. J. Phys. A Math. Theor. 42(13), 135307 (2009)ADSCrossRefGoogle Scholar
  17. 17.
    Vlasov, A.Y.: eprint arXiv:quant-ph/9907079 (1999)Google Scholar
  18. 18.
    Vlasov A.Y.: Clifford algebras and universal sets of quantum gates. Phys. Rev. A 63, 054302 (2001)MathSciNetADSCrossRefGoogle Scholar
  19. 19.
    Chappell J.M., Iqbal A., Abbott D.: N-player quantum games in an EPR setting. PLoS ONE 7(5), e36404 (2012)ADSCrossRefGoogle Scholar
  20. 20.
    Hsieh J., Li C.: General su(2) formulation for quantum searching with certainty. Phys. Rev. A 65, 052322 (2002)ADSCrossRefGoogle Scholar
  21. 21.
    Doran C., Lasenby A.: Geometric Algebra for Physicists. Cambridge University Press, Cambridge (2003)zbMATHCrossRefGoogle Scholar
  22. 22.
    De Sabbata V., Datta B.: Geometric Algebra and Applications to Physics. Taylor & Francis Group, London (2007)zbMATHGoogle Scholar
  23. 23.
    Parker R., Doran C.: Analysis of One and Two Particle Quantum Systems Using Geometric Algebra, pp. 213–226. Birkhäuser, Boston, MA (2002)Google Scholar
  24. 24.
    Li C., Hwang C., Hsieh J., Wang K.: General phase-matching condition for a quantum searching algorithm. Phys. Rev. A 65(3), 034305 (2002)ADSCrossRefGoogle Scholar
  25. 25.
    Long G., Li Y., Zhang W., Niu L.: Phase matching in quantum searching. Phys. Lett. A 262(1), 27–34 (1999)MathSciNetADSzbMATHCrossRefGoogle Scholar
  26. 26.
    Zalka C.: Grover’s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746–2751 (1999)ADSCrossRefGoogle Scholar
  27. 27.
    Boyer M., Brassard G., Høyer P., Tappa A.: Tight bounds on quantum searching. Fortsch. Phys. 46/49, 493–506 (1998)ADSCrossRefGoogle Scholar
  28. 28.
    Shapira D., Shimoni Y., Biham O.: Algebraic analysis of quantum search with pure and mixed states. Phys. Rev. A 71, 042320 (2005)MathSciNetADSCrossRefGoogle Scholar
  29. 29.
    Biham E., Biham O., Biron D., Grassl M., Lidar D.A., Shapira D.: Analysis of generalized Grover quantum search algorithms using recursion equations. Phys. Rev. A 63, 012310 (2000)ADSCrossRefGoogle Scholar
  30. 30.
    Høyer P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62(5), 052304–052309 (2000)ADSCrossRefGoogle Scholar
  31. 31.
    Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for simon’s problem. In: Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems ISTCS, pp. 12–23 (1997)Google Scholar
  32. 32.
    Biham E., Biham O., Biron D., Grassl M., Lidar D.: Grover’s quantum search algorithm for an arbitrary initial amplitude distribution. Phys. Rev. A 60(4), 2742 (1999)ADSCrossRefGoogle Scholar
  33. 33.
    Biham E., Kenigsberg D.: Grover’s quantum search algorithm for an arbitrary initial mixed state. Phys. Rev. A 66, 062301 (2002)ADSCrossRefGoogle Scholar
  34. 34.
    Korepin V.E., Vallilo B.C.: Group theoretical formulation of a quantum partial search algorithm. Prog. Theor. Phys. 116, 783–793 (2006)MathSciNetADSzbMATHCrossRefGoogle Scholar
  35. 35.
    Grover L.K.: Fixed-point quantum search. Phys. Rev. Lett. 95, 150501–150504 (2005)ADSCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • James M. Chappell
    • 1
    Email author
  • Azhar Iqbal
    • 1
  • M. A. Lohe
    • 2
  • Lorenz von Smekal
    • 3
  • Derek Abbott
    • 1
  1. 1.School of Electrical and Electronic EngineeringUniversity of AdelaideAdelaideAustralia
  2. 2.School of Chemistry and PhysicsUniversity of AdelaideAdelaideAustralia
  3. 3.Institut für KernphysikTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations