{"id":"W2892601725","doi":"10.1017/9781009261692","title":"Discrete Quantum Walks on Graphs and Digraphs","year":2022,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Quantum walk; Random walk; Quantum algorithm; Quantum; Graph; Discrete mathematics; Relation (database); Quantum computer; Graph theory; Mathematics; Computer science; Theoretical computer science; Algebra over a field; Pure mathematics; Combinatorics; Quantum mechanics; Physics","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"],"consensus_categories":[],"category_scores_codex":[0.0001739435,0.0005098991,0.0004801506,0.0004569669,0.00071816,0.0001887602,0.001782537,0.0002188285,0.000001737001],"category_scores_gemma":[0.000008566516,0.0005426366,0.0002871963,0.00006267596,0.000251337,0.0001047775,0.002067622,0.001168244,0.000003082609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001387997,"about_ca_system_score_gemma":0.0001973671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007773462,"about_ca_topic_score_gemma":7.638428e-7,"domain_scores_codex":[0.9975168,0.000171073,0.0002001134,0.001105739,0.0005227401,0.0004835114],"domain_scores_gemma":[0.9981463,0.000213353,0.0002426433,0.001081374,0.00005429284,0.0002620453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002704346,0.00001532256,0.000001559,0.00006025038,0.00008762073,0.0005182398,0.000171181,0.00007305507,0.000005303674,0.9335327,0.05892285,0.006584914],"study_design_scores_gemma":[0.0005446986,0.000334872,0.00006396903,0.0001454082,0.00006441613,0.00006552862,0.0000193352,0.02663902,0.00002136197,0.0006294231,0.9707064,0.0007655771],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.001249776,0.0003285795,0.006606218,0.0001056365,0.0008746737,0.0004676828,0.0002443351,0.000661489,0.9894616],"genre_scores_gemma":[0.001668342,0.00009491431,0.0007365599,0.0002350213,0.00008097231,0.000001804495,0.00004927955,0.00004729466,0.9970858],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9329032,"threshold_uncertainty_score":0.9997025,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01006048806787512,"score_gpt":0.1897041094231194,"score_spread":0.1796436213552443,"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."}}