{"id":"W4413132918","doi":"10.1137/23m1549353","title":"A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fujitsu Laboratories of America; National Research Foundation Singapore; Innovation, Science and Economic Development Canada","keywords":"Communication complexity; Quantum entanglement; Upper and lower bounds; Discrete mathematics; Quantum; Quantum information science; Mathematics; Quantum cryptography; Direct product; Quantum information; Quantum key distribution; Combinatorics; Physics; 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.003056772,0.001898553,0.002135792,0.002659594,0.002296282,0.004186764,0.002943894,0.002638018,0.0126646],"category_scores_gemma":[0.01108379,0.0009413083,0.002679823,0.00281585,0.00650988,0.01491987,0.005754648,0.008587418,0.002581616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002308345,"about_ca_system_score_gemma":0.001422977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009654532,"about_ca_topic_score_gemma":0.000744431,"domain_scores_codex":[0.9980464,0.0005446812,0.00009356876,0.000422051,0.0007039515,0.0001894138],"domain_scores_gemma":[0.9907534,0.006670202,0.0003030852,0.0009474652,0.001027764,0.0002981002],"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.00001072972,0.00001318962,0.00004734643,0.00003770203,0.000005930443,0.00001884159,0.00004232566,0.00115063,0.0002154449,0.9923847,0.001882788,0.004190424],"study_design_scores_gemma":[0.00000514697,0.000008918264,0.00003260648,0.000007735572,0.000004058953,0.00003661565,0.000005979604,0.008796557,0.000151013,0.9891104,0.001832246,0.000008655806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02049558,0.003847202,0.8747925,0.005828776,0.001021227,0.00009192696,0.0003547516,0.0002460997,0.09332199],"genre_scores_gemma":[0.6684186,0.008034166,0.2501213,0.003734111,0.007049774,0.0007473003,0.0007526653,0.0007715194,0.06037063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0126646,"threshold_uncertainty_score":0.04236728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0230217637800299,"score_gpt":0.2975519321859303,"score_spread":0.2745301684059004,"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."}}