{"id":"W4297173301","doi":"10.48550/arxiv.1505.03110","title":"Near-optimal bounds on bounded-round quantum communication complexity of\\n disjointness","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; National Science Foundation","keywords":"Communication complexity; Upper and lower bounds; Corollary; Bounded function; Mathematics; Quantum; Quantum information science; Omega; Logarithm; Function (biology); Discrete mathematics; Quantum information; Computational complexity theory; Combinatorics; Physics; Algorithm; Quantum mechanics; Mathematical analysis; Quantum entanglement","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007061215,0.0003974379,0.0005416332,0.0002696411,0.0004146064,0.0004037095,0.00391911,0.0003390578,0.00002491012],"category_scores_gemma":[0.00005128828,0.0004625518,0.0003132614,0.0008543172,0.001250701,0.0007242719,0.00403003,0.0009123554,0.00004916149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002305092,"about_ca_system_score_gemma":0.0004472465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001151414,"about_ca_topic_score_gemma":0.0003029764,"domain_scores_codex":[0.9975595,0.0004003438,0.0003594658,0.001055481,0.0002348957,0.0003902882],"domain_scores_gemma":[0.9949861,0.000168631,0.0005298478,0.003671802,0.0003946479,0.0002489852],"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.0001021895,0.0003933261,0.001205269,0.00008278019,0.00008029072,0.00003171618,0.0006511424,0.01482574,0.000004407028,0.9815868,0.0009062359,0.0001301072],"study_design_scores_gemma":[0.000627644,0.0001622741,0.003381593,0.0001384249,0.0000588019,0.000004660376,0.0001493689,0.3904762,0.00003971011,0.6022293,0.002199314,0.0005327295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6407352,0.0001265652,0.3553021,0.0001540073,0.0004437952,0.0002768429,0.0001688076,0.000213948,0.002578689],"genre_scores_gemma":[0.9923112,0.0001310881,0.007167628,0.00005973562,0.00003422094,0.000001219655,0.0002446663,0.00001664994,0.0000335324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3793575,"threshold_uncertainty_score":0.9997826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1601704748528192,"score_gpt":0.22978787054716,"score_spread":0.06961739569434083,"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."}}