{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792547,0.0007094615,0.0009898876,0.002432057,0.00319714,0.002880307,0.001791879,0.001917958,0.003742208],"category_scores_gemma":[0.003883161,0.0007539155,0.0009269658,0.001364498,0.00270598,0.002160282,0.001083966,0.001790132,0.0003455346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001456523,"about_ca_system_score_gemma":0.001106125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002300544,"about_ca_topic_score_gemma":0.002516054,"domain_scores_codex":[0.9993364,0.0002178486,0.00002327823,0.0001276331,0.0001564736,0.0001383926],"domain_scores_gemma":[0.9957367,0.002341814,0.0003699705,0.0003553875,0.0004279104,0.0007681614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005283482,0.00004054886,0.0003481868,0.00003660662,0.00001580299,0.0002616408,0.000198796,0.006412478,0.001693783,0.9871666,0.001256481,0.002516228],"study_design_scores_gemma":[0.00004589151,0.00002967503,0.000480406,0.00003092844,0.00001552216,0.0003181361,0.00009849083,0.09112597,0.0007502708,0.9053038,0.001772494,0.00002846481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8335489,0.000928368,0.1119109,0.001514021,0.0001941585,0.00008074572,0.0003854586,0.0005562301,0.05088118],"genre_scores_gemma":[0.9770942,0.0003303254,0.01271458,0.0002443818,0.00009468081,0.00008440607,0.0002920532,0.0001307429,0.009014633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003742208,"threshold_uncertainty_score":0.01251894,"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."}}