{"id":"W2154255325","doi":"10.1103/physrevlett.103.240505","title":"Capacity of Quantum Erasure Channel Assisted by Backwards Classical Communication","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research; W. M. Keck Foundation; National Science Foundation","keywords":"Erasure; Classical capacity; Channel (broadcasting); Binary erasure channel; Upper and lower bounds; Computer science; Quantum; Quantum channel; Quantum capacity; Channel capacity; Amplitude damping channel; Topology (electrical circuits); Computer network; Physics; Mathematics; Quantum mechanics; Quantum information; Combinatorics; Quantum network","routes":{"ca_aff":true,"ca_fund":true,"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.002617423,0.0008588654,0.00116237,0.001366777,0.001084947,0.001937361,0.001748334,0.001454417,0.004349616],"category_scores_gemma":[0.008803586,0.0004095251,0.0006784025,0.001123354,0.003358415,0.00412697,0.004096555,0.002497291,0.0006345081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001152682,"about_ca_system_score_gemma":0.00181699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007169119,"about_ca_topic_score_gemma":0.000422009,"domain_scores_codex":[0.9978003,0.0006610915,0.00008225357,0.0002249083,0.0006766046,0.0005548319],"domain_scores_gemma":[0.9906063,0.006361349,0.0005490686,0.00129929,0.0008674074,0.0003165193],"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.0005034168,0.00009982584,0.0003267038,0.0002935371,0.00004778869,0.0002762161,0.0002633981,0.1234466,0.02607232,0.8266956,0.003640155,0.01833439],"study_design_scores_gemma":[0.000101702,0.0001255203,0.0003133538,0.0000973469,0.00003990471,0.0002726909,0.00006303677,0.6666716,0.02555187,0.3027688,0.003851153,0.0001430375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3341298,0.002236927,0.6068086,0.002772156,0.0004238089,0.0001606015,0.0008803851,0.0007245024,0.05186323],"genre_scores_gemma":[0.9687784,0.0009304019,0.0251521,0.0001784997,0.0001657831,0.0001748375,0.0001613154,0.0000686909,0.004389806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004349616,"threshold_uncertainty_score":0.01455092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02632410090620604,"score_gpt":0.2781888286684004,"score_spread":0.2518647277621944,"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."}}