Imroatul Nasiyah
Physicists have utilized an ordinary computer, advanced mathematics, and specialized software to conquer a formidable quantum physics problem, one that had previously been deemed exclusively within the purview of quantum computers. This groundbreaking achievement, accomplished by researchers at the Center for Computational Quantum Physics (CCQ) at the Simons Foundation’s Flatiron Institute in collaboration with Boston University, demonstrates a significant leap in the capabilities of conventional computing. The innovative methodology developed by the team was so remarkably efficient that certain crucial calculations could be executed on a personal laptop, shattering previous assumptions about the limitations of classical machines. This breakthrough not only amplifies the computational power extractable from existing hardware but also promises to broaden the scope of quantum dynamics problems scientists can investigate. Furthermore, it offers a potent strategy for tackling complex optimization problems, where the goal is to identify the optimal solution from an immense array of possibilities. The findings of this pivotal research have been published in the esteemed journal Science.
The core challenge that the CCQ researchers confronted was the intricate modeling of hundreds of interacting ‘qubits.’ Qubits, the quantum mechanical counterparts to the bits used in classical computers, possess the unique ability to exist in a superposition of multiple states, unlike classical bits which are strictly confined to either a 0 or a 1. This inherent quantum property, while the source of quantum systems’ extraordinary capabilities, also renders their behavior exceedingly difficult to accurately replicate on classical computational architectures. The qubits in this particular study were meticulously arranged in various lattice structures, including square, cubic, and diamond configurations.
This research emerged in the wake of a March 2025 publication, also in Science, where another research group reported the successful use of a quantum computer to calculate the dynamics of an exceptionally complex qubit system. The authors of that study had posited that a classical computer would be incapable of matching their achievement. Joseph Tindall, an associate research scientist at the CCQ and the lead author of the new Science paper, expressed a degree of skepticism that is common within the CCQ community when confronted with such claims. "Whenever we [at the CCQ] see these kinds of claims, we’re always a bit skeptical," Tindall stated. "Like, ‘Did you try this? Did you try that?’" This inherent inquisitiveness and a drive to rigorously test the boundaries of their own methodologies presented the CCQ researchers with an ideal opportunity.
The problem at hand served as an invaluable testbed for their advanced techniques. Miles Stoudenmire, a co-author on the paper and a research scientist at the CCQ, described it as a chance to "take their tools out for a test drive." He elaborated, "We could have picked some more arbitrary target. But it was like ‘Why not pick this one that has a big claim attached to it?’" This deliberate choice to tackle a problem that had been explicitly identified as beyond classical reach underscored the team’s confidence in their novel approach.
A significant hurdle in simulating quantum systems is the phenomenon of quantum entanglement. Entanglement occurs when qubits become interconnected in such a way that their properties remain correlated, irrespective of the physical distance separating them. This interconnectedness prevents researchers from modeling each entangled qubit in isolation. Consequently, sophisticated algorithms are indispensable for describing the behavior of the entire entangled system as a unified whole.
Tindall explained the fundamental difficulty: "When you have lots of particles that interact by quantum physics, you have this wave function that describes the state of the system. It’s this huge object that rapidly gets bigger and bigger the more particles there are." The wave function encapsulates all the necessary information to fully describe a quantum system. However, its size grows exponentially with each additional particle. This exponential expansion of the wave function presents a recurring and formidable challenge in quantum physics, as its sheer magnitude quickly exceeds the memory capacity of even powerful classical computers. Nevertheless, such calculations are critically important for accurately predicting the behavior of quantum materials, including groundbreaking technologies like superconductors.
The researchers’ ingenious solution to this wave function scaling problem lay in the development and application of novel tools based on tensor networks. Tensor networks are sophisticated mathematical constructs designed to compress the vast amount of information contained within a wave function, rendering it manageable for classical computation. Tindall offered a vivid analogy: "a zip file for the wave function where you’ve taken all this information, and you’ve compressed it into this mathematical data structure full of these small tables of numbers that are interconnected to each other." This remarkable compression technique made the simulation of hundreds of interacting qubits feasible on conventional computing platforms. Tindall personally conducted many of the initial calculations on his laptop, leveraging ITensor, a high-performance tensor network software library developed at the CCQ.
These new simulations also highlight the ongoing evolution of ITensor’s capabilities, demonstrating how tensor techniques are being adapted to address new and increasingly complex problem domains. In this specific instance, the researchers successfully modeled three-dimensional quantum dynamics by employing a three-dimensional tensor network. "It’s this very powerful compression that can be very effective, but it’s a pretty complex mathematical object," Tindall acknowledged. "This really is a bit of a frontier, because working with these objects — especially in three dimensions — is very untrodden. You need sophisticated codes and algorithms to deal with them; it’s a software engineering challenge in itself." This pioneering work in three-dimensional tensor networks represents a significant advancement in the field.
The computational resources required for many of these simulations were surprisingly modest. For the early stages of the calculations, Tindall employed belief propagation, an algorithm originally developed in the 1980s that has recently been ingeniously adapted for quantum systems. Stoudenmire noted the practical advantages of this approach: "It’s a little more approximate than some of the other methods, but it’s way cheaper, and we can run it much more directly on lots of harder problems." He contrasted this with older, more resource-intensive methods that "wouldn’t be able to even start going for some of these three-dimensional problems, because they’re so big."
Despite the use of relatively modest hardware, the accuracy of the simulation results reached state-of-the-art levels. The generated solutions were in strong agreement with theoretical predictions and performed exceptionally well on smaller, benchmark problems where the correct answers were already known. Most importantly, the outcomes of the classical simulations precisely matched those previously obtained using a quantum computer, a feat achieved without the need for any quantum hardware.
This remarkable accomplishment contributes significantly to the ongoing discussion about the demarcation between classical and quantum computing capabilities, and where the threshold for "quantum advantage" truly lies. However, Tindall and Stoudenmire are keen to emphasize that these two fields are not in direct competition but rather possess a strong synergistic relationship. Classical simulations are instrumental in helping researchers understand the potential applications and limitations of quantum computers. Conversely, advancements in quantum hardware can serve as a powerful catalyst, inspiring the development of novel classical computational methods.
Tindall articulated this synergy: "The good side of the classical versus quantum computing debate is that there’s a lot of synergy between the kind of simulations we’re interested in and the codes we write and what can be realized on these quantum computers." He further elaborated on the mutual benefits: "That can help guide us, and it can also help guide quantum computing researchers, because, obviously, the barrier for entry for us to simulate certain things is a lot easier than for them, because we don’t have to build a quantum computer. I can just write some code and press ‘run’ on my personal computer." This accessibility allows for rapid iteration and exploration of quantum phenomena.
Looking ahead, the researchers are actively engaged in developing methodologies that extend beyond systems composed solely of qubits. Their next ambitious objective is to model electrons that have the capacity to move freely between different sites within a material. These systems present substantially greater simulation challenges but are directly relevant to achieving a deeper understanding of real-world quantum materials. "They’re really, quantitatively, a lot harder problems," Stoudenmire conceded. "So that’s one of our next big bars that we want to clear." This forward-looking research underscores the relentless pursuit of pushing the boundaries of computational physics and materials science.
