{"id":"W1872909421","doi":"10.1006/jcss.2000.1732","title":"Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity","year":2001,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum walk; Unitary state; Computation; Quantum computer; Quantum algorithm; Mathematics; Quantum; Random walk; Discrete mathematics; Computer science; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.001103123,0.0001196284,0.000402754,0.0002854738,0.000277119,0.0002093313,0.0004232177,0.00004302254,6.636781e-7],"category_scores_gemma":[0.00002579073,0.00007891786,0.00008535136,0.0005708431,0.0002472932,0.0003275952,0.0001369505,0.000145151,1.897915e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009862993,"about_ca_system_score_gemma":0.00007449299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001682949,"about_ca_topic_score_gemma":0.000003960544,"domain_scores_codex":[0.9984828,0.0002373559,0.0004765142,0.0002205523,0.0003990789,0.0001837377],"domain_scores_gemma":[0.9984362,0.0007507642,0.0003848309,0.0001274802,0.0001728449,0.0001278949],"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.0003053474,0.0007834078,0.05756059,0.0005790383,0.0004573675,0.0004191229,0.01354677,0.2091935,0.003308885,0.2201766,0.0009382016,0.4927312],"study_design_scores_gemma":[0.0008125216,0.0004377072,0.01470154,0.0001825242,0.00001076147,0.001113293,0.0000770867,0.9800364,0.00003648259,0.002355266,0.0001348167,0.0001016264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5524632,0.0003408868,0.4463509,0.0003189175,0.0003958295,0.00004457348,7.419067e-7,0.00001799164,0.00006692601],"genre_scores_gemma":[0.9788935,0.0000201013,0.02088935,0.0000280093,0.0001623975,2.094334e-7,6.617786e-8,0.000002486011,0.000003899278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7708429,"threshold_uncertainty_score":0.3218177,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560902829208805,"score_gpt":0.251137507748184,"score_spread":0.235528479456096,"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."}}