{"id":"W1644115585","doi":"10.26421/qic10.3-4-11","title":"Strong NP-hardness of the quantum separability problem","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":243,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Separable state; Combinatorics; Mathematics; Quantum entanglement; Separable space; Bipartite graph; Dimension (graph theory); Inverse; Simple (philosophy); Quantum; Quantum state; State (computer science); Upper and lower bounds; Discrete mathematics; TRACE (psycholinguistics); Density matrix; Quantum discord; Quantum mechanics; Physics; Algorithm; Mathematical analysis; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0004957249,0.0001355892,0.0001513296,0.00009577798,0.0002564403,0.000184938,0.0004440106,0.00007151769,0.000003433682],"category_scores_gemma":[0.00005123202,0.00009584714,0.00006741806,0.0003766364,0.0001074976,0.0009035163,0.000210284,0.0002933307,0.000008400087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001039252,"about_ca_system_score_gemma":0.00008820606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004346326,"about_ca_topic_score_gemma":0.000006819807,"domain_scores_codex":[0.9987927,0.00007396225,0.0004697843,0.0001619128,0.000320377,0.0001812484],"domain_scores_gemma":[0.9989934,0.0000847827,0.000340266,0.0003185871,0.0001994636,0.00006351627],"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.00001529872,0.00009037531,0.002734302,0.0002016067,0.00002114071,3.610016e-7,0.005879596,0.02658758,0.0006669177,0.683831,0.0005744329,0.2793974],"study_design_scores_gemma":[0.0002734594,0.00005453172,0.02281252,0.00001766246,0.000003896006,0.00002563426,0.0000623784,0.9515278,0.0002788563,0.0230492,0.001772134,0.0001218937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5644844,0.000008926865,0.433296,0.0008782006,0.0006899945,0.0002066016,0.000004308342,0.00009491023,0.0003367144],"genre_scores_gemma":[0.9873128,0.000001775911,0.01244505,0.0001843923,0.0000319804,0.000006839088,0.000007905262,0.000003700467,0.000005536834],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9249402,"threshold_uncertainty_score":0.3908533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007837065178921783,"score_gpt":0.2405058865934042,"score_spread":0.2326688214144824,"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."}}