{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008456822,0.0001116037,0.000388374,0.0001369819,0.0005013018,0.00004546579,0.001053678,0.00004224169,0.00001339968],"category_scores_gemma":[0.00003133137,0.00009127866,0.0001377723,0.0003455478,0.001081134,0.0002496801,0.0005533348,0.00009391466,0.000001819707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000138748,"about_ca_system_score_gemma":0.0000422452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007381884,"about_ca_topic_score_gemma":0.0007962096,"domain_scores_codex":[0.9990456,0.000213657,0.0001669702,0.0002088075,0.0001956176,0.0001693511],"domain_scores_gemma":[0.9975201,0.001355354,0.0002363551,0.0006525088,0.0001934009,0.00004229954],"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.004971216,0.0001146366,0.0003473129,0.0003254546,0.0003687347,0.000004306052,0.02927692,0.0001149475,0.0001159232,0.9452702,0.001321463,0.0177689],"study_design_scores_gemma":[0.08298896,0.0007633883,0.02566279,0.0005063983,0.0003322223,0.00002269372,0.02855923,0.612218,0.0003158706,0.2288782,0.01895391,0.0007982642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1872254,0.0003654332,0.8027538,0.006947435,0.0001444281,0.0009168692,0.0001046457,0.0001770726,0.001364912],"genre_scores_gemma":[0.9525135,0.0001084387,0.04672921,0.0000623017,0.00001100843,0.000002746834,0.00002657264,0.000006776721,0.0005394894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7652881,"threshold_uncertainty_score":0.3983483,"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."}}