{"id":"https://openalex.org/W1993000433","doi":"https://doi.org/10.1137/s0097539702402780","title":"Quantum Algorithms for Element Distinctness","display_name":"Quantum Algorithms for Element Distinctness","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1993000433","doi":"https://doi.org/10.1137/s0097539702402780","mag":"1993000433"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702402780","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702402780","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/quant-ph/0007016","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Harry Buhrman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Christoph D\u00fcrr","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christoph D\u00fcrr","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Mark Heiligman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Heiligman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Peter H\u00f8yer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter H\u00f8yer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Fr\u00e9d\u00e9ric Magniez","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Magniez","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Miklos Santha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Miklos Santha","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ronald de Wolf","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ronald de Wolf","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3765,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.94719662,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"34","issue":"6","first_page":"1324","last_page":"1330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.508400022983551,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.508400022983551,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.3785000145435333,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.014700000174343586,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.6233000159263611},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.585099995136261},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5676000118255615},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5453000068664551},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.4810999929904938},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4129999876022339},{"id":"https://openalex.org/keywords/quantum-sort","display_name":"Quantum sort","score":0.37599998712539673},{"id":"https://openalex.org/keywords/quantum-information","display_name":"Quantum information","score":0.3637000024318695}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6531999707221985},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.6233000159263611},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.585099995136261},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5676000118255615},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5453000068664551},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4810999929904938},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4616999924182892},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4341000020503998},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.37599998712539673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36970001459121704},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.3637000024318695},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.3458000123500824},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.3199999928474426},{"id":"https://openalex.org/C2778926657","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum system","level":3,"score":0.2973000109195709},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27970001101493835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2791999876499176},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.25029999017715454}],"mesh":[],"locations_count":14,"locations":[{"id":"doi:10.1137/s0097539702402780","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702402780","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/00c96d66-2321-4971-981e-5f91cec93ce0","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/quantum-algorithms-for-element-distinctness(00c96d66-2321-4971-981e-5f91cec93ce0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H M, D\u00fcrr, C, Heiligman, M, Hoyer, P, Magniez, F, Santha, M & de Wolf, R M 2005, 'Quantum Algorithms for Element Distinctness', SIAM Journal on Computing, vol. 34, no. 6, pp. 1324-1330. https://doi.org/10.1137/S0097539702402780","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/44d409b9-8cfa-4684-8afc-623e8b217a62","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/quantum-algorithms-for-element-distinctness(44d409b9-8cfa-4684-8afc-623e8b217a62).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H M, D\u00fcrr, C, Heiligman, M, H\u00f8yer, P, Magniez, F, Santha, M & de Wolf, R M 2001, Quantum algorithms for element distinctness. in In Proceedings of 16th IEEE Conference on Computational Complexity. pp. 131-137.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:quant-ph/0007016","is_oa":true,"landing_page_url":"http://arxiv.org/abs/quant-ph/0007016","pdf_url":"https://arxiv.org/pdf/quant-ph/0007016","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:cwi:oai:cwi.nl:16381","is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/16381","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 34(6), 1324 - 1330","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.7384","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.7384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~magniez/PAPIERS/bdhhmsw-complexity01.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.9200","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/~hoyer/papers/BDHHMSW00-collision.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.3162","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cwi.nl/~rdewolf/publ/qc/ed.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.6832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~rdewolf/publ/qc/ed.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.80.5522","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.5522","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~santha/Papers/bdhhmsw-paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.1174","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.1174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cpsc.ucalgary.ca/~hoyer/papers/BDHHMSW01-collision.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.2207","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.2207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lri.fr/~magniez/PAPIERS/bdhhmsw-sicomp05.pdf","raw_type":"text"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/00c96d66-2321-4971-981e-5f91cec93ce0","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/quantum-algorithms-for-element-distinctness(00c96d66-2321-4971-981e-5f91cec93ce0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 34(6), 1324 - 1330. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/44d409b9-8cfa-4684-8afc-623e8b217a62","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/quantum-algorithms-for-element-distinctness(44d409b9-8cfa-4684-8afc-623e8b217a62).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In Proceedings of 16th IEEE Conference on Computational Complexity, 131 - 137","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:quant-ph/0007016","is_oa":true,"landing_page_url":"http://arxiv.org/abs/quant-ph/0007016","pdf_url":"https://arxiv.org/pdf/quant-ph/0007016","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1991155917","https://openalex.org/W2003004068","https://openalex.org/W2034038586","https://openalex.org/W2109371739","https://openalex.org/W2149512830","https://openalex.org/W3023478445"],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"several":[2],"applications":[3],"of":[4,16,26,44],"quantum":[5,61],"amplitude":[6],"amplification":[7],"for":[8,22,31],"deciding":[9],"whether":[10],"all":[11],"elements":[12],"in":[13,35,59,70],"the":[14,60,73],"image":[15],"a":[17,33,36],"given":[18],"function":[19],"are":[20],"distinct,":[21],"finding":[23,32],"an":[24],"intersection":[25],"two":[27],"sorted":[28],"tables,":[29],"and":[30,41,47],"triangle":[34],"graph.":[37],"Our":[38],"techniques":[39],"generalize":[40],"improve":[42],"those":[43],"Brassard,":[45],"Hoyer,":[46],"Tapp":[48],"[ACM":[49],"SIGACT":[50],"News,":[51],"28":[52],"(1997),":[53],"pp.":[54],"14--19].":[55],"This":[56],"shows":[57],"that":[58],"world":[62],"element":[63],"distinctness":[64],"is":[65],"significantly":[66],"easier":[67],"than":[68],"sorting,":[69],"contrast":[71],"to":[72],"classical":[74],"world.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2016-06-24T00:00:00"}