{"id":"W1970803012","doi":"10.1145/2746539.2746613","title":"Quantum Information Complexity","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum complexity theory; Quantum information; Bipartite graph; Computer science; Generalization; Theoretical computer science; Quantum; Quantum algorithm; Quantum capacity; Quantum information science; Quantum channel; Quantum network; Mathematics; Discrete mathematics; Quantum entanglement; Quantum mechanics; Physics","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.002948091,0.0009276447,0.001275355,0.002020874,0.00164488,0.005554385,0.002371514,0.002178156,0.008431662],"category_scores_gemma":[0.01273187,0.000432012,0.001655351,0.00196918,0.005627997,0.01119862,0.004113983,0.00441375,0.0008916869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00378048,"about_ca_system_score_gemma":0.00153863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001339728,"about_ca_topic_score_gemma":0.0007825214,"domain_scores_codex":[0.993548,0.001374852,0.0004708993,0.001001931,0.002840168,0.0007641359],"domain_scores_gemma":[0.9893377,0.006205586,0.0006199178,0.00201828,0.001433205,0.0003854395],"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.000004896011,0.000006579688,0.00005953986,0.00003703354,0.000007104657,0.00001461007,0.00003237493,0.002189153,0.0001506855,0.9939049,0.0008777006,0.002715402],"study_design_scores_gemma":[0.000004432613,0.000009073611,0.00009279378,0.00001526015,0.000007135671,0.00003768321,0.00001560463,0.01295975,0.0001811439,0.9818295,0.004837001,0.0000106345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04416289,0.005509215,0.7838113,0.01234436,0.001073478,0.0002767731,0.001577512,0.00028205,0.1509624],"genre_scores_gemma":[0.8270144,0.005274179,0.1379257,0.002435568,0.002483367,0.0008278368,0.00107828,0.0002419654,0.02271873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008431662,"threshold_uncertainty_score":0.02820677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03910773029662591,"score_gpt":0.253773896538988,"score_spread":0.2146661662423621,"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."}}