{"id":"W1563058589","doi":"10.1007/978-3-642-14165-2_46","title":"Finding Is as Easy as Detecting for Quantum Walks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Random walk; Mathematics; Quadratic growth; Graph; Quantum; Discrete mathematics; Combinatorics; Statistical physics; Quantum algorithm; Quantum mechanics; Algorithm; Physics; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"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.001522477,0.0009195129,0.0008188107,0.001123763,0.001120462,0.001241281,0.005087441,0.0007370642,0.0000370681],"category_scores_gemma":[0.0004434517,0.0008414191,0.0003889026,0.0007375004,0.000631015,0.0004526599,0.00204084,0.002339162,0.0001084163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002004435,"about_ca_system_score_gemma":0.0009064627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006161349,"about_ca_topic_score_gemma":0.00003832174,"domain_scores_codex":[0.9939206,0.00003839211,0.0007695616,0.002644521,0.00123789,0.001389037],"domain_scores_gemma":[0.9953616,0.00145121,0.0005524205,0.00191612,0.0003637052,0.0003549787],"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.00001165369,0.00002930028,0.00001553872,0.00008196368,0.00002396843,0.0001061055,0.002071084,0.01075894,0.001464126,0.0237429,0.00001781696,0.9616766],"study_design_scores_gemma":[0.0002883555,0.0003452601,0.00001782503,0.0004032196,0.00000967914,0.0002959145,2.756881e-7,0.6597269,0.007378769,0.3248192,0.005871341,0.0008432678],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002317744,0.0002862045,0.9880272,0.001549912,0.004999865,0.0007366516,0.000009813767,0.0004002701,0.001672412],"genre_scores_gemma":[0.1719168,0.00002038075,0.8200459,0.00485109,0.002120266,0.00002869296,0.000006086121,0.0001296772,0.0008810576],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9608333,"threshold_uncertainty_score":0.9999625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01700813622717157,"score_gpt":0.2652777477026309,"score_spread":0.2482696114754593,"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."}}