{"id":"W2737913277","doi":"10.48550/arxiv.1707.06703","title":"An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University; University of Waterloo","funders":"","keywords":"Circulant matrix; Quantum walk; Transfer (computing); Mathematics; Circulant graph; Discrete mathematics; Quantum; State (computer science); Spectrum (functional analysis); Graph; Combinatorics; Line graph; Quantum computer; Quantum mechanics; Physics; Computer science; 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.0004491035,0.0003507088,0.0004504124,0.001127046,0.001695015,0.001598945,0.0009822896,0.001129896,0.002996546],"category_scores_gemma":[0.002389653,0.0003899108,0.0004961471,0.0005797659,0.002048367,0.001839205,0.0009037601,0.001042001,0.0002016503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001031177,"about_ca_system_score_gemma":0.0004773201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001356501,"about_ca_topic_score_gemma":0.001394402,"domain_scores_codex":[0.9995921,0.0001252609,0.00001497367,0.00008507148,0.00009516376,0.0000873839],"domain_scores_gemma":[0.9984883,0.0007401786,0.0001698246,0.0001863123,0.0001400597,0.0002752616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004507173,0.00003107769,0.0005681764,0.00002516964,0.000008563358,0.0003603227,0.0002219012,0.007238128,0.00278347,0.9854435,0.0008331411,0.002441338],"study_design_scores_gemma":[0.00003698825,0.00002990023,0.0004939649,0.00002018379,0.00001164713,0.0003529109,0.0001412111,0.1162495,0.001746662,0.8790397,0.001853383,0.00002393536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8989115,0.0003338094,0.07286198,0.0006866831,0.00005853735,0.00003812689,0.0001578111,0.0003060121,0.02664552],"genre_scores_gemma":[0.989598,0.0001060301,0.007236008,0.00009153444,0.00002443253,0.00003688095,0.00009248994,0.00004406479,0.002770485],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002996546,"threshold_uncertainty_score":0.01002443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03532273943831923,"score_gpt":0.1934948439333768,"score_spread":0.1581721044950576,"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."}}