{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000481216,0.0003542257,0.0004099179,0.0002458152,0.00030236,0.0005079217,0.00165858,0.0002917961,0.000007168527],"category_scores_gemma":[0.0001113651,0.0003226775,0.0002134007,0.0003610853,0.00004064891,0.0006498096,0.001684744,0.0005811289,0.00005620849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000687672,"about_ca_system_score_gemma":0.0003168776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002149839,"about_ca_topic_score_gemma":0.000003677018,"domain_scores_codex":[0.9981,0.0000650227,0.0005054971,0.0005477807,0.0002953156,0.0004863922],"domain_scores_gemma":[0.9980306,0.0003171827,0.000393572,0.0009745646,0.0001881889,0.00009586669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009053769,0.000418413,0.009498709,0.001643239,0.0004137358,0.0000333548,0.002003382,0.7907245,0.0002931856,0.00778475,0.04357545,0.1427059],"study_design_scores_gemma":[0.004125964,0.0001699202,0.008412872,0.0002048852,0.00003826333,0.000005305374,0.000006614789,0.9499726,0.0002629104,0.004545612,0.03168329,0.00057173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539095,0.0001845904,0.7387804,0.000720471,0.003702752,0.0006113405,0.00003655073,0.0004347863,0.001619624],"genre_scores_gemma":[0.6520284,0.00002901159,0.3443819,0.0007056181,0.001444334,0.0003360521,0.000467052,0.00005177908,0.0005558319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3981189,"threshold_uncertainty_score":0.9999225,"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."}}