{"id":"https://openalex.org/W7225448442","doi":"https://doi.org/10.5281/zenodo.24029517","title":"Hardness of Pathfinding in a Welded Tree \u2014 E8 Intelligence Research","display_name":"Hardness of Pathfinding in a Welded Tree \u2014 E8 Intelligence Research","publication_year":2026,"publication_date":"2026-11-07","ids":{"openalex":"https://openalex.org/W7225448442","doi":"https://doi.org/10.5281/zenodo.24029517"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24029517","doi":"https://doi.org/10.5281/zenodo.24029517","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029517","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24029517","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5155309988","display_name":"Andrew Stewart Caldin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Caldin, Andrew Stewart","raw_affiliation_strings":["Independent Researcher, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Independent Researcher, United Kingdom","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5155309988"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9980000257492065,"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.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0005000000237487257,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.00039999998989515007,"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-walks","display_name":"quantum walks","score":0.5659999847412109},{"id":"https://openalex.org/keywords/path-finding","display_name":"path finding","score":0.722000002861023},{"id":"https://openalex.org/keywords/graph-search","display_name":"graph search","score":0.4189999997615814},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.375}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6747999787330627},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5364000201225281},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4934000074863434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48069998621940613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4796999990940094},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46709999442100525},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.45350000262260437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41449999809265137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3889000117778778},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.37119999527931213},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3684999942779541},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.36660000681877136},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.3264999985694885},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.31709998846054077},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C140058369","wikidata":"https://www.wikidata.org/wiki/Q7269113","display_name":"Quantum walk","level":4,"score":0.26829999685287476},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26109999418258667},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25949999690055847},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.24029517","doi":"https://doi.org/10.5281/zenodo.24029517","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029517","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.24029518","doi":"https://doi.org/10.5281/zenodo.24029518","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029518","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24029517","doi":"https://doi.org/10.5281/zenodo.24029517","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24029517","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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/W7213602205","https://openalex.org/W7214099559","https://openalex.org/W4402338177","https://openalex.org/W7225343938","https://openalex.org/W6922271085","https://openalex.org/W4407889719","https://openalex.org/W4403135068","https://openalex.org/W4396600721","https://openalex.org/W4390575968","https://openalex.org/W7118892226"],"abstract_inverted_index":{"Starting":[0],"from":[1,41],"the":[2,42,45,87,99,135],"entrance":[3,43],"of":[4,65,134],"a":[5,8,39],"welded":[6],"tree,":[7],"quantum":[9,32,54,69,113],"walk":[10],"algorithm":[11,33,71,103,114],"can":[12,115],"find":[13,38],"its":[14],"exit":[15],"vertex":[16],"exponentially":[17],"faster":[18],"than":[19],"any":[20,31,68],"classical":[21],"algorithm.":[22],"However,":[23],"it":[24],"has":[25,104],"been":[26],"an":[27,52,102,117],"open":[28],"question":[29],"whether":[30],"is":[34],"able":[35],"to":[36,44,79,94],"efficiently":[37],"path":[40,119],"exit.":[46],"We":[47],"answer":[48],"this":[49],"by":[50],"proving":[51],"exponential":[53],"query":[55,70],"lower":[56],"bound":[57],"for":[58,63],"finding":[59],"such":[60],"path.":[61],"Specifically,":[62],"trees":[64],"height":[66],"$n$,":[67],"requires":[72],"at":[73],"least":[74],"$\u03a9(2^{n/24})$":[75],"queries":[76],"in":[77,92,120],"order":[78,93],"succeed":[80],"with":[81],"constant":[82],"probability.":[83],"Our":[84],"proof":[85],"uses":[86],"compressed":[88],"permutation":[89],"oracle":[90],"technique":[91],"construct":[95],"databases":[96],"which":[97],"track":[98],"graph":[100],"information":[101],"learned":[105],"and":[106,108],"forgotten,":[107],"show":[109],"that":[110],"no":[111],"efficient":[112],"build":[116],"entrance-to-exit":[118],"these":[121],"records.":[122],"Source:":[123],"http://arxiv.org/abs/2609.20651v1":[124],"(arXiv:2609.20651v1)":[125],"Author:":[126],"Andrew":[127],"Stewart":[128],"Caldin,":[129],"Independent":[130],"Researcher,":[131],"UK.":[132],"Part":[133],"E8":[136],"Intelligence":[137],"Research":[138],"series.":[139],"Platform:":[140],"e8intelligence.com":[141]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-08T00:00:00"}