{"id":"W2559657995","doi":"10.26421/qic17.9-10-5","title":"Pretty good state transfer between internal nodes of paths","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Path graph; Path (computing); Wheel graph; Hamiltonian (control theory); Combinatorics; Mathematics; Quantum walk; Graph; Transfer (computing); Quantum; Hamiltonian path; State (computer science); Integer (computer science); Discrete mathematics; Physics; Quantum mechanics; Computer science; Quantum algorithm; Graph power; Algorithm; Mathematical optimization","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004741615,0.0002869398,0.0004160742,0.0002835065,0.0002164824,0.0006727958,0.0008043491,0.000170766,0.000001273105],"category_scores_gemma":[0.00003273842,0.0002637656,0.0001275005,0.00008735453,0.00008950171,0.000938717,0.0006134756,0.0005031028,0.000008540499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000268353,"about_ca_system_score_gemma":0.0001518034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001261479,"about_ca_topic_score_gemma":0.00000217376,"domain_scores_codex":[0.9981666,0.00009441704,0.0007950816,0.0002896829,0.0004272295,0.0002270307],"domain_scores_gemma":[0.9985006,0.0001110118,0.0005911646,0.0004433808,0.0002508624,0.0001029562],"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.00001718059,0.00003347693,0.001712415,0.0006786449,0.00009420072,0.000002213641,0.009523029,0.04469913,0.00001664056,0.01093974,0.0000763802,0.9322069],"study_design_scores_gemma":[0.0004203024,0.0001135337,0.03283465,0.0003177874,0.00001708246,0.000009097802,0.00002859049,0.9353316,0.0002181275,0.03006913,0.0003531325,0.0002869481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3538566,0.00006862598,0.6447868,0.0002351359,0.0004189385,0.0002015992,0.00005769186,0.0001090893,0.0002655315],"genre_scores_gemma":[0.98749,0.00005215547,0.01214979,0.0000744191,0.00007392554,0.000008860288,0.0001331239,0.000008958637,0.000008787314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.93192,"threshold_uncertainty_score":0.9999815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01618188543001926,"score_gpt":0.2634367445894115,"score_spread":0.2472548591593922,"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."}}