{"id":"W2766265081","doi":"10.1109/tit.2018.2833466","title":"Complexity and Capacity Bounds for Quantum Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum capacity; Quantum channel; Mathematics; Quantum algorithm; Hilbert space; Quantum; Quantum information; Classical capacity; Quantum error correction; Quantum operation; Upper and lower bounds; Discrete mathematics; Quantum network; Quantum mechanics; Open quantum system; Pure mathematics; Physics","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.0005001537,0.0001290303,0.0001183096,0.0001745211,0.0006727872,0.0002266378,0.0002738532,0.00006058243,0.00001483473],"category_scores_gemma":[0.00001024721,0.0001144535,0.00006370153,0.0001932264,0.0002329649,0.0008469155,0.000003771939,0.0001431926,0.00004603526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002303187,"about_ca_system_score_gemma":0.00002972465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001022019,"about_ca_topic_score_gemma":0.000002798353,"domain_scores_codex":[0.9992033,0.00005722863,0.0002307578,0.000148234,0.0001449273,0.0002155597],"domain_scores_gemma":[0.9992432,0.0001781612,0.00008680073,0.0002763945,0.0001345067,0.00008093426],"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.00009941608,0.00007978521,8.884456e-7,0.00006903172,0.00004682809,2.122556e-7,0.01114839,0.005503105,0.0001015044,0.6211823,0.0003967191,0.3613718],"study_design_scores_gemma":[0.0004352051,0.0003389693,0.00004604484,0.00002131134,0.000006153766,0.00002294582,0.00007315825,0.8399153,0.005095625,0.1492731,0.004598126,0.0001739711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03315563,0.000004177828,0.9642544,0.0004165044,0.001318689,0.0002177276,0.00003363883,0.0002273882,0.0003717909],"genre_scores_gemma":[0.9717208,0.000002389092,0.02726338,0.0008388116,0.0000953586,0.00002741053,0.000002169425,0.000005220979,0.00004441075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9385652,"threshold_uncertainty_score":0.5174603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02387081041126787,"score_gpt":0.2446334930440721,"score_spread":0.2207626826328042,"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."}}