wp-plugin-hostgator
domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init
action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home4/scienrds/scienceandnerds/wp-includes/functions.php on line 6114ol-scrapes
domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init
action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home4/scienrds/scienceandnerds/wp-includes/functions.php on line 6114Source:https:\/\/www.quantamagazine.org\/physicists-finally-find-a-problem-only-quantum-computers-can-do-20240312\/#comments<\/a><\/br> Quantum computers are poised to become computational superpowers, but researchers have long sought a viable problem that confers a quantum advantage \u2014 something only a quantum computer can solve. Only then, they argue, will the technology finally be seen as essential.<\/p>\n They\u2019ve been looking for decades. \u201cPart of the reason it\u2019s challenging is because classical computers are pretty good at a lot of the things they do,\u201d said John Preskill<\/a>, a theoretical physicist at the California Institute of Technology.<\/p>\n In 1994, Peter Shor discovered<\/a> one possibility: a quantum algorithm for factoring large numbers. Shor\u2019s algorithm is powerful and widely believed to beat all classical algorithms; when run on a quantum computer, it has the potential to break much of the internet\u2019s security systems, which rely on the hardness of factoring large numbers. But as impressive as it is, the algorithm is relevant only to a narrow slice of research areas, and it\u2019s possible that tomorrow someone will find an efficient way to factor large numbers on a classical machine, making Shor\u2019s algorithm moot. Shor\u2019s narrow applicability has led the research community to search for other use cases for quantum machines that might actually help make new scientific discoveries.<\/p>\n \u201cWe don\u2019t want to build a computer just for a single task,\u201d said Soonwon Choi<\/a>, a physicist at the Massachusetts Institute of Technology. \u201cOther than Shor\u2019s algorithm, what else can we do with a quantum computer?\u201d<\/p>\n As Preskill puts it, \u201cWe have to find those problems that are classically hard, but then we have to [show] that the quantum methods will really be efficient.\u201d<\/p>\n A few times, researchers thought they\u2019d done it, discovering quantum algorithms that could solve problems faster than anything a classical computer could do. But then someone \u2014 often the young researcher Ewin Tang<\/a> \u2014 came up with clever new classical algorithms that could outperform the quantum ones.<\/p>\n Now, a team of physicists including Preskill may have found the best candidate yet<\/a> for quantum advantage. By studying the energy of certain quantum systems, they discovered a specific and useful question that is easy for a quantum machine to answer, but still difficult for a classical one. \u201cThis is major progress on quantum algorithms theory,\u201d said Sergey Bravyi<\/a>, a theoretical physicist and computer scientist at IBM. \u201cTheir result is a quantum advantage for a problem with relevance to chemistry and material sciences.\u201d<\/p>\n Researchers are also excited that the new work explores unexpected new areas of the physical sciences. \u201cThis new capability is qualitatively different [than Shor\u2019s] and potentially opens up many new opportunities in\u00a0the world of quantum algorithms,\u201d said Choi.<\/p>\n<\/div>\n <\/br><\/br><\/br><\/p>\n
\nPhysicists Finally Find a Problem That Only Quantum Computers Can Do<\/br>
\n2024-03-13 21:58:44<\/br><\/p>\n