{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021869,0.001294444,0.001428524,0.002777332,0.00163399,0.004101865,0.002504783,0.001848068,0.00835389],"category_scores_gemma":[0.01575371,0.0005162325,0.001370331,0.002672656,0.005130868,0.01184971,0.004316428,0.00578174,0.0007068272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003475645,"about_ca_system_score_gemma":0.001319471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001240811,"about_ca_topic_score_gemma":0.0009655695,"domain_scores_codex":[0.9961015,0.0008054102,0.0001687913,0.0006271668,0.001532557,0.000764725],"domain_scores_gemma":[0.9781117,0.01593755,0.001401161,0.002382637,0.001358137,0.0008087595],"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.00004439681,0.00003845432,0.0002384212,0.00008671153,0.0000140925,0.00004860928,0.0001666478,0.03395064,0.001849708,0.95824,0.001046193,0.004276055],"study_design_scores_gemma":[0.000008429088,0.00001869135,0.0002099165,0.0000245838,0.00001074915,0.00006601455,0.00004906884,0.1277011,0.001419876,0.868727,0.001732312,0.00003238137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2661381,0.004008781,0.6213853,0.004681694,0.0003123262,0.0001977502,0.001707108,0.0006769662,0.1008919],"genre_scores_gemma":[0.9518627,0.001586723,0.03996661,0.0003269746,0.0004665764,0.0003089127,0.000492758,0.0002202513,0.004768363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00835389,"threshold_uncertainty_score":0.02794653,"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."}}