{"id":"W1608861503","doi":"10.1007/11940128_63","title":"Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamming distance; Upper and lower bounds; Alice and Bob; Mathematics; Discrete mathematics; Quantum; Hamming code; Protocol (science); Quantum information science; Combinatorics; Algorithm; Quantum mechanics; Physics; Quantum entanglement","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.008160357,0.003236406,0.003570779,0.004298384,0.004155758,0.01148786,0.008826857,0.00567719,0.02519255],"category_scores_gemma":[0.06974182,0.002098854,0.003215179,0.007688088,0.006726728,0.02349457,0.008955801,0.01644993,0.004132082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009905164,"about_ca_system_score_gemma":0.005774098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002836077,"about_ca_topic_score_gemma":0.004119418,"domain_scores_codex":[0.9866725,0.003072555,0.0005896774,0.001760262,0.005372067,0.002532962],"domain_scores_gemma":[0.8637987,0.1169436,0.002750328,0.009807321,0.00443964,0.00226038],"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.0008129498,0.0003540948,0.0009155791,0.0007660335,0.0001157144,0.000135175,0.00053776,0.06487936,0.002589355,0.8414237,0.02134582,0.06612442],"study_design_scores_gemma":[0.0001032322,0.0000554791,0.0006547736,0.0001278211,0.00007020141,0.0001417242,0.0001391584,0.1139274,0.00163975,0.8770953,0.005979693,0.00006544464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1406198,0.02949422,0.5169396,0.04234849,0.002749188,0.0005490526,0.004549272,0.002390827,0.2603596],"genre_scores_gemma":[0.7755576,0.0165783,0.132625,0.003658,0.005997441,0.001965774,0.0037924,0.002042201,0.05778322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02519255,"threshold_uncertainty_score":0.08427751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01821230751630273,"score_gpt":0.2320817986843061,"score_spread":0.2138694911680034,"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."}}