{"id":"https://openalex.org/W3012583593","doi":null,"title":"Exploring Quantum Computation Through the Lens of Classical Simulation","display_name":"Exploring Quantum Computation Through the Lens of Classical Simulation","alternate_titles":[],"publication_year":2020,"publication_date":"2020-02-28","ids":{"openalex":"https://openalex.org/W3012583593","mag":"3012583593"},"language":"en","primary_location":{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10091573","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10091573/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Doctoral thesis, UCL (University College London).","raw_type":"Thesis"},"parent_works":[],"lineage":["https://openalex.org/W3012583593"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5065714522","display_name":"Padraic Calpin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Padraic Calpin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5065714522"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9994999766349792,"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.9994999766349792,"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/T10020","display_name":"Quantum Information and Cryptography","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11804","display_name":"Quantum many-body systems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-circuit-simulation","display_name":"quantum circuit simulation","score":0.7350000143051147},{"id":"https://openalex.org/keywords/stabilizer-circuits","display_name":"stabilizer circuits","score":0.9100000262260437},{"id":"https://openalex.org/keywords/classical-simulation-of-quantum-computation","display_name":"classical simulation of quantum computation","score":0.8140000104904175},{"id":"https://openalex.org/keywords/quantum-advantage","display_name":"quantum advantage","score":0.7919999957084656},{"id":"https://openalex.org/keywords/polynomial-hierarchy-collapse","display_name":"polynomial hierarchy collapse","score":0.7250000238418579},{"id":"https://openalex.org/keywords/approximate-decomposition","display_name":"approximate decomposition","score":0.33799999952316284},{"id":"https://openalex.org/keywords/simulation-complexity","display_name":"simulation complexity","score":0.4620000123977661},{"id":"https://openalex.org/keywords/quantum-computing","display_name":"quantum computing","score":0.35600000619888306}],"concepts":[{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6721404790878296},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5925413370132446},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5696990489959717},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.560027539730072},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5558167099952698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5331284999847412},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4681788980960846},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4428052008152008},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.44138801097869873},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4187089800834656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36309027671813965},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34942758083343506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3352356553077698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3067529499530792},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19737040996551514},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.19003582000732422},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.17621126770973206},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14543399214744568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08494886755943298}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10091573","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10091573/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Doctoral thesis, UCL (University College London).","raw_type":"Thesis"},{"id":"mag:3012583593","doi":null,"is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10091573/","pdf_url":null,"source":{"id":"https://openalex.org/S4306508231","display_name":"Doctoral thesis, UCL (University College London).","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Doctoral thesis, UCL (University College London).","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2885845431","https://openalex.org/W3137828432","https://openalex.org/W4285719303","https://openalex.org/W1554033614","https://openalex.org/W7134280414","https://openalex.org/W4416074923","https://openalex.org/W7007769765","https://openalex.org/W4294770912","https://openalex.org/W2890036832"],"abstract_inverted_index":{"It":[0],"is":[1,21,49,86],"widely":[2],"believed":[3],"that":[4,39,52,69],"quantum":[5,40,56,74,119,132],"computation":[6,133],"has":[7,66],"the":[8,78,81,114,143,146,149,155,159,215],"potential":[9],"to":[10,176,202],"offer":[11],"an":[12,60,204],"ex-":[13],"ponential":[14],"speedup":[15],"over":[16],"classical":[17,62,71,108,163],"devices.":[18],"However,":[19,47],"there":[20],"currently":[22],"no":[23],"definitive":[24],"proof":[25],"of":[26,55,73,80,116,131,145,154,165,212],"this":[27,104,141],"separation":[28,34],"in":[29,36,89],"computational":[30],"power.":[31],"Such":[32],"a":[33,95,100,128],"would":[35,76],"turn":[37],"imply":[38,77],"circuits":[41,75,120,213],"cannot":[42],"be":[43,136],"efficiently":[44,137],"simulated":[45,138],"classically.":[46,139],"it":[48],"well":[50],"known":[51],"certain":[53],"classes":[54,211],"computations":[57],"nonetheless":[58],"admit":[59],"efficient":[61,70],"description.":[63],"Recent":[64],"work":[65],"also":[67],"argued":[68],"simulation":[72],"collapse":[79],"Polynomial":[82],"Hierarchy,":[83],"something":[84],"which":[85,134],"commonly":[87],"invoked":[88],"clas-":[90],"sical":[91],"complexity":[92,153],"theory":[93],"as":[94],"no-go":[96],"theorem.":[97],"This":[98,110],"suggests":[99],"route":[101],"for":[102,184,207],"studying":[103],"\u2018quantum":[105],"advantage\u2019":[106],"through":[107,121],"simulations.":[109],"project":[111],"looks":[112],"at":[113],"problem":[115,160],"classically":[117,208],"simulating":[118,209],"decompositions":[122],"into":[123],"stabilizer":[124,166,216],"circuits.":[125],"These":[126],"are":[127],"restricted":[129],"class":[130],"can":[135],"In":[140],"picture,":[142],"rank":[144,217],"decomposition":[147],"determines":[148],"temporal":[150],"and":[151,194],"spatial":[152],"simulation.":[156],"We":[157,180],"approach":[158],"by":[161],"considering":[162],"simulations":[164],"circuits,":[167],"introducing":[168],"two":[169,200],"new":[170],"representations":[171],"with":[172],"novel":[173],"features":[174],"compared":[175],"previous":[177],"meth-":[178],"ods.":[179],"then":[181],"examine":[182],"techniques":[183],"building":[185],"these":[186,199],"so-called":[187],"\u2018stabilizer":[188],"rank\u2019":[189],"decom-":[190],"positions,":[191],"both":[192],"exact":[193],"approximate.":[195],"Finally,":[196],"we":[197],"combine":[198],"ingredients":[201],"introduce":[203],"improved":[205],"method":[206],"broad":[210],"using":[214],"method.":[218]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3012583593","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2020-03-27T00:00:00"}
