{"id":"W2043137390","doi":"10.1103/physreva.80.032301","title":"Quantum repeaters with imperfect memories: Cost and scalability","year":2009,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Computer science; Scalability; Probabilistic logic; Fault tolerance; Coherence (philosophical gambling strategy); Quantum; Connection (principal bundle); Quantum memory; Imperfect; Node (physics); Topology (electrical circuits); Quantum network; Mathematics; Distributed computing; Quantum mechanics; Physics; Statistics; Combinatorics","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.0002716871,0.0001779285,0.0003666214,0.00001866287,0.0001068373,0.00008230421,0.0003560457,0.000013686,0.000001267384],"category_scores_gemma":[0.0000794811,0.0001099494,0.00007786818,0.0003561245,0.00007774008,0.0001463667,0.0000987029,0.0001836151,0.000008589833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001649201,"about_ca_system_score_gemma":0.00003390868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005583493,"about_ca_topic_score_gemma":3.973844e-7,"domain_scores_codex":[0.9987669,0.00009684109,0.0001578784,0.0004812676,0.0002238117,0.0002732937],"domain_scores_gemma":[0.9990446,0.0001258477,0.00006713503,0.0005650886,0.00004828419,0.0001490613],"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.00001274947,0.0002439762,0.0002369384,0.0006161854,0.00002174955,0.00003500895,0.0005516309,0.0001042229,0.0003768343,0.03243307,0.0004909479,0.9648767],"study_design_scores_gemma":[0.00136541,0.003864833,0.0431848,0.006801001,0.0001510476,0.0003983085,0.00001409375,0.8154576,0.002097503,0.09904612,0.02583697,0.001782338],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.898103,0.01155918,0.07322788,0.014819,0.0001261455,0.001003096,0.000002665514,0.0004423492,0.0007166848],"genre_scores_gemma":[0.9922218,0.0007803588,0.004798689,0.002073483,0.0001016957,0.00001080953,8.441968e-7,0.000005949899,0.000006396264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9630944,"threshold_uncertainty_score":0.4483605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008867049439702812,"score_gpt":0.2702090241322065,"score_spread":0.2613419746925038,"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."}}