Quadratic speedup for finding marked vertices by Quantum walks

Saved in:
Bibliographic Details
Published inProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
Format Conference Proceeding
LanguageEnglish
Published 22.06.2020
Online AccessGet full text
DOI10.1145/3357713.3384252

Cover

BookMark eNotj09LxDAQxXPQg66eveYLdG0ySdNeBFn8BwuLoOcwSSZStpstaav021uxvMO7vPdmftfsIp0TMXYnyq0QSt8DaGMEbAFqJbW8Yg_vE4aMY-v50BOFqefxnHlsU2jTFz9hPlLg35SXBA3czXwppHE68R_sjsMNu4zYDXS7-oZ9Pj997F6L_eHlbfe4LxBAjYU3WkjSjUCnlQ-1C6WkqGOFgiQ0TgYEdFQbRzpo8pUAr6KqmhoXmQY2rPzfnVKP83K6s31ul-9mK0r7h2ZXNLuiwS81GElh
ContentType Conference Proceeding
DBID ADTOC
UNPAY
DOI 10.1145/3357713.3384252
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID oai:circle.library.ubc.ca:2429/72020
GroupedDBID ADTOC
UNPAY
ID FETCH-LOGICAL-a334t-c7512e591ab54cd8bd02ef5f6a1e239b2da3abe87be5d5ec613c4f4698a8a8793
IEDL.DBID UNPAY
IngestDate Sun Oct 26 02:32:41 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License cc-by-nc-nd
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a334t-c7512e591ab54cd8bd02ef5f6a1e239b2da3abe87be5d5ec613c4f4698a8a8793
OpenAccessLink https://proxy.k.utb.cz/login?url=http://hdl.handle.net/2429/72020
ParticipantIDs unpaywall_primary_10_1145_3357713_3384252
PublicationCentury 2000
PublicationDate 2020-06-22
PublicationDateYYYYMMDD 2020-06-22
PublicationDate_xml – month: 06
  year: 2020
  text: 2020-06-22
  day: 22
PublicationDecade 2020
PublicationTitle Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
PublicationYear 2020
Score 2.4284983
SourceID unpaywall
SourceType Open Access Repository
Title Quadratic speedup for finding marked vertices by Quantum walks
URI http://hdl.handle.net/2429/72020
UnpaywallVersion submittedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH6M7aBeVJz4mxy8eOjWpUnTXAQRxxAcExzMU8mvetisxbXI_Ot92eoUxYPk2ATCl6Rfvva97wGch1YmRvjMXxbagEUuDCS3NhDG0TiTkdLWf4e8G8aDMbud8EkDPkvW_bAXQP6QXYH6HEV5K-Z4225CazwcXT3WLj09xrtRxAVKrQ6KLdyAdAs2qrxQizc1m32jiv72KmRxvnQY9BEi005V6o55_-2_-OcsdqD9lYhHRmuK2YWGy_fg8r5S1i-cIfMCn1QFwZsnWf59zp_Isw-4sWRZZxlfAkQvCA5AankmONnpvA3j_s3D9SCoyyAEKopYGRiBpOy47CnNmbGJtiF1Gc9i1XM0kppahZC6RGjHLXcGCdqwzFeGVNjw_O1DM3_J3QEQ1BKKJ0okVmtmUaxoi3JBMm68S7uLD-FijV1arOwu0lXqMk9rnNMa56N_9D2GTQ-fD7Gi9ASa5WvlTpHMS31Wr-cHlTKdqQ
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH6M7aBeVJz4mxy8eOjWpUnTXAQRxxAcExzMU8mvetisxbXI_Ot92eoUxYPk2ATCl6Rfvva97wGch1YmRvjMXxbagEUuDCS3NhDG0TiTkdLWf4e8G8aDMbud8EkDPkvW_bAXQP6QXYH6HEV5K-Z4225CazwcXT3WLj09xrtRxAVKrQ6KLdyAdAs2qrxQizc1m32jiv72KmRxvnQY9BEi005V6o55_-2_-OcsdqD9lYhHRmuK2YWGy_fg8r5S1i-cIfMCn1QFwZsnWf59zp_Isw-4sWRZZxlfAkQvCA5AankmONnpvA3j_s3D9SCoyyAEKopYGRiBpOy47CnNmbGJtiF1Gc9i1XM0kppahZC6RGjHLXcGCdqwzFeGVNjw_O1DM3_J3QEQ1BKKJ0okVmtmUaxoi3JBMm68S7uLD-FijV1arOwu0lXqMk9rnNMa56N_9D2GTQ-fD7Gi9ASa5WvlTpHMS31Wr-cHlTKdqQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+52nd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=Quadratic+speedup+for+finding+marked+vertices+by+Quantum+walks&rft.date=2020-06-22&rft_id=info:doi/10.1145%2F3357713.3384252&rft.externalDocID=oai%3Acircle.library.ubc.ca%3A2429%2F72020