{"id":"W2982672004","doi":"10.1007/s11128-019-2483-3","title":"An infinite family of circulant graphs with perfect state transfer in discrete quantum walks","year":2019,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Circulant matrix; Transfer (computing); Mathematics; Quantum graph; Quantum; Circulant graph; Discrete mathematics; State (computer science); Quantum computer; Graph; Combinatorics; Quantum mechanics; Computer science; Physics; Line graph; Algorithm; Voltage graph","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.0005962665,0.0002666583,0.0003541112,0.0005566516,0.00012829,0.0003301512,0.0006684095,0.00007605872,0.000003935026],"category_scores_gemma":[0.00001131863,0.0002042271,0.00006719648,0.001084607,0.00007111331,0.003651476,0.00005741658,0.0003412944,0.00001803455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002968324,"about_ca_system_score_gemma":0.0002360919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001020669,"about_ca_topic_score_gemma":0.000007163203,"domain_scores_codex":[0.9979019,0.00008703448,0.0007231007,0.0003014637,0.0005474162,0.0004390971],"domain_scores_gemma":[0.9989462,0.0000565744,0.0002369682,0.0004699577,0.0001843702,0.0001059283],"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.0003685089,0.0003284164,0.02414889,0.002591951,0.00007219327,0.00003010957,0.08943162,0.3148426,0.01151131,0.0813319,0.00001556971,0.4753269],"study_design_scores_gemma":[0.0008677983,0.0004881532,0.02013409,0.0003864391,0.000004882712,0.00002921385,0.0004569564,0.9737599,0.0007408092,0.002639841,0.0001456233,0.0003462508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6580773,0.00005241646,0.3411721,0.00005866333,0.00009469688,0.0002134814,0.000006530435,0.0001195212,0.0002053097],"genre_scores_gemma":[0.9951857,0.00001072769,0.004516505,0.0002268514,0.000009845967,0.000009766631,0.00002296447,0.00001449089,0.000003170006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6589173,"threshold_uncertainty_score":0.8328139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006119963805271291,"score_gpt":0.2187419308921576,"score_spread":0.2126219670868863,"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."}}