{"id":"W3009023057","doi":"10.1145/3512751","title":"Quantum Distributed Complexity of Set Disjointness on a Line","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Constant (computer programming); Qubit; Binary logarithm; Discrete mathematics; Omega; Quantum; Computer science; Graph; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.0006263256,0.0001999919,0.0002582298,0.0002675847,0.0007088485,0.00004761675,0.001017055,0.00003573583,0.00008208127],"category_scores_gemma":[0.00004026754,0.0001947279,0.0001666289,0.0008542851,0.000149519,0.000094022,0.00007955408,0.0004873067,0.00001433198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000746245,"about_ca_system_score_gemma":0.00007227298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001691111,"about_ca_topic_score_gemma":0.000001628694,"domain_scores_codex":[0.9978328,0.0006030943,0.0003791529,0.0004464274,0.0004932931,0.0002451993],"domain_scores_gemma":[0.9980561,0.0008593595,0.0001966866,0.0007160202,0.0000884682,0.00008335034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009684522,0.0004079163,0.000002033287,0.00001462923,0.00003608788,0.00000703477,0.0008067884,0.8211753,0.00005801719,0.08928695,0.00005543653,0.08805299],"study_design_scores_gemma":[0.000514579,0.0007242382,0.0003058289,0.00001967628,0.00001055585,0.00002755139,0.0001363138,0.7326056,0.0008117092,0.2644335,0.0002299078,0.0001804994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0664774,0.00001589141,0.9300806,0.001966895,0.0006590902,0.0002001577,0.0002808304,0.0002753295,0.00004381067],"genre_scores_gemma":[0.9807414,0.000001543301,0.01870585,0.0003664574,0.00002902569,0.00002913361,0.00007496071,0.00001632997,0.00003526878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.914264,"threshold_uncertainty_score":0.7940771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04058135794070367,"score_gpt":0.2855338444806818,"score_spread":0.2449524865399781,"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."}}