{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001182962,0.0005130004,0.0007809013,0.0001791149,0.0004041579,0.0009265758,0.003943156,0.000325216,0.00001934946],"category_scores_gemma":[0.0000829862,0.0004464542,0.0002737635,0.0003499491,0.0008741692,0.0001707854,0.005388595,0.001347857,0.00003767509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001637976,"about_ca_system_score_gemma":0.0006776685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001032887,"about_ca_topic_score_gemma":0.00007022269,"domain_scores_codex":[0.9965806,0.0004194659,0.0007567733,0.000919017,0.0008406808,0.0004834431],"domain_scores_gemma":[0.9949626,0.0002394417,0.0006337276,0.003499559,0.0004447553,0.0002199588],"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.00006516777,0.0008730631,0.0001721564,0.0003321455,0.0001761262,0.00001533245,0.004435743,0.1616132,0.00002965592,0.8078495,0.005926295,0.01851156],"study_design_scores_gemma":[0.0002967912,0.0002036721,0.001119272,0.0002286831,0.00001273856,0.00001630493,0.00003389296,0.7956191,0.00009355998,0.2001046,0.001845991,0.0004253137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5326802,0.000403879,0.4556498,0.003392603,0.00133962,0.0004826217,0.00004502575,0.0005712889,0.005434983],"genre_scores_gemma":[0.7936152,0.00001717932,0.2057707,0.0001914824,0.0001101847,0.00001534174,0.00008471757,0.00003028531,0.0001649297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6340059,"threshold_uncertainty_score":0.9997987,"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."}}