{"id":143654,"date":"2022-08-05T20:23:08","date_gmt":"2022-08-06T01:23:08","guid":{"rendered":"https:\/\/lifeboat.com\/blog\/2022\/08\/computer-science-proof-unveils-unexpected-form-of-entanglement"},"modified":"2022-08-05T20:23:08","modified_gmt":"2022-08-06T01:23:08","slug":"computer-science-proof-unveils-unexpected-form-of-entanglement","status":"publish","type":"post","link":"https:\/\/lifeboat.com\/blog\/2022\/08\/computer-science-proof-unveils-unexpected-form-of-entanglement","title":{"rendered":"Computer Science Proof Unveils Unexpected Form of Entanglement"},"content":{"rendered":"<p><a class=\"aligncenter blog-photo\" href=\"https:\/\/lifeboat.com\/blog.images\/computer-science-proof-unveils-unexpected-form-of-entanglement2.jpg\"><\/a><\/p>\n<p>Another version of the PCP theorem, not yet proved, specifically deals with the quantum case. Computer scientists suspect that the quantum PCP conjecture is true, and proving it would change our understanding of the complexity of quantum problems. It\u2019s considered arguably the most important open problem in quantum computational complexity theory. But so far, it\u2019s remained unreachable.<\/p>\n<p>Nine years ago, two researchers identified an intermediate goal to help us get there. They came up with <a href=\"https:\/\/arxiv.org\/abs\/1301.1363\" target=\"_blank\" rel=\"noreferrer noopener\">a simpler hypothesis<\/a>, known as the \u201cno low-energy trivial state\u201d (NLTS) conjecture, which would have to be true if the quantum PCP conjecture is true. Proving it wouldn\u2019t necessarily make it any easier to prove the quantum PCP conjecture, but it would resolve some of its most intriguing questions.<\/p>\n<p>Then in June of 2022, in a paper posted to the scientific preprint site arxiv.org, three computer scientists <a href=\"https:\/\/arxiv.org\/abs\/2206.13228\" target=\"_blank\" rel=\"noreferrer noopener\">proved the NLTS conjecture<\/a>. The result has striking implications for computer science and quantum physics.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Another version of the PCP theorem, not yet proved, specifically deals with the quantum case. Computer scientists suspect that the quantum PCP conjecture is true, and proving it would change our understanding of the complexity of quantum problems. It\u2019s considered arguably the most important open problem in quantum computational complexity theory. But so far, it\u2019s [\u2026]<\/p>\n","protected":false},"author":661,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1523,1617,224],"tags":[],"class_list":["post-143654","post","type-post","status-publish","format-standard","hentry","category-computing","category-quantum-physics","category-science"],"_links":{"self":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/143654","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/users\/661"}],"replies":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/comments?post=143654"}],"version-history":[{"count":0,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/143654\/revisions"}],"wp:attachment":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/media?parent=143654"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/categories?post=143654"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/tags?post=143654"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}