{"id":"https://openalex.org/W2952035306","doi":"https://doi.org/10.26421/qic13.11-12-7","title":"Efficient classical simulations of quantum Fourier transforms and Normalizer circuits over Abelian groups","display_name":"Efficient classical simulations of quantum Fourier transforms and Normalizer circuits over Abelian groups","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2952035306","doi":"https://doi.org/10.26421/qic13.11-12-7","mag":"2952035306"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.26421/qic13.11-12-7","pdf_url":null,"source":{"id":"https://openalex.org/S41034432","display_name":"Quantum Information and Computation","issn_l":"1533-7146","issn":["1533-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322612","host_organization_name":"Rinton Press","host_organization_lineage":["https://openalex.org/P4310322612"],"host_organization_lineage_names":["Rinton Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112429688","display_name":"Maarten Van den Nest","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Maarten Van den Nest","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5112429688"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.519,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.901604,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":88},"biblio":{"volume":"13","issue":"11&12","first_page":"1007","last_page":"1037"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9999,"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"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9999,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9817,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9784,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/centralizer-and-normalizer","display_name":"Centralizer and normalizer","score":0.6165278},{"id":"https://openalex.org/keywords/quantum-fourier-transform","display_name":"Quantum Fourier transform","score":0.49701646}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6365658},{"id":"https://openalex.org/C75174853","wikidata":"https://www.wikidata.org/wiki/Q190629","display_name":"Centralizer and normalizer","level":2,"score":0.6165278},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5145978},{"id":"https://openalex.org/C59500034","wikidata":"https://www.wikidata.org/wiki/Q1464944","display_name":"Quantum Fourier transform","level":5,"score":0.49701646},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4730524},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4351998},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.42819023},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3413447},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.33476272},{"id":"https://openalex.org/C58849907","wikidata":"https://www.wikidata.org/wiki/Q2118982","display_name":"Quantum gate","level":4,"score":0.31370735},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.31151992},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.20667288},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10741824}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.26421/qic13.11-12-7","pdf_url":null,"source":{"id":"https://openalex.org/S41034432","display_name":"Quantum Information and Computation","issn_l":"1533-7146","issn":["1533-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322612","host_organization_name":"Rinton Press","host_organization_lineage":["https://openalex.org/P4310322612"],"host_organization_lineage_names":["Rinton Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4375959436","https://openalex.org/W3130655125","https://openalex.org/W3013434395","https://openalex.org/W2999834415","https://openalex.org/W2910123824","https://openalex.org/W2886620592","https://openalex.org/W2326306572","https://openalex.org/W2181040799","https://openalex.org/W1989353996","https://openalex.org/W1986555820"],"abstract_inverted_index":{"The":[0,90],"quantum":[1,11,40,55,154],"Fourier":[2],"transform":[3],"(QFT)":[4],"is":[5,53],"an":[6],"important":[7],"ingredient":[8],"in":[9,105,115,148],"various":[10],"algorithms":[12,93],"which":[13,26,64,69],"achieve":[14],"superpolynomial":[15],"speed-ups":[16],"over":[17,48,60,126],"classical":[18,88],"computers.":[19],"In":[20,76],"this":[21],"paper":[22],"we":[23,80,151],"study":[24],"under":[25],"conditions":[27],"the":[28,58,61,74,100,112,127,143],"QFT":[29,59],"can":[30],"be":[31,157],"simulated":[32],"efficiently":[33],"classically.":[34],"We":[35,131],"introduce":[36],"a":[37,45,49,160],"class":[38],"of":[39],"circuits,":[41],"called":[42],"\\emph{normalizer":[43],"circuits}:":[44],"normalizer":[46,84,124,136,161],"circuit":[47,56,162],"finite":[50],"Abelian":[51,144],"group":[52,128],"any":[54],"comprising":[57],"group,":[62],"gates":[63,68],"compute":[65],"automorphisms":[66],"and":[67,99,138,142],"realize":[70],"quadratic":[71],"functions":[72],"on":[73],"group.":[75],"our":[77,106],"main":[78],"result":[79,110],"prove":[81,152],"that":[82,153],"all":[83],"circuits":[85,118,125,137],"have":[86],"polynomial-time":[87],"simulations.":[89],"proof":[91],"uses":[92],"for":[94,119],"linear":[95],"diophantine":[96],"equation":[97],"solving":[98],"monomial":[101],"matrix":[102],"formalism":[103],"introduced":[104],"earlier":[107],"work.":[108],"Our":[109],"generalizes":[111],"Gottesman-Knill":[113],"theorem:":[114],"particular,":[116],"Clifford":[117],"$d$-level":[120],"qudits":[121],"arise":[122],"as":[123,159],"${\\mathbf":[129],"Z}_d^m$.":[130],"also":[132],"highlight":[133],"connections":[134],"between":[135],"Shor's":[139],"factoring":[140,155],"algorithm,":[141],"hidden":[145],"subgroup":[146],"problem":[147],"general.":[149],"Finally":[150],"cannot":[156],"realized":[158],"owing":[163],"to":[164],"its":[165],"modular":[166],"exponentiation":[167],"subroutine.":[168]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2952035306","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2024-12-07T00:36:12.130466","created_date":"2019-06-27"}