{"id":"W1569763258","doi":"10.1007/3-540-45841-7_24","title":"Improved Quantum Communication Complexity Bounds for Disjointness and Equality","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Bounded function; Communication complexity; Protocol (science); Omega; Discrete mathematics; Class (philosophy); Combinatorics; Qubit; Binary logarithm; Quantum; Mathematics; Computer science; Physics; Quantum mechanics","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.008347272,0.003556183,0.004922552,0.005490917,0.00494973,0.00838634,0.01030291,0.004804474,0.03565061],"category_scores_gemma":[0.04000022,0.002477433,0.004445078,0.008225522,0.01051263,0.03517878,0.01788669,0.0230622,0.005480018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009109612,"about_ca_system_score_gemma":0.003775073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002596282,"about_ca_topic_score_gemma":0.003356537,"domain_scores_codex":[0.9876211,0.002421195,0.0004487108,0.002116896,0.005348928,0.002043264],"domain_scores_gemma":[0.9470558,0.04007025,0.001193635,0.007395803,0.002812327,0.001472275],"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.0002859037,0.0001180307,0.0002117903,0.0002415632,0.00004350305,0.00004967256,0.0002962518,0.01304212,0.001763715,0.9474307,0.009771682,0.0267451],"study_design_scores_gemma":[0.00003572345,0.00002701266,0.0001999263,0.00006575626,0.00005288796,0.00005281558,0.00005383545,0.0388573,0.001797359,0.9532299,0.005577102,0.00005030027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04249369,0.008434429,0.7627477,0.01113977,0.00242969,0.0003156689,0.001270182,0.001788477,0.1693804],"genre_scores_gemma":[0.6444231,0.008195275,0.2650749,0.004784191,0.006199236,0.001722014,0.00174471,0.002759462,0.06509703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03565061,"threshold_uncertainty_score":0.1192632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03951765447677823,"score_gpt":0.2767600365197809,"score_spread":0.2372423820430026,"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."}}