A software breakthrough developed in the United Kingdom and Canada could reshape how scientists test and build quantum computers, allowing ordinary, off-the-shelf machines to run simulations that until now demanded some of the most powerful supercomputers on the planet. The new algorithm, described by researchers at the University of Edinburgh and EPCC, the UK’s first National Supercomputing Centre, enables classical computers to perform quantum simulations using roughly five per cent of the computing power previously required. The work, published in the journal Science Advances, suggests that a well-designed piece of software can do the job of hardware worth hundreds of millions of dollars, potentially accelerating the development of bigger and more reliable quantum devices.
The research focuses on a task known as Gaussian boson sampling, a simulation designed to demonstrate the superior capabilities of quantum devices powered by light, known as photonic quantum computers. Boson sampling problems ask a quantum machine to sample from probability distributions that are believed to be extraordinarily hard for classical computers to reproduce. Because photons can serve as the qubits and carriers of information in photonic architectures, these sampling experiments have become one of the leading benchmarks for so-called quantum advantage, the point at which a quantum device demonstrably outperforms any classical machine on a specific task. For the first time, the Edinburgh-led team’s algorithm allows standard computers to run this class of simulation directly.
In tests, the researchers found that classical computers equipped with the new algorithm could match and even outperform some current quantum devices at running the simulations. That result is striking because it means that, for at least some photonic experiments, a conventional machine running clever software can keep pace with hardware that researchers have spent years and substantial funding building. Rather than diminishing the case for quantum computers, the team argues, the result serves a constructive purpose: it gives scientists a cheaper, faster way to check what photonic devices are actually doing, and to understand where genuine quantum advantage begins and ends.
The significance of the advance lies in the economics of quantum research. Quantum computers could, in theory, perform calculations far beyond the capabilities of even the most advanced supercomputers, with applications ranging from materials discovery to cryptography. But current devices remain small and error-prone, and their performance is hindered by noise and imperfections in the underlying hardware. To build better machines, researchers need algorithms that simulate how quantum devices might work in reality, allowing them to predict behavior, identify limitations, and validate experimental results. Until now, running these simulations has required vast amounts of computing power available at only a handful of facilities worldwide, creating a bottleneck that slowed progress for all but the best-resourced laboratories.
By cutting the required computing power to around five per cent of what a supercomputer would need, the algorithm makes those experiments dramatically cheaper and more accessible. Dr Raul Garcia-Patron Sanchez, of the University of Edinburgh’s School of Informatics, who led the study, said that classical simulation of large-scale quantum computing circuits has so far been achieved through a combination of clever algorithms and intensive use of supercomputing facilities. According to Garcia-Patron Sanchez, the team’s work has contributed significant improvements in memory use, running time and energy costs in the simulation of photonic quantum computing devices, making mainstream what was before only accessible to a handful of facilities in the world. The energy savings alone could be substantial, since top-tier supercomputers consume enormous amounts of electricity when running full-scale quantum simulations.
Technically, the achievement reflects a deepening understanding of the structure of Gaussian boson sampling itself. Rather than treating the simulation as an undifferentiated brute-force computation, the algorithm exploits mathematical structure in the photonic circuits to reduce memory requirements and running time, allowing a standard computer to handle workloads that previously spilled over onto supercomputing infrastructure. The improvements in memory use are particularly important, because memory constraints, rather than raw processing speed, often determine whether a classical machine can attempt a large quantum simulation at all. By compressing the memory footprint of the calculation, the researchers opened the door to simulations on hardware found in ordinary university laboratories and company server rooms.
The advance could prove especially valuable for the development of light-based quantum devices, one of several branches of current quantum research pursued by academics and industry. Photonic quantum computing has attracted significant investment because photons can travel through optical fibers, operate at room temperature in some designs, and resist certain kinds of noise that plague other qubit technologies. Companies and research groups around the world have demonstrated photonic machines claiming quantum advantage on boson sampling tasks. Rigorous classical simulation of those machines is essential for verifying their claims and for engineering improvements, and the new algorithm provides a practical tool for doing exactly that without booking time on a national supercomputer.
The implications extend beyond photonic systems. Understanding the limitations of current quantum computers is a central challenge in the field, and classical simulation is one of the primary ways researchers probe those limits. When a classical algorithm can reproduce the output of a quantum device, it tells scientists that the device has not yet crossed the threshold into genuinely useful quantum computation for that task. Conversely, when a quantum machine produces results that resist even the best classical algorithms, that is evidence of real quantum advantage. Sharper, cheaper classical simulation tools therefore sharpen the boundary line itself, giving the entire field a more precise picture of where quantum hardware stands and what engineering challenges remain.
The team is now working on scaling up how the algorithm is used, potentially enabling much larger simulations to be run with the same computing power. If that effort succeeds, scientists could simulate photonic quantum computers in unprecedented detail, examining aspects of their behavior that are currently out of reach. Larger and more faithful simulations would help researchers anticipate how noise propagates through bigger circuits, how component imperfections accumulate, and how future architectures might be designed to suppress errors. In this way, a software advance on the classical side feeds directly into hardware progress on the quantum side, illustrating how the two branches of computing research advance in tandem rather than in isolation.
The research, published in Science Advances, was led by scientists at the University of Edinburgh and EPCC and also involved collaborators from Polytechnique Montréal in Canada. It received support from the UK’s Engineering and Physical Sciences Research Council and the Natural Sciences and Engineering Research Council of Canada, reflecting the international character of the effort. As quantum computers edge closer to practical utility, tools like this algorithm may determine how quickly the field moves, by letting far more researchers run the experiments that guide the design of improved devices. What was once the exclusive province of a handful of supercomputing facilities may soon be a routine part of quantum laboratories everywhere, lowering the cost of discovery in one of the most consequential technologies of the coming decades.
Subject of Research: A classical algorithm for Gaussian boson sampling that dramatically reduces the computing power needed to simulate photonic quantum computers
Article Title: Software breakthrough could spur quantum computer advances
Article References: Software breakthrough could spur quantum computer advances. (n.d.). Original publication
Image Credits: AI Generated
DOI: Not provided
Keywords: quantum computing, Gaussian boson sampling, photonic quantum computers, classical simulation, algorithms, University of Edinburgh, EPCC, supercomputing, Science Advances, quantum advantage, error-prone quantum devices, computational efficiency
Cite Scienmag News
Katie Riggs. (October 14, 2026). New Algorithm Lets Ordinary Computers Simulate Photonic Quantum Machines. Scienmag. https://scienmag.com/new-algorithm-lets-ordinary-computers-simulate-photonic-quantum-machines/
Katie Riggs. "New Algorithm Lets Ordinary Computers Simulate Photonic Quantum Machines." Scienmag, 14 October 2026, https://scienmag.com/new-algorithm-lets-ordinary-computers-simulate-photonic-quantum-machines/. Accessed 14 October 2026.
Katie Riggs. "New Algorithm Lets Ordinary Computers Simulate Photonic Quantum Machines." Scienmag. October 14, 2026. https://scienmag.com/new-algorithm-lets-ordinary-computers-simulate-photonic-quantum-machines/

