{"id":"W2942008046","doi":"10.1142/s0129055x21500136","title":"LOCC protocols with bounded width per round optimize convex functions","year":2021,"lang":"en","type":"review","venue":"Reviews in Mathematical Physics","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"European Regional Development Fund; Generalitat de Catalunya; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"LOCC; Multipartite; Protocol (science); Computer science; Dimension (graph theory); Upper and lower bounds; Quantum state; Mathematics; Quantum entanglement; Discrete mathematics; Theoretical computer science; Combinatorics; Quantum; Bipartite graph; Physics; Quantum mechanics; Mathematical analysis","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","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009229511,0.0006926786,0.003501519,0.000151835,0.0001337211,0.0006153266,0.001229914,0.0002268214,0.00022961],"category_scores_gemma":[0.00009668736,0.0004502142,0.0009556818,0.001832342,0.0001635037,0.0007623609,0.0002814856,0.0007667478,0.001692641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001305912,"about_ca_system_score_gemma":0.0004593431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.959511e-7,"about_ca_topic_score_gemma":5.600194e-7,"domain_scores_codex":[0.9961074,0.0004676546,0.001734128,0.0006189828,0.0005864617,0.0004853454],"domain_scores_gemma":[0.9967423,0.0003506778,0.0008266141,0.00175105,0.0001459862,0.0001833895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[7.028387e-7,0.0002585369,1.844517e-7,0.02749284,0.00005591006,0.000005915679,0.0001113285,0.00000335414,1.466323e-8,0.417115,0.001172802,0.5537834],"study_design_scores_gemma":[0.0002136545,0.00005832343,9.41663e-8,0.03970611,0.0001526837,0.00006102597,0.00001274758,0.001002771,1.473089e-7,0.02126474,0.9369848,0.0005428607],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.654477e-8,0.5298554,0.4537436,0.00002119289,0.00004821902,0.01050014,0.000004286184,0.0000746197,0.005752529],"genre_scores_gemma":[7.777375e-8,0.8636409,0.1176574,0.0001842749,0.00009512164,0.01809349,0.00004204984,0.00004188012,0.0002447758],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9358121,"threshold_uncertainty_score":0.999795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.104628908566838,"score_gpt":0.3720134121675989,"score_spread":0.2673845036007609,"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."}}