{"id":"W7135374935","doi":"10.4230/lipics.fsttcs.2023.32","title":"Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error","year":2023,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"QuantERA; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Multiplicative function; Upper and lower bounds; Protocol (science); Qubit; Communication complexity; Quantum information science; Function (biology); Constant (computer programming); Quantum","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0129338,0.002765487,0.003205851,0.002847706,0.003436737,0.00745193,0.007714149,0.005641237,0.01453881],"category_scores_gemma":[0.07641916,0.001897752,0.00447137,0.002760913,0.01186032,0.03329653,0.01054386,0.01550632,0.002719743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009473311,"about_ca_system_score_gemma":0.005929779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002758922,"about_ca_topic_score_gemma":0.0021406,"domain_scores_codex":[0.9773309,0.006084576,0.0008731026,0.004602745,0.006770921,0.004337748],"domain_scores_gemma":[0.8429674,0.1292243,0.005666657,0.01657169,0.003727035,0.001842806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001025073,0.0004384555,0.001621712,0.0005932011,0.0001543968,0.0002917461,0.0005964473,0.1870792,0.007048295,0.7675877,0.004278447,0.02928529],"study_design_scores_gemma":[0.0001016018,0.00009694242,0.0005919978,0.00007923196,0.00007926174,0.0001425676,0.0001090419,0.4304663,0.006898326,0.5592489,0.002102064,0.00008378857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1197958,0.003107035,0.8180533,0.009598422,0.0003357403,0.0003763597,0.0006445818,0.001424213,0.04666446],"genre_scores_gemma":[0.8487142,0.002189906,0.1233764,0.001679545,0.0008718449,0.001563658,0.0006622932,0.001121807,0.01982041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01453881,"threshold_uncertainty_score":0.06873399,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06219003204730211,"score_gpt":0.2465044633612226,"score_spread":0.1843144313139204,"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."}}