{"id":"W1779245055","doi":"10.4230/lipics.ccc.2017.24","title":"Accessible versus Holevo Information for a Binary Random Variable","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Ministry of Education, India; National Research Foundation","keywords":"Fidelity; Mutual information; Probabilistic logic; Binary number; Mathematics; Random variable; Quantum information; Encoding (memory); Quantum; Upper and lower bounds; Information theory; Variable (mathematics); Discrete mathematics; Combinatorics; Computer science; Quantum mechanics; Physics; Statistics; Artificial intelligence","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.002895537,0.0006482271,0.001010005,0.001164584,0.001095087,0.003168475,0.001567805,0.00172949,0.006851123],"category_scores_gemma":[0.01656512,0.0003276427,0.0009445245,0.0008824937,0.003463266,0.008102283,0.002506014,0.003360454,0.0007569441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002225105,"about_ca_system_score_gemma":0.001028709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007540794,"about_ca_topic_score_gemma":0.0006795763,"domain_scores_codex":[0.9971501,0.001130854,0.0001113034,0.0004928451,0.0007882949,0.0003265521],"domain_scores_gemma":[0.9838451,0.01254064,0.0006646976,0.002063136,0.0004960337,0.0003903965],"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.0001667302,0.00003075058,0.0005189601,0.00006898193,0.00001584602,0.00006404975,0.0001630099,0.03034483,0.0009341318,0.9596596,0.000973307,0.007059719],"study_design_scores_gemma":[0.00001968335,0.00003451587,0.0002604557,0.00002197759,0.00001109991,0.00004510731,0.0000241286,0.1525785,0.0009666495,0.8452881,0.0007339952,0.00001573888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3850449,0.001252267,0.5745781,0.006469877,0.0001473514,0.000118701,0.001028588,0.0005268716,0.03083334],"genre_scores_gemma":[0.9697705,0.0004580021,0.02357655,0.000386044,0.0002016916,0.0001395479,0.0003974708,0.0001127258,0.004957396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006851123,"threshold_uncertainty_score":0.02291936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02762151450321277,"score_gpt":0.2661126739681694,"score_spread":0.2384911594649566,"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."}}