{"id":"W3196006293","doi":"10.1007/s11128-022-03681-9","title":"The average search probabilities of discrete-time quantum walks","year":2022,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Adjacency matrix; Quantum walk; Adjacency list; Mathematics; Combinatorics; Graph energy; Discrete mathematics; Vertex (graph theory); Stochastic matrix; Valency; Regular graph; Graph; Quantum algorithm; Quantum; Graph power; Line graph; Markov chain; Physics; Statistics; Quantum mechanics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001470888,0.0001704424,0.0001939035,0.0001743747,0.00195749,0.000520056,0.001323639,0.0000338156,0.00002159207],"category_scores_gemma":[0.00009363845,0.0001233782,0.00009204401,0.0007575792,0.0001452471,0.001499222,0.0008250471,0.0004280938,0.00002252941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007313956,"about_ca_system_score_gemma":0.0003261482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002215815,"about_ca_topic_score_gemma":4.499199e-7,"domain_scores_codex":[0.9976602,0.0001839175,0.0006564004,0.0001978696,0.0008768854,0.0004246974],"domain_scores_gemma":[0.9986517,0.0002298564,0.0003646484,0.0004783456,0.0002084484,0.00006697149],"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.00008122858,0.00009334472,0.00009467666,0.000476934,0.00003343878,0.000003949981,0.04414846,0.2491491,0.0002778689,0.2592939,0.0008669581,0.4454802],"study_design_scores_gemma":[0.0001925233,0.0001963435,0.0001549308,0.00003251212,0.000002540214,0.00003749613,0.0009435025,0.975198,0.000252224,0.01466786,0.008150324,0.000171716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.349808,0.0007375196,0.6371555,0.005601029,0.0009415013,0.0008949248,0.00004254661,0.0007444569,0.004074497],"genre_scores_gemma":[0.995768,0.000005736164,0.003830235,0.0001861294,0.0000367784,0.00004019874,0.00001547479,0.000009479691,0.0001079797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7260489,"threshold_uncertainty_score":0.9993418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007385554830364144,"score_gpt":0.2244673406136672,"score_spread":0.217081785783303,"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."}}