{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003802931,0.001651936,0.001337977,0.002176679,0.001861244,0.004314954,0.002441156,0.001809796,0.00844161],"category_scores_gemma":[0.02416894,0.000603456,0.001366375,0.001892765,0.005635581,0.009390576,0.005169023,0.00749901,0.001721619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003056237,"about_ca_system_score_gemma":0.001888247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008866544,"about_ca_topic_score_gemma":0.0009417978,"domain_scores_codex":[0.9938375,0.001724225,0.0002243902,0.0008058724,0.00234265,0.00106536],"domain_scores_gemma":[0.9673356,0.02227751,0.001569777,0.005514734,0.002070653,0.001231704],"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.0001612989,0.00007396789,0.0004369689,0.0001572122,0.00002534628,0.00008182706,0.0002101093,0.04340921,0.003020551,0.9364877,0.003043726,0.01289202],"study_design_scores_gemma":[0.00002001049,0.00007504925,0.000233915,0.0000337237,0.00001932921,0.00006234465,0.00004346178,0.1845467,0.00356764,0.8091146,0.002244346,0.00003889218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1786558,0.003317305,0.7121162,0.005265934,0.0003079138,0.0002013872,0.000944099,0.001421726,0.09776966],"genre_scores_gemma":[0.9304746,0.001617588,0.05387706,0.0004897608,0.0005993103,0.0003075652,0.0005855585,0.00040882,0.01163975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00844161,"threshold_uncertainty_score":0.02823997,"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."}}