Editing Lov Grover (section)

{{short description|Indian-American computer scientist}}
{{Use American English|date=January 2019}}

{{Infobox scientist
| honorific_prefix  = 
| name              = Lov Grover
| honorific_suffix  = 
| native_name       = 
| native_name_lang  = 
| image             = <!--(filename only, i.e. without "File:" prefix)-->
| image_size        = 
| image_upright     = 
| alt               = 
| caption           = 
| birth_name        = Lov Kumar Grover
| birth_date        = {{Birth year and age|1961}}
| birth_place       = [[Meerut]], [[India]]
| death_date        = <!--{{death date and age |YYYY|MM|DD |YYYY|MM|DD}} (death date then birth date)-->
| death_place       = 
| death_cause       = 
| resting_place     = 
| resting_place_coordinates = <!--{{coord|LAT|LONG|type:landmark|display=inline,title}}-->
| home_town         = 
| other_names       = 
| pronounce         = 
| residence         = 
| citizenship       = 
| nationality       = 
| fields            = 
| workplaces        = [[Bell Labs]]<br>[[Cornell University]]
| patrons           = 
| education         = 
| alma_mater        = [[Indian Institute of Technology Delhi|Indian Institute of Technology, Delhi]]<br>[[Stanford University]]
| thesis_title      = New concepts in free electron lasers
| thesis_url        = <!--(or  | thesis1_url  =   and  | thesis2_url  =  )-->
| thesis_year       = 1985
| doctoral_advisor  = 
| academic_advisors = 
| doctoral_students = 
| notable_students  = 
| known_for         = [[Grover's algorithm]]<br>[[Amplitude amplification]]
| influences        = 
| influenced        = 
| awards            = 
| author_abbrev_bot = 
| author_abbrev_zoo = 
| spouse            = <!--(or | spouses = )-->
| partner           = <!--(or | partners = )-->
| children          = 
| signature         = <!--(filename only)-->
| signature_alt     = 
| website           = <!--{{URL|www.example.com}}-->
| footnotes         = 
}}

'''Lov Kumar Grover''' (born 1961) is an [[India]]n-[[Americans|American]] computer scientist. He is the originator of the [[Grover's algorithm|Grover database search algorithm]] used in [[quantum computing]].<ref>{{cite news|title=Quantum Leap in Searching |url=https://www.wired.com/science/discoveries/news/2000/05/36574 |access-date=19 July 2010 |newspaper=Wired |date=25 July 2000 |url-status=dead |archive-url=https://web.archive.org/web/20110703044742/http://www.wired.com/science/discoveries/news/2000/05/36574 |archive-date=July 3, 2011 }}</ref>  Grover's 1996 algorithm won renown as the second major algorithm proposed for [[quantum computing]] (after [[Shor's algorithm|Shor's 1994 algorithm]]),<ref>{{Cite magazine|url=https://www.wired.com/story/wired-guide-to-quantum-computing/|title=The Wired Guide to Quantum Computing|last=Simonite|first=Tom|date=2018-08-24|magazine=Wired|access-date=2019-01-22|issn=1059-1028}}</ref><ref>{{Cite magazine|url=https://www.quantamagazine.org/quantum-computers-struggle-against-classical-algorithms-20180201/|title=The Ongoing Battle Between Quantum and Classical Computers|last=Bleicher|first=Ariel|date=2018-02-19|magazine=Wired|access-date=2019-01-22|issn=1059-1028}}</ref> and in 2017 was finally implemented in a scalable physical quantum system.<ref>{{Cite web|url=https://www.technologyreview.com/s/604068/quantum-computing-now-has-a-powerful-search-tool/|title=The first quantum search algorithm on a scalable quantum computer has important implications|author=Emerging Technology from the arXiv|website=MIT Technology Review|language=en|access-date=2019-01-22}}</ref>  [[Grover's algorithm]] has been the subject of numerous popular science articles.<ref>{{Cite web|url=https://hackaday.com/2018/02/07/quantum-searching-in-your-browser/|title=Quantum Searching in Your Browser|last=By|date=2018-02-07|website=Hackaday|language=en|access-date=2019-01-22}}</ref><ref>{{Cite web|url=https://www.infoq.com/articles/quantum-computing-applications-three|title=Cats, Qubits, and Teleportation: The Spooky World of Quantum Computation Applications (Part 3)|website=InfoQ|access-date=2019-01-22}}</ref>