{"id":32280,"date":"2025-08-30T05:41:23","date_gmt":"2025-08-30T05:41:23","guid":{"rendered":"https:\/\/www.europesays.com\/ie\/32280\/"},"modified":"2025-08-30T05:41:23","modified_gmt":"2025-08-30T05:41:23","slug":"scientists-just-simulated-the-impossible-in-quantum-computing","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/ie\/32280\/","title":{"rendered":"Scientists Just Simulated the \u201cImpossible\u201d in Quantum Computing"},"content":{"rendered":"

\t\t\"Method<\/a>Quantum computers can perform complex computations thanks to their ability to represent an enormous number of different states at the same time in a so-called quantum superposition. Representing these superpositions of states is incredibly difficult to describe. Now, a research team has found a relatively simple method to simulate some relevant quantum superpositions of states. The illustration shows one of these superpositions, which can be created inside what\u2019s known as a continuous-variable quantum computer. The team was able to observe how these states change when they interact with each other, and they were also able to simulate those changes using wave-like patterns, like the ones you see in the image. Credit: Chalmers University of Technology, Cameron Calcluth<\/p>\n

Quantum computers hold incredible promise, but one major challenge still stands in the way: their struggle to correct errors during calculations.<\/strong><\/p>\n

To build truly reliable quantum machines, scientists need to simulate these quantum processes on regular computers to make sure they\u2019re working correctly. That\u2019s no easy feat\u2014it\u2019s one of the most complex tasks in computing. Now, in an exciting world-first, researchers from Chalmers University of Technology in Sweden, along with teams from Milan, Granada, and Tokyo, have developed a groundbreaking method for simulating certain types of error-corrected quantum computations. It\u2019s a major step forward in the race to build powerful, dependable quantum technology.<\/p>\n

Quantum Promise & Challenges<\/p>\n

Quantum computers could one day tackle problems far beyond the reach of today\u2019s most powerful supercomputers. Their revolutionary computing power has the potential to transform fields like medicine, energy, encryption, artificial intelligence, and logistics.<\/p>\n

But despite these exciting possibilities, quantum technology still faces a critical obstacle: errors. Unlike traditional computers, which can correct mistakes quickly and reliably, quantum systems are far more prone to errors and much harder to fix. Quantum computers are not yet fault-tolerant, meaning they still lack the reliability needed for practical use.<\/p>\n

To ensure that a quantum computation works correctly, researchers often turn to classical computers to simulate the process. These simulations help verify results, especially for computations designed to resist disturbances and fix errors along the way. But simulating such advanced quantum behavior is incredibly complex. In some cases, it would take even the world\u2019s fastest supercomputer longer than the age of the universe to complete the task.<\/p>\n

\"Cameron<\/a>Cameron Calcluth. Credit: Chalmers University of Technology, Lovisa H\u00e5kansson
\nGlobal Team\u2019s Simulation Breakthrough<\/p>\n

Now, researchers from Chalmers University of Technology<\/a> in Sweden, together with teams from the University of Milan, the University of Granada, and the University of Tokyo<\/a>, have made a major breakthrough. For the first time, they\u2019ve developed a method to accurately simulate a special type of error-corrected quantum computation\u2014one that had previously been nearly impossible to model.<\/p>\n

\u201cWe have discovered a way to simulate a specific type of quantum computation where previous methods have not been effective. This means that we can now simulate quantum computations with an error correction code used for fault tolerance, which is crucial for being able to build better and more robust quantum computers in the future,\u201d says Cameron Calcluth, PhD in Applied Quantum Physics at Chalmers and first author of a study recently published in Physical Review Letters.<\/p>\n

Qubits, Noise & Bosonic Codes<\/p>\n

The limited ability of quantum computers to correct errors stems from their fundamental building blocks, qubits, which have the potential for immense computational power but are also highly sensitive. The computational power of quantum computers relies on the quantum mechanical phenomenon of superposition, meaning qubits can simultaneously hold the values 1 and 0, as well as all intermediate states, in any combination. The computational capacity increases exponentially with each additional qubit, but the trade-off is their extreme susceptibility to disturbances.<\/p>\n

\u201cThe slightest noise from the surroundings in the form of vibrations, electromagnetic radiation, or a change in temperature can cause the qubits to miscalculate or even lose their quantum state, their coherence, thereby also losing their capacity to continue calculating,\u201d says Calcluth.<\/p>\n

To address this issue, error correction codes are used to distribute information across multiple subsystems, allowing errors to be detected and corrected without destroying the quantum information. One way is to encode the quantum information of a qubit into the multiple, possibly infinite, energy levels of a vibrating quantum mechanical system. This is called a bosonic code. However, simulating quantum computations with bosonic codes is particularly challenging because of the multiple energy levels, and researchers have been unable to reliably simulate them using conventional computers \u2013 until now.<\/p>\n

\"Giulia<\/a>Giulia Ferrini. Credit: Chalmers University of Technology, Anna-Lena Lundqvist
\nGKP Algorithm: Mathematical Innovation<\/p>\n

The method developed by the researchers consists of an algorithm capable of simulating quantum computations that use a type of bosonic code known as the Gottesman-Kitaev-Preskill (GKP) code. This code is commonly used in leading implementations of quantum computers.<\/p>\n

\u201cThe way it stores quantum information makes it easier for quantum computers to correct errors, which in turn makes them less sensitive to noise and disturbances. Due to their deeply quantum mechanical nature, GKP codes have been extremely difficult to simulate using conventional computers. But now we have finally found a unique way to do this much more effectively than with previous methods,\u201d says Giulia Ferrini, Associate Professor of Applied Quantum Physics at Chalmers and co-author of the study.<\/p>\n

Toward Scalable Fault-Tolerant Machines<\/p>\n

The researchers managed to use the code in their algorithm by creating a new mathematical tool. Thanks to the new method, researchers can now more reliably test and validate a quantum computer\u2019s calculations.<\/p>\n

\u201cThis opens up entirely new ways of simulating quantum computations that we have previously been unable to test but are crucial for being able to build stable and scalable quantum computers,\u201d says Ferrini.<\/p>\n

The article \u201cClassical simulation of circuits with realistic odd-dimensional Gottesman-Kitae-Preskill states\u201d has been published in Physical Review Letters.<\/p>\n

Reference: \u201cClassical Simulation of Circuits with Realistic Odd-Dimensional Gottesman-Kitaev-Preskill States\u201d by Cameron Calcluth, Oliver Hahn, Juani Bermejo-Vega, Alessandro Ferraro and Giulia Ferrini, 1 July 2025, Physical Review Letters.
DOI: 10.1103\/xmtw-g54f<\/a><\/p>\n

The authors are Cameron Calcluth, Giulia Ferrini, Oliver Hahn, Juani Bermejo-Vega and Alessandro Ferraro. The researchers are active at Chalmers University of Technology, Sweden, the University of Milan, Italy, the University of Granada, Spain, and the University of Tokyo, Japan.<\/p>\n

Never miss a breakthrough: Join the SciTechDaily newsletter.<\/a><\/b><\/p>\n","protected":false},"excerpt":{"rendered":"Quantum computers can perform complex computations thanks to their ability to represent an enormous number of different states…\n","protected":false},"author":2,"featured_media":32281,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[262],"tags":[19953,314,18,19,17,5004,751,82],"class_list":{"0":"post-32280","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-computing","8":"tag-chalmers-university-of-technology","9":"tag-computing","10":"tag-eire","11":"tag-ie","12":"tag-ireland","13":"tag-popular","14":"tag-quantum-computing","15":"tag-technology"},"share_on_mastodon":{"url":"","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts\/32280","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/comments?post=32280"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/posts\/32280\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/media\/32281"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/media?parent=32280"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/categories?post=32280"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/ie\/wp-json\/wp\/v2\/tags?post=32280"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}