{"id":"W2994883802","doi":"","title":"Capacity of Quantum Erasure Channel Assisted by Backwards Classical Communication","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Classical capacity; Binary erasure channel; Channel (broadcasting); Upper and lower bounds; Computer science; Quantum; Quantum channel; Channel capacity; Mathematics; Computer network; Physics; Quantum mechanics; Quantum information; Mathematical analysis","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004466416,0.0003837645,0.0007067336,0.00059428,0.0002575871,0.00005134939,0.002717062,0.0005894433,0.000003367775],"category_scores_gemma":[0.0002495442,0.0003550547,0.0002102737,0.001662251,0.0007844432,0.0003915833,0.0004767098,0.0009035723,0.000007035716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008100597,"about_ca_system_score_gemma":0.0001386949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003931519,"about_ca_topic_score_gemma":0.00001495059,"domain_scores_codex":[0.9974875,0.0001036233,0.0006844143,0.0006345201,0.0005547348,0.0005351698],"domain_scores_gemma":[0.9969047,0.0000604325,0.0005994279,0.00200626,0.00030447,0.0001246739],"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.00008498802,0.003007434,0.001704953,0.0002520044,0.0005315653,0.00006195329,0.001885196,0.003382178,0.1394053,0.4314067,0.03219536,0.3860824],"study_design_scores_gemma":[0.004160672,0.002511103,0.01817965,0.001193204,0.0001517177,0.0003052348,0.0001162347,0.5552289,0.1534825,0.07805718,0.1843845,0.002229133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4915719,0.001708658,0.4319944,0.0705731,0.0008366648,0.0005868309,0.0001234328,0.001424146,0.001180869],"genre_scores_gemma":[0.8934311,0.00006459338,0.1061805,0.0001972297,0.00002973659,0.00000890783,0.00001674286,0.00001497279,0.00005618167],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5518467,"threshold_uncertainty_score":0.9998901,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01525584620909154,"score_gpt":0.2390918390725265,"score_spread":0.2238359928634349,"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."}}