Inside an exploding star, neutrinos race so densely that they start to influence each other. Their quantum states become entangled, like threads in a tight ball where you can no longer tell which is which. Ordinary computers struggle with this task, as the number of possible states grows avalanche-like.
A quantum computer could handle it, but previous approaches wasted resources. They didn't account for the system's hidden order: swapping neutrinos around changes nothing. The authors proposed an algorithm that uses this symmetry, like a mail sorter that files letters by identical addresses.
The new method was tested both on a regular computer and on actual quantum hardware. The results matched and showed that fewer qubits suffice. This paves the way for simulating neutrino processes that are currently beyond even supercomputers.
as written by the authors arXiv:2604.07452
In dense neutrino gases, which exist for instance in supernovae, the flavour states of different neutrinos may become entangled with one another. The theoretical description of such systems may therefore call for simulations on a quantum computer. Existing quantum simulations of simple toy systems are not optimal in the sense that they do not fully exploit the symmetries of the system. Here, we propose a new class of qubit-efficient algorithms based on Dicke states and the $$su(2)$$ spin algebra. We demonstrate the excellent performance of these algorithms both on classical and on quantum hardware.
Neutrinos interact so weakly with matter that they can fly through a light-year of lead without hitting a single atom.
In Greg Egan's novel "Incandescence," neutrino streams play a key role in the lives of beings dwelling near a neutron star.