{"id":"W4313266499","doi":"10.1103/physreva.106.062443","title":"Complete hierarchy of linear systems for certifying quantum entanglement of subspaces","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Multipartite; Hierarchy; Linear subspace; Quantum entanglement; Subspace topology; Quantum system; Semidefinite programming; Rank (graph theory); Mathematics; Quantum; Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Quantum mechanics; Physics; Combinatorics; Mathematical optimization","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.004691285,0.0008433199,0.0009484239,0.001751736,0.001552185,0.003319021,0.001674006,0.001382606,0.009173214],"category_scores_gemma":[0.01257249,0.000875095,0.001178064,0.0009488441,0.004635433,0.006465128,0.004306264,0.004971077,0.001904509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002100682,"about_ca_system_score_gemma":0.002029009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219839,"about_ca_topic_score_gemma":0.001528681,"domain_scores_codex":[0.9958544,0.001587236,0.000249898,0.000455959,0.001449712,0.0004027648],"domain_scores_gemma":[0.991544,0.004642408,0.0006058357,0.001362132,0.001389255,0.0004565001],"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.00001515394,0.00001826544,0.00009819664,0.00008916791,0.00001019771,0.00004708948,0.0001503734,0.00407412,0.001230454,0.9876035,0.001257403,0.005406128],"study_design_scores_gemma":[0.0000175207,0.00003017197,0.00009402177,0.0000446578,0.00000782978,0.00007101239,0.00004794072,0.05722674,0.001067062,0.9381149,0.003250925,0.0000273245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02690065,0.0008572199,0.9206461,0.001993313,0.0001152258,0.0002138687,0.0004456785,0.0006574263,0.04817053],"genre_scores_gemma":[0.6054755,0.001347807,0.3789865,0.001517162,0.0004144051,0.0005683542,0.0008800261,0.0002379909,0.01057223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009173214,"threshold_uncertainty_score":0.03068745,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04742040345795007,"score_gpt":0.3669658772837117,"score_spread":0.3195454738257617,"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."}}