Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/341621
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE ESTADUAL DE CAMPINASpt_BR
dc.contributor.authorunicampLavor, Carlile Campos-
dc.typeOutro documentopt_BR
dc.titleGrover’s algorithm for unstructured searchpt_BR
dc.contributor.authorMarquezino, Franklin de Lima-
dc.contributor.authorPortugal, Renato-
dc.contributor.authorLavor, Carlile-
dc.subjectAlgoritmospt_BR
dc.subject.otherlanguageAlgorithmspt_BR
dc.description.abstractGrover’s algorithm is used to search for an element on an unsorted list with quadratic speed-up when compared to the best possible classical algorithm. This quantum algorithm has an enormous historical importance, and is also a fundamental building block in quantum computingpt_BR
dc.relation.ispartofSpringerBriefs in computer sciencept_BR
dc.publisher.cityHeidelbergpt_BR
dc.publisher.countryAlemanhapt_BR
dc.publisherSpringerpt_BR
dc.date.issued2019-
dc.date.monthofcirculationJunept_BR
dc.language.isoengpt_BR
dc.description.firstpage35pt_BR
dc.description.lastpage55pt_BR
dc.rightsFechadopt_BR
dc.sourceSCOPUSpt_BR
dc.identifier.issn2191-5768pt_BR
dc.identifier.eissn2191-5776pt_BR
dc.identifier.doi10.1007/978-3-030-19066-8_3pt_BR
dc.identifier.urlhttps://link.springer.com/chapter/10.1007/978-3-030-19066-8_3pt_BR
dc.description.sponsorshipCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQpt_BR
dc.description.sponsorshipCOORDENAÇÃO DE APERFEIÇOAMENTO DE PESSOAL DE NÍVEL SUPERIOR - CAPESpt_BR
dc.description.sponsorshipFUNDAÇÃO CARLOS CHAGAS FILHO DE AMPARO À PESQUISA DO ESTADO DO RIO DE JANEIRO - FAPERJpt_BR
dc.description.sponsorshipFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESPpt_BR
dc.description.sponsordocumentnumberNão tempt_BR
dc.description.sponsordocumentnumberNão tempt_BR
dc.description.sponsordocumentnumberNão tempt_BR
dc.description.sponsordocumentnumberNão tempt_BR
dc.date.available2020-05-18T17:24:49Z-
dc.date.accessioned2020-05-18T17:24:49Z-
dc.description.provenanceSubmitted by Susilene Barbosa da Silva (susilene@unicamp.br) on 2020-05-18T17:24:49Z No. of bitstreams: 0en
dc.description.provenanceMade available in DSpace on 2020-05-18T17:24:49Z (GMT). No. of bitstreams: 0 Previous issue date: 2019en
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/341621-
dc.contributor.departmentDepartamento de Matemática Aplicadapt_BR
dc.contributor.unidadeInstituto de Matemática, Estatística e Computação Científicapt_BR
dc.subject.keywordAlgorithm quantumpt_BR
dc.identifier.source2-s2.0-85068083282pt_BR
dc.creator.orcid0000-0002-8105-3627pt_BR
dc.type.formCapítulo de livropt_BR
dc.description.sponsorNoteWe are grateful to our colleagues and students from the Federal University of Rio de Janeiro (UFRJ, Brazil), the National Laboratory for Scientific Computing (LNCC, Brazil), and the University of Campinas (UNICAMP, Brazil) for several important discussions and interesting ideas. We acknowledge CAPES, CNPq, FAPERJ, and FAPESP—Brazilian funding agencies—for the financial support to our research projects. We also thank the Brazilian Society of Computational and Applied Mathematics (SBMAC) for the opportunity to give a course on this subject that resulted in the first version of this monograph in Portuguese (http://www.sbmac.org.br/arquivos/notas/livro_08.pdf), which in turn evolved from our earliest tutorials (in arXiv quant-ph/0301079 and quant-ph/0303175)pt_BR
Appears in Collections:IMECC - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.