{"id":"W1663218918","doi":"10.1145/2698587","title":"Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Alice and Bob; Hamming distance; Communication complexity; Bounding overwatch; Upper and lower bounds; Mathematics; Quantum information science; Quantum; Discrete mathematics; Combinatorics; Computer science; Quantum entanglement; Quantum mechanics; 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.007482897,0.002202227,0.002370593,0.002395489,0.003246846,0.007048768,0.006064445,0.004389598,0.01217129],"category_scores_gemma":[0.05953257,0.001254048,0.002560059,0.003019554,0.00556148,0.01824002,0.007436751,0.009915678,0.001985185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006918749,"about_ca_system_score_gemma":0.004587085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002336489,"about_ca_topic_score_gemma":0.002874153,"domain_scores_codex":[0.9870998,0.004077849,0.0006564514,0.001792908,0.00372385,0.00264913],"domain_scores_gemma":[0.873518,0.1096844,0.002888845,0.008642551,0.003191857,0.002074393],"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.001451053,0.0006414121,0.002765138,0.0008779522,0.0001605927,0.0002626714,0.0008583259,0.1586351,0.005913729,0.7495369,0.01525547,0.06364173],"study_design_scores_gemma":[0.0001311707,0.000109781,0.001022327,0.00009906704,0.00005132531,0.000131099,0.0001588287,0.2751163,0.002279575,0.7182155,0.002618091,0.00006690699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3333312,0.01061982,0.46683,0.03446985,0.0009750644,0.0005487285,0.003410324,0.001565751,0.1482493],"genre_scores_gemma":[0.8847321,0.003821313,0.08566796,0.001751295,0.001601097,0.001133542,0.002247778,0.0006433693,0.0184015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01217129,"threshold_uncertainty_score":0.05019921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04861793686885723,"score_gpt":0.2731714325194876,"score_spread":0.2245534956506303,"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."}}