{"id":341290,"date":"2025-10-29T18:06:12","date_gmt":"2025-10-29T18:06:12","guid":{"rendered":"https:\/\/www.europesays.com\/us\/341290\/"},"modified":"2025-10-29T18:06:12","modified_gmt":"2025-10-29T18:06:12","slug":"scientists-found-a-question-so-hard-even-quantum-computers-cant-answer-it","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/us\/341290\/","title":{"rendered":"Scientists Found a Question So Hard, Even Quantum Computers Can\u2019t Answer It"},"content":{"rendered":"<p class=\"mb-4 text-lg md:leading-8 break-words\">&#8220;Hearst Magazines and Yahoo may earn commission or revenue on some items through these links.&#8221;<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">Here\u2019s what you\u2019ll learn when you read this story:<\/p>\n<ul class=\"mb-4\">\n<li class=\"ml-4 list-disc\">\n<p class=\"mb-4 text-lg md:leading-8 break-words\">Quantum computers can outperform even the best classical supercomputers thanks to quantum entanglement and superposition, but even they can\u2019t solve some problems.<\/p>\n<\/li>\n<li class=\"ml-4 list-disc\">\n<p class=\"mb-4 text-lg md:leading-8 break-words\">A new preprint study shows how quantum computers can\u2019t solve a \u201cnightmare\u201d problem of determining quantum phases of matter.<\/p>\n<\/li>\n<li class=\"ml-4 list-disc\">\n<p class=\"mb-4 text-lg md:leading-8 break-words\">This limitation of quantum computers might point to a limit on physical observation itself.<\/p>\n<\/li>\n<\/ul>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">Quantum computing is often portrayed as the \u201csuperman\u201d of the information age. Powered by entangled qubits in <a href=\"https:\/\/www.popularmechanics.com\/science\/math\/a29339863\/quantum-superposition-molecules\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:superposition;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">superposition<\/a>, these high-tech machines can perform many calculations at once, drastically improving computing time when compared to classic supercomputers. Just last week, for instance, Google announced that the company\u2019s quantum computer could run algorithms some <a href=\"https:\/\/go.redirectingat.com?id=74968X1596630&amp;url=https%3A%2F%2Fwww.nytimes.com%2F2025%2F10%2F22%2Ftechnology%2Fgoogles-quantum-computer-leap.html%23%3A~%3Atext%3DDesigned%2520to%2520accelerate%2520advances%2520in%2Cwritten%2520for%2520a%2520traditional%2520supercomputer.&amp;sref=https%3A%2F%2Fwww.popularmechanics.com%2Fscience%2Fa69167426%2Fquantum-computers-nightmare-problems%2F\" data-i13n=\"elm:affiliate_link;elmt:premonetized\" rel=\"sponsored nofollow noopener\" target=\"_blank\" data-ylk=\"slk:13,000 times faster;elm:affiliate_link;elmt:premonetized;itc:0;sec:content-canvas\" class=\"link \">13,000 times faster<\/a> than its classical counterpart.<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">But even Superman has his kryptonite\u2014and the same can be said for <a href=\"https:\/\/www.popularmechanics.com\/science\/a65450326\/magic-state-distillation\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:quantum computers;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">quantum computers<\/a>.<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">Usually, these weaknesses play out on the engineering side of things. For one, quantum computers are extremely susceptible to <a href=\"https:\/\/www.popularmechanics.com\/science\/a64670356\/quantum-teleportation-internet-breakthrough\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:decoherence;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">decoherence<\/a> and require robust error-correction to even be usable. This is the chief reason why today\u2019s quantum computers can barely inch past the 1,000-qubit mark, and current estimates suggest that a <a href=\"https:\/\/introtoquantum.org\/essentials\/timelines\/#:~:text=Moreover%2C%20we&#039;re%20quite%20convinced,factor%20a%202048%2Dbit%20number.\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:20 million-qubit quantum computer;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">20 million-qubit quantum computer<\/a> would be needed to break classical cryptography.<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">But a new study, recently uploaded to the <a href=\"https:\/\/arxiv.org\/pdf\/2510.08503\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:preprint server arXiv;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">preprint server arXiv<\/a>, explores the computational limits of these machines\u2014possibly probing the very limit of physical observation itself. In other words, there are some <a href=\"https:\/\/www.popularmechanics.com\/space\/deep-space\/a65440487\/largest-black-hole-merger\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:problems;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">problems<\/a> that even quantum computers can\u2019t solve, and it could be that these questions are fundamentally unsolvable.<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">Although not all examples of determining a quantum phase are considered impossible, <a href=\"https:\/\/go.redirectingat.com?id=74968X1596630&amp;url=https%3A%2F%2Fwww.newscientist.com%2Farticle%2F2500558-nightmare-calculation-may-be-too-tricky-for-even-quantum-computers%2F&amp;sref=https%3A%2F%2Fwww.popularmechanics.com%2Fscience%2Fa69167426%2Fquantum-computers-nightmare-problems%2F\" data-i13n=\"elm:affiliate_link;elmt:premonetized\" rel=\"sponsored nofollow noopener\" target=\"_blank\" data-ylk=\"slk:New Scientist;elm:affiliate_link;elmt:premonetized;itc:0;sec:content-canvas\" class=\"link \">New Scientist<\/a> reports that some questions would require quantum computers to operate for impossibly long times\u2014potentially billions of <a href=\"https:\/\/www.popularmechanics.com\/space\/deep-space\/a26390\/white-dwarf-end-of-universe\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:trillions of years;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">trillions of years<\/a>.<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">\u201cThey\u2019re like a <a href=\"https:\/\/www.popularmechanics.com\/space\/telescopes\/a40588144\/the-james-webb-space-telescopes-first-images-are-nasas-greatest-achievement-in-decades\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:nightmare scenario;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">nightmare scenario<\/a> that would be very bad if it appears,\u201d Schuster tells New Scientist. \u201cIt probably doesn\u2019t appear, but we should understand it better.\u201d<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">This work is a follow-up to Schuster\u2019s recent study, published earlier this year in the journal <a href=\"https:\/\/www.science.org\/doi\/10.1126\/science.adv8590\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:Science;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">Science<\/a>, which focused on improving randomness in quantum computers. Simulating <a href=\"https:\/\/www.popularmechanics.com\/science\/a64436067\/random-number\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:randomness;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">randomness<\/a> helps scientists understand real-world phenomena and design algorithms.<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">The team was able to generate randomness with fewer operations than were previously necessary, which could indicate that it\u2019s possible to create quantum computers focused on <a href=\"https:\/\/www.popularmechanics.com\/technology\/security\/a30750852\/cia-kryptos-puzzle\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:cryptography;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">cryptography<\/a> much more easily that was expected. However, within this research, Schuster and his team probed a deeper question behind the work: What are the possible computational limits of these machines?<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">\u201cOur results show that several fundamental physical properties\u2014evolution time, phases of matter, and causal structure\u2014 are probably hard to learn through conventional quantum <a href=\"https:\/\/www.popularmechanics.com\/science\/a22280\/double-slit-experiment-even-weirder\/\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:experiments;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">experiments<\/a>,\u201d the authors noted in <a href=\"https:\/\/phys.org\/news\/2025-07-randomness-key-powerful-quantum.html\" rel=\"nofollow noopener\" target=\"_blank\" data-ylk=\"slk:a press statement;elm:context_link;itc:0;sec:content-canvas\" class=\"link \">a press statement<\/a> at the time. \u201cThis raises profound questions about the nature of physical observation itself.\u201d<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\">[galleryCarousel id=&#8217;9e9354e9-d0c6-426e-ba21-7d41e95744de&#8217; mediaId=&#8217;6acac276-d46e-4570-9334-1c575c38ff79&#8242; display=&#8217;carousel&#8217; align=&#8217;center&#8217; size=&#8221;medium&#8221; share=&#8221;true&#8221; expand=&#8221; captions=&#8221;true&#8221; suppress-title=&#8221;false&#8221; hasProducts=&#8221;false&#8221;][\/galleryCarousel]<\/p>\n<p class=\"mb-4 text-lg md:leading-8 break-words\"><strong>You Might Also Like<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"&#8220;Hearst Magazines and Yahoo may earn commission or revenue on some items through these links.&#8221; Here\u2019s what you\u2019ll&hellip;\n","protected":false},"author":3,"featured_media":341291,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[25],"tags":[168123,168122,492,28543,13897,159,67,132,68],"class_list":{"0":"post-341290","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-physics","8":"tag-classical-cryptography","9":"tag-physical-observation","10":"tag-physics","11":"tag-quantum-computers","12":"tag-quantum-entanglement","13":"tag-science","14":"tag-united-states","15":"tag-unitedstates","16":"tag-us"},"share_on_mastodon":{"url":"https:\/\/pubeurope.com\/@us\/115458787667264784","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts\/341290","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/comments?post=341290"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/posts\/341290\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/media\/341291"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/media?parent=341290"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/categories?post=341290"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/us\/wp-json\/wp\/v2\/tags?post=341290"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}