Optimal exact quantum algorithm for the promised element distinctness problem
Optimal exact quantum algorithm for the promised element distinctness problem
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
The element distinctness problem is to determine whether a string \(x=(x_1,\ldots,x_N)\) of \(N\) elements contains two elements of the same value (a.k.a colliding pair), for which Ambainis proposed an optimal quantum algorithm. The idea behind Ambainis' algorithm is to first reduce the problem to the promised version in which \(x\) is promised to...
Alternative Titles
Full title
Optimal exact quantum algorithm for the promised element distinctness problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2735851788
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2735851788
Other Identifiers
E-ISSN
2331-8422
DOI
10.48550/arxiv.2211.05443
