{"id":"W4390962955","doi":"10.4230/lipics.stacs.2025.54","title":"Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum walk; Divide and conquer algorithms; Recursion (computer science); Subspace topology; Computer science; Quantum; Subroutine; Quadratic growth; Theoretical computer science; Quantum algorithm; Simple (philosophy); Quantum logic; Quantum computer; Boolean function; Discrete mathematics; Mathematics; Algorithm; Quantum mechanics; Physics; Programming language; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006091273,0.0003834807,0.0004103104,0.0007043221,0.001189688,0.001313496,0.00100549,0.0008336528,0.007150483],"category_scores_gemma":[0.00172235,0.0002800126,0.0005439298,0.001062797,0.00222517,0.003576608,0.001910951,0.001621402,0.0008331613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215969,"about_ca_system_score_gemma":0.0008096474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001645174,"about_ca_topic_score_gemma":0.00330087,"domain_scores_codex":[0.9994505,0.0001763523,0.00002246151,0.00009495048,0.0001545399,0.0001011915],"domain_scores_gemma":[0.9994867,0.0002152298,0.00003361213,0.0001565569,0.00006419251,0.00004363274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002615225,0.00001997873,0.0001147768,0.00002648079,0.00000557306,0.00002626723,0.00009481663,0.008789652,0.001890167,0.9641998,0.0009851315,0.02382109],"study_design_scores_gemma":[0.0000139882,0.00001660484,0.00006842703,0.00001001294,0.00000624478,0.00004806914,0.00004361732,0.116378,0.003462058,0.8707155,0.009225391,0.00001212988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03549869,0.0002881678,0.9393508,0.0006951146,0.0000745833,0.00005831571,0.00008006237,0.001017594,0.0229366],"genre_scores_gemma":[0.4618163,0.0002518493,0.5266902,0.0003575984,0.00005044093,0.0001898318,0.0001327824,0.0003990786,0.01011194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007150483,"threshold_uncertainty_score":0.02392071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03282529287102845,"score_gpt":0.1901941828885178,"score_spread":0.1573688900174894,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}