{"id":"W2064591252","doi":"10.1103/physreva.82.042304","title":"Universal quantum computation by discontinuous quantum walk","year":2010,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum walk; Quantum computer; Quantum algorithm; Quantum network; Qubit; Quantum error correction; Adjacency matrix; Mathematics; Quantum; Computer science; Discrete mathematics; Graph; 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.0002089194,0.0002227303,0.0003882424,0.00003559456,0.0001415598,0.0001117035,0.0007873285,0.0000323049,0.000007988486],"category_scores_gemma":[0.00007577927,0.0001743129,0.0001881767,0.0004101299,0.00007662948,0.0002330868,0.0001894884,0.0005015431,0.0001090056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001052609,"about_ca_system_score_gemma":0.00004994832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005054576,"about_ca_topic_score_gemma":0.000003107083,"domain_scores_codex":[0.9984978,0.0001013328,0.0002337782,0.0004838798,0.0003326366,0.0003505864],"domain_scores_gemma":[0.9989612,0.0001869104,0.0001440547,0.0004659077,0.00007121918,0.0001706715],"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.000004891355,0.0005124029,0.00008869224,0.0005323818,0.00004494751,0.00004325492,0.0004073831,0.0003130007,0.007797877,0.2369882,0.01610245,0.7371646],"study_design_scores_gemma":[0.0002052705,0.0001205124,0.0006566324,0.000331337,0.00002083863,0.00002343222,0.000003221518,0.9478868,0.0001919319,0.03029987,0.01993342,0.0003267758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4715979,0.004806014,0.5117153,0.008593495,0.00120475,0.0005716819,0.00001491226,0.0005830487,0.0009128863],"genre_scores_gemma":[0.9926485,0.0003144268,0.005850102,0.0008529169,0.0002711529,0.0000055989,0.00001456014,0.00001457236,0.00002813463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9475737,"threshold_uncertainty_score":0.7108274,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006649356744580618,"score_gpt":0.2663318508694621,"score_spread":0.2596824941248815,"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."}}