{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009070754,0.001910746,0.002090279,0.001522682,0.002291662,0.005666022,0.005276942,0.002913698,0.01024763],"category_scores_gemma":[0.03930022,0.001164731,0.002745718,0.001653684,0.00783936,0.01722271,0.009693405,0.009885179,0.001738617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006171328,"about_ca_system_score_gemma":0.003803939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001370623,"about_ca_topic_score_gemma":0.001474438,"domain_scores_codex":[0.9875718,0.00397151,0.000450867,0.002414537,0.003451699,0.002139537],"domain_scores_gemma":[0.9402543,0.04442533,0.001902098,0.01067154,0.001426022,0.001320824],"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.0009868824,0.0001852258,0.0007393794,0.0003991861,0.00009658433,0.0001738632,0.0004600547,0.0900038,0.01154585,0.8617616,0.004518234,0.02912938],"study_design_scores_gemma":[0.00007971268,0.00009736581,0.0002947619,0.00006998998,0.00005223489,0.0001093632,0.00007132857,0.3590508,0.008635254,0.6289169,0.00256121,0.00006111952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192843,0.001944766,0.8251354,0.007006432,0.0002903687,0.0003027782,0.0006169711,0.001026827,0.04439223],"genre_scores_gemma":[0.7937846,0.001428424,0.1911376,0.001249295,0.0004580717,0.0008098762,0.0005279367,0.0007121252,0.009892058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01024763,"threshold_uncertainty_score":0.04797131,"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."}}