{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:18:31Z","timestamp":1758637111648},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,9,21]],"date-time":"2012-09-21T00:00:00Z","timestamp":1348185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s11128-012-0483-7","type":"journal-article","created":{"date-parts":[[2012,9,20]],"date-time":"2012-09-20T11:00:01Z","timestamp":1348138801000},"page":"1719-1735","source":"Crossref","is-referenced-by-count":6,"title":["An improved formalism for quantum computation based on geometric algebra\u2014case study: Grover\u2019s search algorithm"],"prefix":"10.1007","volume":"12","author":[{"given":"James M.","family":"Chappell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azhar","family":"Iqbal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Lohe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenz","family":"von Smekal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derek","family":"Abbott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,21]]},"reference":[{"key":"483_CR1","doi-asserted-by":"crossref","unstructured":"Grover, L.: A framework for fast quantum mechanical algorithms. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, ACM, pp. 53\u201362 (1998)","DOI":"10.1145\/276698.276712"},{"issue":"19","key":"483_CR2","doi-asserted-by":"crossref","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"L. Grover","year":"1998","unstructured":"Grover L.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329\u20134332 (1998)","journal-title":"Phys. Rev. Lett."},{"issue":"7","key":"483_CR3","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1119\/1.1359518","volume":"69","author":"L. Grover","year":"2001","unstructured":"Grover L.: From schr\u00f6dingers equation to the quantum search algorithm. Am. J. Phys. 69(7), 769\u2013777 (2001)","journal-title":"Am. J. Phys."},{"issue":"2","key":"483_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L. Grover","year":"1997","unstructured":"Grover L.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"483_CR5","volume-title":"Quantum Computation and Quantum Information, 1st edn","author":"M. Nielsen","year":"2002","unstructured":"Nielsen M., Chuang I.: Quantum Computation and Quantum Information, 1st edn. Addison-Wesley, Cambridge (2002)"},{"issue":"1\u20132","key":"483_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0026-2692(01)00116-1","volume":"33","author":"J. Ng","year":"2002","unstructured":"Ng J., Abbott D.: Introduction to solid-state quantum computation for engineers. Microelectron. J. 33(1\u20132), 171\u2013177 (2002)","journal-title":"Microelectron. J."},{"issue":"5","key":"483_CR7","doi-asserted-by":"crossref","first-page":"54801","DOI":"10.1143\/JPSJ.78.054801","volume":"78","author":"J. Chappell","year":"2009","unstructured":"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\u201354804 (2009)","journal-title":"J. Phys. Soc. Jpn."},{"issue":"4","key":"483_CR8","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1088\/0305-4470\/34\/4\/312","volume":"34","author":"G. Long","year":"2001","unstructured":"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\u2013866 (2001)","journal-title":"J. Phys. A Math. Gen."},{"key":"483_CR9","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s00006-010-0206-z","volume":"20","author":"R. Alves","year":"2010","unstructured":"Alves R., Lavor C.: Clifford algebra applied to Grover\u2019s algorithm. Adv. Appl. Clifford Algebras 20, 477\u2013488 (2010)","journal-title":"Adv. Appl. Clifford Algebras"},{"issue":"1\u20132","key":"483_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0375-9601(98)00010-3","volume":"240","author":"S. Somaroo","year":"1998","unstructured":"Somaroo S., Cory D., Havel T.: Expressing the operations of quantum computing in multiparticle geometric algebra. Phys. Lett. A 240(1\u20132), 1\u20137 (1998)","journal-title":"Phys. Lett. A"},{"issue":"2","key":"483_CR11","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10773-008-9826-7","volume":"48","author":"M. Gregori\u010d","year":"2009","unstructured":"Gregori\u010d M, Manko\u010d Bor\u0161tnik N.: Quantum gates and quantum algorithms with clifford algebra techniques. Int. J. Theor. Phys. 48(2), 507\u2013515 (2009)","journal-title":"Int. J. Theor. Phys."},{"key":"483_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-6292-7","volume-title":"Clifford Algebra to Geometric Calculus: A Unified Language for Mathematics and Physics, vol. 5","author":"D. Hestenes","year":"1984","unstructured":"Hestenes D., Sobczyk G.: Clifford Algebra to Geometric Calculus: A Unified Language for Mathematics and Physics, vol. 5. Springer, Berlin (1984)"},{"key":"483_CR13","doi-asserted-by":"crossref","unstructured":"Hestenes, D.: Clifford Algebras and Their Applications in Mathematical Physics (Reidel, Dordrecht\/Boston, 1986), chap. Clifford Algebra and the interpretation of quantum mechanics (1986)","DOI":"10.1007\/978-94-009-4728-3_27"},{"issue":"13","key":"483_CR14","doi-asserted-by":"crossref","first-page":"F259","DOI":"10.1088\/1751-8113\/40\/13\/F01","volume":"40","author":"D. Aerts","year":"2007","unstructured":"Aerts D., Czachor M.: Cartoon computation: quantum-like computing without quantum mechanics. J. Phys. A Math. Theor. 40(13), F259 (2007)","journal-title":"J. Phys. A Math. Theor."},{"key":"483_CR15","doi-asserted-by":"crossref","first-page":"012316","DOI":"10.1103\/PhysRevA.77.012316","volume":"77","author":"D. Aerts","year":"2008","unstructured":"Aerts D., Czachor M.: Tensor-product versus geometric-product coding. Phys. Rev. A 77, 012316 (2008)","journal-title":"Phys. Rev. A"},{"issue":"13","key":"483_CR16","doi-asserted-by":"crossref","first-page":"135307","DOI":"10.1088\/1751-8113\/42\/13\/135307","volume":"42","author":"D. Aerts","year":"2009","unstructured":"Aerts D., Czachor M., Orlowski L.: Teleportation of geometric structures in 3D. J. Phys. A Math. Theor. 42(13), 135307 (2009)","journal-title":"J. Phys. A Math. Theor."},{"key":"483_CR17","unstructured":"Vlasov, A.Y.: eprint arXiv:quant-ph\/9907079 (1999)"},{"key":"483_CR18","doi-asserted-by":"crossref","first-page":"054302","DOI":"10.1103\/PhysRevA.63.054302","volume":"63","author":"A.Y. Vlasov","year":"2001","unstructured":"Vlasov A.Y.: Clifford algebras and universal sets of quantum gates. Phys. Rev. A 63, 054302 (2001)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"483_CR19","doi-asserted-by":"crossref","first-page":"e36404","DOI":"10.1371\/journal.pone.0036404","volume":"7","author":"J.M. Chappell","year":"2012","unstructured":"Chappell J.M., Iqbal A., Abbott D.: N-player quantum games in an EPR setting. PLoS ONE 7(5), e36404 (2012)","journal-title":"PLoS ONE"},{"key":"483_CR20","doi-asserted-by":"crossref","first-page":"052322","DOI":"10.1103\/PhysRevA.65.052322","volume":"65","author":"J. Hsieh","year":"2002","unstructured":"Hsieh J., Li C.: General su(2) formulation for quantum searching with certainty. Phys. Rev. A 65, 052322 (2002)","journal-title":"Phys. Rev. A"},{"key":"483_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807497","volume-title":"Geometric Algebra for Physicists","author":"C. Doran","year":"2003","unstructured":"Doran C., Lasenby A.: Geometric Algebra for Physicists. Cambridge University Press, Cambridge (2003)"},{"key":"483_CR22","volume-title":"Geometric Algebra and Applications to Physics","author":"V. De Sabbata","year":"2007","unstructured":"De Sabbata V., Datta B.: Geometric Algebra and Applications to Physics. Taylor & Francis Group, London (2007)"},{"key":"483_CR23","first-page":"213","volume-title":"Analysis of One and Two Particle Quantum Systems Using Geometric Algebra","author":"R. Parker","year":"2002","unstructured":"Parker R., Doran C.: Analysis of One and Two Particle Quantum Systems Using Geometric Algebra, pp. 213\u2013226. Birkh\u00e4user, Boston, MA (2002)"},{"issue":"3","key":"483_CR24","doi-asserted-by":"crossref","first-page":"034305","DOI":"10.1103\/PhysRevA.65.034305","volume":"65","author":"C. Li","year":"2002","unstructured":"Li C., Hwang C., Hsieh J., Wang K.: General phase-matching condition for a quantum searching algorithm. Phys. Rev. A 65(3), 034305 (2002)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"483_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0375-9601(99)00631-3","volume":"262","author":"G. Long","year":"1999","unstructured":"Long G., Li Y., Zhang W., Niu L.: Phase matching in quantum searching. Phys. Lett. A 262(1), 27\u201334 (1999)","journal-title":"Phys. Lett. A"},{"key":"483_CR26","doi-asserted-by":"crossref","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C. Zalka","year":"1999","unstructured":"Zalka C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60, 2746\u20132751 (1999)","journal-title":"Phys. Rev. A"},{"key":"483_CR27","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46\/49","author":"M. Boyer","year":"1998","unstructured":"Boyer M., Brassard G., H\u00f8yer P., Tappa A.: Tight bounds on quantum searching. Fortsch. Phys. 46\/49, 493\u2013506 (1998)","journal-title":"Fortsch. Phys."},{"key":"483_CR28","doi-asserted-by":"crossref","first-page":"042320","DOI":"10.1103\/PhysRevA.71.042320","volume":"71","author":"D. Shapira","year":"2005","unstructured":"Shapira D., Shimoni Y., Biham O.: Algebraic analysis of quantum search with pure and mixed states. Phys. Rev. A 71, 042320 (2005)","journal-title":"Phys. Rev. A"},{"key":"483_CR29","doi-asserted-by":"crossref","first-page":"012310","DOI":"10.1103\/PhysRevA.63.012310","volume":"63","author":"E. Biham","year":"2000","unstructured":"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)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"483_CR30","doi-asserted-by":"crossref","first-page":"052304","DOI":"10.1103\/PhysRevA.62.052304","volume":"62","author":"P. H\u00f8yer","year":"2000","unstructured":"H\u00f8yer P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62(5), 052304\u2013052309 (2000)","journal-title":"Phys. Rev. A"},{"key":"483_CR31","doi-asserted-by":"crossref","unstructured":"Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for simon\u2019s problem. In: Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems ISTCS, pp. 12\u201323 (1997)","DOI":"10.1109\/ISTCS.1997.595153"},{"issue":"4","key":"483_CR32","doi-asserted-by":"crossref","first-page":"2742","DOI":"10.1103\/PhysRevA.60.2742","volume":"60","author":"E. Biham","year":"1999","unstructured":"Biham E., Biham O., Biron D., Grassl M., Lidar D.: Grover\u2019s quantum search algorithm for an arbitrary initial amplitude distribution. Phys. Rev. A 60(4), 2742 (1999)","journal-title":"Phys. Rev. A"},{"key":"483_CR33","doi-asserted-by":"crossref","first-page":"062301","DOI":"10.1103\/PhysRevA.66.062301","volume":"66","author":"E. Biham","year":"2002","unstructured":"Biham E., Kenigsberg D.: Grover\u2019s quantum search algorithm for an arbitrary initial mixed state. Phys. Rev. A 66, 062301 (2002)","journal-title":"Phys. Rev. A"},{"key":"483_CR34","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1143\/PTP.116.783","volume":"116","author":"V.E. Korepin","year":"2006","unstructured":"Korepin V.E., Vallilo B.C.: Group theoretical formulation of a quantum partial search algorithm. Prog. Theor. Phys. 116, 783\u2013793 (2006)","journal-title":"Prog. Theor. Phys."},{"key":"483_CR35","doi-asserted-by":"crossref","first-page":"150501","DOI":"10.1103\/PhysRevLett.95.150501","volume":"95","author":"L.K. Grover","year":"2005","unstructured":"Grover L.K.: Fixed-point quantum search. Phys. Rev. Lett. 95, 150501\u2013150504 (2005)","journal-title":"Phys. Rev. Lett."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-012-0483-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-012-0483-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-012-0483-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:10:03Z","timestamp":1562195403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-012-0483-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,21]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["483"],"URL":"https:\/\/doi.org\/10.1007\/s11128-012-0483-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,21]]}}}