{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001165046,0.0008587725,0.001339765,0.0005759883,0.0003505012,0.001090946,0.004122096,0.0009878614,0.00003183966],"category_scores_gemma":[0.00024829,0.0007952133,0.0008730671,0.0007335277,0.000221649,0.0005691638,0.004614236,0.00284955,0.00003021022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001126388,"about_ca_system_score_gemma":0.0006764064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001047357,"about_ca_topic_score_gemma":0.000008967514,"domain_scores_codex":[0.9945225,0.0001636626,0.002044113,0.0008099711,0.001230402,0.001229393],"domain_scores_gemma":[0.9942958,0.0005619419,0.001035728,0.002858045,0.0008873228,0.0003611738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003800287,0.003017795,0.006032918,0.02758591,0.003534376,0.0002589445,0.1769599,0.2400009,0.0001631295,0.2552315,0.004646042,0.2821885],"study_design_scores_gemma":[0.0009669871,0.0002515821,0.0008896327,0.001906606,0.00004796536,0.00007441615,0.0007953026,0.9787914,0.0009159322,0.01205217,0.002389361,0.0009186732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.222844,0.0002430797,0.7711638,0.0005589697,0.002795044,0.001054662,0.0004236738,0.0003041482,0.0006126041],"genre_scores_gemma":[0.655444,0.00009665275,0.3428122,0.0005481883,0.0003375399,0.0000491026,0.0005759966,0.0000636383,0.00007259462],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7387904,"threshold_uncertainty_score":0.999946,"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."}}