{"id":"W1518254600","doi":"10.1007/978-3-540-72504-6_28","title":"Quantum Multiparty Communication Complexity and Circuit Lower Bounds","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Omega; Communication complexity; Quantum; Function (biology); Quantum information science; Upper and lower bounds; Mathematics; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Physics; Quantum mechanics; Mathematical analysis; Quantum entanglement","routes":{"ca_aff":true,"ca_fund":false,"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.001845009,0.0006958763,0.0006913882,0.0008659756,0.0007663498,0.000925281,0.003814696,0.0004173332,0.00001575513],"category_scores_gemma":[0.00009565834,0.0006412822,0.0001507996,0.0006546988,0.002170257,0.0004750779,0.002687448,0.00160132,0.00002654869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002279295,"about_ca_system_score_gemma":0.00033997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008523378,"about_ca_topic_score_gemma":0.000171006,"domain_scores_codex":[0.995479,0.0000776504,0.000707227,0.001753416,0.001061631,0.0009210487],"domain_scores_gemma":[0.995837,0.0008336566,0.0004033293,0.002337188,0.0002809997,0.0003078694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000870262,0.00006771631,0.00009452407,0.00005432842,0.00001539918,0.00009989205,0.001454046,0.009314626,0.00005359077,0.141179,0.00002853112,0.8476297],"study_design_scores_gemma":[0.000262721,0.000142427,0.0006288126,0.0003082428,0.000005976261,0.0001437394,1.814364e-7,0.7022837,0.00007533967,0.2929237,0.002602061,0.0006231709],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001248985,0.001238697,0.9918594,0.0007986037,0.001419887,0.0003835709,0.000007839606,0.0003014728,0.002741535],"genre_scores_gemma":[0.4301668,0.0001247462,0.5666488,0.002233114,0.0005164514,0.000005906327,0.00001467435,0.0000668731,0.0002225973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8470065,"threshold_uncertainty_score":0.9996039,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04172055486106492,"score_gpt":0.2730826443293072,"score_spread":0.2313620894682423,"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."}}