{"id":"W7110046292","doi":"10.4230/lipics.itcs.2025.11","title":"Rank Lower Bounds on Non-Local Quantum Computation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Agence Nationale de la Recherche; Innovation, Science and Economic Development Canada","keywords":"Upper and lower bounds; Quantum entanglement; Rank (graph theory); Communication complexity; Quantum information science; Bounding overwatch; Randomness; Quantum; Function (biology); Quantum information","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.0006057653,0.0004869383,0.0005143796,0.0005063571,0.0006587279,0.0007436445,0.001416867,0.0002406652,0.000006212364],"category_scores_gemma":[0.00006166146,0.0004247644,0.0003318278,0.0007385897,0.0001652934,0.0007219182,0.0005381611,0.000634015,0.0001413452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001477418,"about_ca_system_score_gemma":0.0001727513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000017284,"about_ca_topic_score_gemma":0.000004980132,"domain_scores_codex":[0.9970407,0.00004022936,0.00104215,0.0004591515,0.0005683307,0.0008494285],"domain_scores_gemma":[0.9980546,0.000313265,0.0003307976,0.0008456099,0.0002696621,0.0001860789],"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.0006190275,0.002114094,0.00113658,0.001667909,0.0007090009,0.00005956681,0.01509183,0.1209261,0.0001321377,0.2347595,0.07253243,0.5502518],"study_design_scores_gemma":[0.002439717,0.0004752766,0.0007929862,0.0003114085,0.00001873308,0.00002432179,0.000157443,0.9606367,0.0003464396,0.006552201,0.02778688,0.0004578949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1032788,0.00002557154,0.8875325,0.001243624,0.003120697,0.0007156905,0.00006275569,0.0003677844,0.003652617],"genre_scores_gemma":[0.9639529,0.000007894769,0.03172244,0.003588637,0.0001699839,0.00005433278,0.0001297742,0.00003167029,0.0003423418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8606741,"threshold_uncertainty_score":0.9998204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006805257372883821,"score_gpt":0.2554954907077905,"score_spread":0.2486902333349067,"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."}}