Quantum Computers Offer Faster Routes to Understanding Dense Matter

Zohreh Davoudi, University of Maryland, and colleagues, in collaboration with 2-8 November 2025 Tata Institute of Fundamental Research, investigate quantum simulation as a potential solution to longstanding challenges in computational particle and nuclear physics. Quantum-computing algorithms and hardware technology overcome the exponential scaling limitations currently hindering progress in areas like dense matter and general dynamical phenomena. The work builds upon the foundations of lattice field theory, offering polynomially efficient algorithms that address problems previously intractable for classical computation and advance our understanding of hadronic spectrum, structure, decays, and reactions.

Encoding quantum states for efficient particle interaction modelling

Quantum simulation utilises the principles of quantum mechanics to model complex physical systems, offering a fundamentally different approach to computation. Quantum computers employ qubits, unlike classical computers which store information as bits representing zero or one. These qubits leverage quantum superposition, allowing each to represent zero, one, or both simultaneously, dramatically increasing information density. This enhanced capacity is crucial because simulating matter’s behaviour at the subatomic level, such as within atomic nuclei, demands tracking an exponentially growing number of interactions.

Johannes Hauschild and colleagues are applying quantum simulation to overcome limitations in lattice field theory, a standard technique for modelling particle and nuclear physics. The technique circumvents computational limitations by encoding quantum states directly into the qubits, enabling calculations that scale polynomially, similar to a recipe that takes slightly longer with more servings. Several hardware platforms, including trapped ions and superconducting circuits, are currently under development to facilitate these simulations, with progress moving from a few-qubit operations to nontrivial simulations on tens of qubits. This approach provides polynomially efficient algorithms as an alternative to existing methods struggling with systems exhibiting exponential scaling of computational demands.

Quantum simulation overcomes factorial scaling in lattice field theory calculations

A decisive shift from exponential to polynomial scaling in computational algorithms for lattice field theory, a technique used to model subatomic particles, has been achieved. Previously, simulating systems with even a modest number of quarks was impossible due to the factorial increase in computational complexity. Quantum simulation now offers a pathway to model systems previously beyond reach, circumventing limitations imposed by the exponential scaling of computing time and space.

This advance is particularly relevant when investigating dense matter and changing phenomena within particle and nuclear physics. Atomic nuclei with a greater number of nucleons than previously possible can now be modelled. Investigations into dense matter and changing phenomena, previously hampered by exponential increases in computing demands, are becoming increasingly viable. This progress addresses longstanding challenges, such as the difficulty in isolating low-lying excitations in nuclei due to decreasing excitation gaps as atomic number increases. Furthermore, it offers potential for exploring finite-density phases of matter, where the fermion sign problem previously restricted reliable predictions about exotic phases and critical points. While these advances represent a strong step forward, they do not yet demonstrate practical simulations of complex systems or fully resolve the challenges of accessing real-time phenomena essential for understanding matter evolution.

Quantum computation advances modelling of ultra-dense matter and early universe physics

Scientists are now poised to investigate matter at densities and under changing conditions previously beyond reach, potentially unlocking secrets of neutron stars and the universe’s earliest moments. This ambitious program, however, rests on a vital, and as yet unproven, assumption: that quantum computers will deliver the anticipated performance gains. Translating theoretically more efficient algorithms into a demonstrable advantage over classical methods remains a significant hurdle, as current quantum hardware is still in its infancy, plagued by limitations in qubit number and coherence.

Despite acknowledged limitations in current quantum technology, pursuing these calculations remains important. Developing these algorithms and hardware co-designs builds expertise crucial for future breakthroughs, even if fully fault-tolerant quantum machines are years away. These calculations, vital for understanding neutron stars and the early universe, require advances in both quantum algorithms and hardware. Lattice field theory, a cornerstone of particle and nuclear physics, struggles with the computational demands of modelling dense matter.

Polynomially scaling algorithms for lattice field theory now exist, marking a decisive shift in computational approaches to particle and nuclear physics. This work overcomes limitations previously imposed by the exponential growth of computational demands when modelling dense matter and changing phenomena, opening new avenues for investigation. Consequently, scientists can now address fundamental questions regarding the behaviour of matter under extreme conditions, such as those found within neutron stars or immediately following the Big Bang. Further research will focus on refining these algorithms and exploring hybrid classical-quantum computations to fully realise their potential and probe the frontiers of our understanding.

Polynomially scaling algorithms now exist for lattice field theory, representing a significant advancement in computational particle and nuclear physics. This development addresses a longstanding limitation in modelling dense matter, which previously required exponentially increasing computing time and space. Consequently, researchers can now investigate fundamental questions about matter under extreme conditions, such as those present in neutron stars or the early universe. The authors intend to refine these algorithms and explore hybrid classical-quantum computations to further advance the field.