{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393504,0.000876172,0.001654695,0.0006500844,0.002233209,0.004345224,0.003198569,0.002243055,0.006066242],"category_scores_gemma":[0.01250669,0.0008728535,0.001736694,0.001214523,0.004892207,0.008284708,0.004674098,0.009299481,0.0007330201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002311767,"about_ca_system_score_gemma":0.001912074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034869,"about_ca_topic_score_gemma":0.001592985,"domain_scores_codex":[0.9966962,0.0008941635,0.0001710432,0.0009151201,0.0008791028,0.0004442446],"domain_scores_gemma":[0.9816616,0.0150913,0.0007287292,0.001247425,0.0006441482,0.000626948],"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.001425787,0.0006580746,0.002909024,0.0009966743,0.0002583063,0.0008026532,0.001200057,0.135903,0.01269919,0.7714189,0.02418616,0.0475421],"study_design_scores_gemma":[0.0001556974,0.00005679413,0.0006408768,0.00003481328,0.00003979754,0.0002095333,0.0002020303,0.131861,0.004137272,0.8580798,0.004551183,0.00003125044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5341007,0.001846947,0.3382704,0.02507171,0.0004018072,0.0002492459,0.003596993,0.001295181,0.09516709],"genre_scores_gemma":[0.9548776,0.0006516391,0.03340221,0.001156615,0.0003488876,0.0002436261,0.001919068,0.0001739142,0.007226383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006066242,"threshold_uncertainty_score":0.02029359,"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."}}