{"id":"W2994217331","doi":"10.4230/lipics.stacs.2021.6","title":"A Unified Framework of Quantum Walk Search","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; Institute for Quantum Information and Matter, California Institute of Technology; Samsung; California Institute of Technology; National Science Foundation","keywords":"Quantum walk; Hitting time; Electric network; Quantum; Random walk; Computer science; Quantum algorithm; Operator (biology); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Physics; Quantum mechanics","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.002181528,0.0011615,0.001501283,0.001723075,0.001427475,0.003707093,0.003216741,0.002597342,0.008826911],"category_scores_gemma":[0.006618276,0.0007468701,0.001711066,0.00169031,0.003611738,0.007934469,0.002899599,0.004136666,0.001491615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002304183,"about_ca_system_score_gemma":0.002221843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003278336,"about_ca_topic_score_gemma":0.002529188,"domain_scores_codex":[0.9980384,0.0007122611,0.00009188134,0.000352547,0.0005443927,0.0002605387],"domain_scores_gemma":[0.9970602,0.001620093,0.0001450847,0.0005807226,0.0004251602,0.0001686389],"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.0000110823,0.00001387836,0.00005886071,0.00003471981,0.000007921629,0.00002142991,0.00003769105,0.03063199,0.0003503172,0.9627155,0.0007313953,0.005385247],"study_design_scores_gemma":[0.00001689345,0.00002820182,0.00004689855,0.0000183786,0.000007468756,0.00002535274,0.00001912768,0.2371793,0.0002030301,0.7581915,0.004247483,0.00001630036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004156321,0.0008691737,0.9807751,0.0008369447,0.0001130306,0.0000602078,0.0001003078,0.0001693393,0.01291946],"genre_scores_gemma":[0.3408738,0.003471374,0.6388016,0.0008448323,0.0008292925,0.0005564525,0.0003197184,0.0003278,0.01397522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008826911,"threshold_uncertainty_score":0.02952898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01853019871031418,"score_gpt":0.2745284521993785,"score_spread":0.2559982534890644,"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."}}