{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001571111,0.0006438506,0.000753302,0.0004887496,0.0008514544,0.0009989969,0.003394359,0.0003349969,0.000007686959],"category_scores_gemma":[0.0001279428,0.0005848447,0.0001776541,0.0004211697,0.001658192,0.0004378346,0.002284038,0.0009542417,0.000004356097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001906845,"about_ca_system_score_gemma":0.0002201749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008056298,"about_ca_topic_score_gemma":0.00009692032,"domain_scores_codex":[0.9960761,0.0000894303,0.0007081818,0.001715408,0.0006178009,0.0007930631],"domain_scores_gemma":[0.9958709,0.001009693,0.0004647601,0.002115009,0.000308785,0.0002308382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001169138,0.00006805731,0.00002340709,0.00016169,0.00002153205,0.000007362965,0.001556625,0.005325894,0.00008885674,0.1961244,0.0000304745,0.79658],"study_design_scores_gemma":[0.0003001236,0.0001581791,0.0001151748,0.0002018638,0.00000679562,0.00004110202,1.656283e-7,0.6788144,0.00009293383,0.3185034,0.001271569,0.0004943215],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005335908,0.0008810292,0.9939731,0.002199256,0.0009511633,0.000719153,0.00002649176,0.0002497335,0.0004664724],"genre_scores_gemma":[0.2646528,0.00009747395,0.7333816,0.001123749,0.0004127962,0.00002732304,0.00002324962,0.00005728659,0.0002236753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7960857,"threshold_uncertainty_score":0.9996603,"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."}}