{"id":"W1496853341","doi":"10.1109/focs.2015.53","title":"Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Thomas and Stacey Siebel Foundation; Simons Foundation; National Science Foundation","keywords":"Communication complexity; Upper and lower bounds; Corollary; Bounded function; Quantum; Mathematics; Quantum information science; Omega; Logarithm; Function (biology); Computational complexity theory; Discrete mathematics; Quantum information; Combinatorics; Physics; Algorithm; Quantum mechanics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01033073,0.001726514,0.002178379,0.001875602,0.00236193,0.006035156,0.005244602,0.003196332,0.009625512],"category_scores_gemma":[0.04994644,0.001311518,0.00288903,0.001934953,0.007853819,0.01821294,0.008851483,0.01066399,0.001570785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006595549,"about_ca_system_score_gemma":0.003910678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275071,"about_ca_topic_score_gemma":0.00128315,"domain_scores_codex":[0.9856583,0.004515514,0.0005666467,0.002522751,0.004368115,0.002368559],"domain_scores_gemma":[0.90854,0.07100008,0.002499762,0.01356891,0.002562577,0.00182874],"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.0009124195,0.0001893437,0.0008764521,0.0003703558,0.00009854644,0.0001724461,0.0004184544,0.1334353,0.01045147,0.8245101,0.004505679,0.02405952],"study_design_scores_gemma":[0.0000679162,0.00008802194,0.0003280342,0.00006220186,0.00004808586,0.0001120232,0.0000795162,0.3900402,0.007580856,0.5994379,0.002092631,0.0000624599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1389407,0.002048278,0.8085777,0.00707288,0.0002889115,0.000270379,0.0007102892,0.001075794,0.0410151],"genre_scores_gemma":[0.8276989,0.001437042,0.1597063,0.001093529,0.0004827611,0.0007097797,0.0005281708,0.0007278358,0.007615576],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01033073,"threshold_uncertainty_score":0.05463481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06095299159912352,"score_gpt":0.2995292769893065,"score_spread":0.238576285390183,"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."}}