{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001368827,0.0002713048,0.0003407445,0.0004662825,0.001492747,0.0005664387,0.001696775,0.00004516477,0.000001480282],"category_scores_gemma":[0.00006846432,0.0002106436,0.000168353,0.001296335,0.000081432,0.0001245744,0.0003835033,0.0005548545,0.000006562373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008469802,"about_ca_system_score_gemma":0.0001695843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008966889,"about_ca_topic_score_gemma":0.000009590807,"domain_scores_codex":[0.9978468,0.000243347,0.0004790602,0.0005643736,0.0003812031,0.0004851746],"domain_scores_gemma":[0.9975707,0.0006002018,0.0003167137,0.0009299919,0.0004022807,0.0001801215],"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.00008117177,0.0003530773,0.0005908781,0.00008032896,0.0001712631,0.000006543884,0.001187465,0.06505274,0.0002395124,0.6524643,0.001067082,0.2787056],"study_design_scores_gemma":[0.001580105,0.0007542077,0.008567466,0.00124837,0.00004934376,0.0002172532,0.0001601053,0.8340887,0.001590974,0.1050232,0.04595364,0.0007666255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02642572,0.0003191567,0.9643668,0.006019969,0.0002946355,0.0008910669,0.000003682136,0.0002428318,0.001436144],"genre_scores_gemma":[0.6810386,0.00000638497,0.3177194,0.0009770162,0.0001962674,0.00002900164,0.000003002215,0.00001514532,0.00001512179],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.769036,"threshold_uncertainty_score":0.9998072,"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."}}