Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.07452

Quantum Simulation of Collective Neutrino Oscillations using Dicke States

Katarina Bleau, Nikolina Ilic, Joachim Kopp, Ushak Rahaman, Xin Yue Yu

quant-phastro-ph.HEhep-phSubmitted Apr 8, 2026• Announced Apr 10, 2026• 4 citations
arXivHTMLPDF

Abstract

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.

Comments
13 pages, 13 figures

Related papers

Entanglement in Collective Neutrino Oscillations on a Quantum Computer

Katarina Bleau, Nikolina Ilic, Joachim Kopp +2 more

Simulations on a quantum computer have been propounded as a next-generation tool for studying neutrino flavour oscillations in dense environments like supernovae or neutron star mergers. However, quantum advantage hinges on the presence of quantum entanglement in the neutrino ensemble, and it has been argued that such entanglement becomes negligible in the limit of large neutrino number density. Here, we address this question by explicitly simulating the multiparticle dynamics of entangled neutrino ensembles with a varying number of particles, $N$, on both classical and quantum hardware, and comparing our results to those obtained with conventional ``mean-field'' methods based on Boltzmann-type kinetic equations. For simple toy systems, we demonstrate both analytically and numerically that, indeed, the predictions of full multiparticle simulations agree with those of mean-field methods in the large-$N$ limit. Along the way, we develop novel algorithms for the efficient simulation of entangled neutrino gases on both classical and quantum hardware. We then discuss physical situations in which an entangled neutrino system \emph{cannot} be described through mean-field dynamics alone and quantum entanglement therefore becomes phenomenologically relevant. We comment on the conditions under which these scenarios may be realized in supernova cores or neutron star mergers.

arXiv:2611.08595•Nov 5, 2026•1 citation

Qutrit and qubit circuits for three-flavor collective neutrino oscillations

Francesco Turro, Ivan A. Chernyshev, Ramya Bhaskar +1 more

We explore the utility of qutrits and qubits for simulating the flavor dynamics of dense neutrino systems. The evolution of such systems impacts some important astrophysical processes, such as core-collapse supernovae and the nucleosynthesis of heavy nuclei. Many-body simulations require classical resources beyond current computing capabilities for physically relevant system sizes. Quantum computers are therefore a promising candidate to efficiently simulate the many-body dynamics of collective neutrino oscillations. Previous quantum simulation efforts have primarily focused on properties of the two-flavor approximation due to their direct mapping to qubits. Here, we present new quantum circuits for simulating three-flavor neutrino systems on qutrit- and qubit-based platforms, and demonstrate their feasibility by simulating systems of two, four, and eight neutrinos on IBM and Quantinuum quantum computers.

arXiv:2407.13914•Physical review. D/Physical review. D.•Feb 18, 2025•32 citations

SIMULATING COLLECTIVE NEUTRINO OSCILLATIONS ON A QUANTUM COMPUTER

da Costa, David

Neutrinos are fascinating, elusive particles that play crucial roles in astrophysical environments such as dense stars, and the early universe, where they dominate energy transport and entropy. As neutral fermions in the Standard Model, neutrinos interact only weakly and exist in three flavors: electron, muon, and tau neutrinos. The discovery of neutrino flavor oscillation—a quantum phenomenon- reveals that neutrinos possess tiny mass, likely less than 0.2 eV. In dense environments, collective neutrino oscillations involving self-interactions emerge, complicating the numerics. However, these oscillations can be naturally simulated using quantum computers, by taking only two flavors as an isospin doublet leading to a spin model. In this review, we discuss the hybrid quantum-classical Lanczos (QLanczos) algorithm, which is used to find the eigenvalues of the collective neutrino Hamiltonian. This method uses the quantum imaginary-time evolution (QITE) to simulate the non-unitary imaginary-time evolution (ITE) of a quantum system using only unitary operations. Unlike variational algorithms that rely on a fixed ansatz, ITE always converges to the ground state. We also explore, as an altenative ITE, the probability ITE (PITE), in which an ancillary qubit is added to apply the ITE operator within an extended unitary. Once the ancilla is measured, the acted state collapses to the desired state. we also address the case with no mid-circuit measurements by employing quantum signal processing techniques.

•Mar 21, 2025•0 citations

Trapped-ion quantum simulation of collective neutrino oscillations

Valentina Amitrano, Alessandro Roggero, Piero Luchi +3 more

It is well known that the neutrino flavor in extreme astrophysical environments changes under the effect of three contributions: the vacuum oscillation, the interaction with the surrounding matter, and the collective oscillations due to interactions between different neutrinos. The latter adds a nonlinear contribution to the equations of motion, making the description of their dynamics complex. In this work we study various strategies to simulate the coherent collective oscillations of a system of $N$ neutrinos in the two-flavor approximation using quantum computation. This was achieved by using a pair-neutrino decomposition designed to account for the fact that the flavor Hamiltonian, in the presence of the neutrino-neutrino term, presents an all-to-all interaction that makes the implementation of the evolution dependent on the qubit topology. We analyze the Trotter error caused by the decomposition demonstrating that the complexity of the implementation of time evolution scales polynomially with the number of neutrinos and that the noise from near-term quantum device simulation can be reduced by optimizing the quantum circuit decomposition and exploiting a full-qubit connectivity. We find that the gate complexity using second order Trotter-Suzuki formulas scales better with system size than with other decomposition methods such as quantum signal processing. We finally present the application and the results of our algorithm on a real quantum device based on trapped-ion qubits.

arXiv:2207.03189•Physical review. D/Physical review. D.•Jan 13, 2023•58 citations

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

Pooja Siwach, Kaytlin Harrison, A. B. Balantekin

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates $U\ensuremath{\in}SU(4)$ in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. A more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

arXiv:2308.09123•Physical review. D/Physical review. D.•Oct 27, 2023•24 citations

Scalable qubit representations of neutrino mixing matrices

M. J. Molewski, B. J. P. Jones

Oscillating neutrino beams exhibit quantum coherence over distances of thousands of kilometers. Their unambiguously quantum nature suggests an appealing test system for direct quantum simulation. Such techniques may enable presently analytically intractable calculations involving multineutrino entanglements, such as collective neutrino oscillations in supernovas, but only once oscillation phenomenology is properly reexpressed in the language of quantum circuits. Here we resolve outstanding conceptual issues regarding encoding of arbitrarily mixed neutrino flavor states in the Hilbert space of an n-qubit quantum computer. We introduce algorithms to encode mixing and oscillation of any number of flavor-mixed neutrinos, both with and without $CP$-violation, with an efficient number of prescriptive input parameters in terms of subrotations of the Pontecorvo-Maki-Nakagawa-Sakata matrix in standard form. Examples encoded for an IBM-Q quantum computer are shown to converge to analytic predictions both with and without $CP$-violation.

arXiv:2111.05401•Physical review. D/Physical review. D.•Mar 29, 2022•16 citations
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)su(2)su(2) spin algebra. We demonstrate the excellent performance of these algorithms both on classical and on quantum hardware.
Simulations on a quantum computer have been propounded as a next-generation tool for studying neutrino flavour oscillations in dense environments like supernovae or neutron star mergers. However, quantum advantage hinges on the presence of quantum entanglement in the neutrino ensemble, and it has been argued that such entanglement becomes negligible in the limit of large neutrino number density. Here, we address this question by explicitly simulating the multiparticle dynamics of entangled neutrino ensembles with a varying number of particles, NNN, on both classical and quantum hardware, and comparing our results to those obtained with conventional ``mean-field'' methods based on Boltzmann-type kinetic equations. For simple toy systems, we demonstrate both analytically and numerically that, indeed, the predictions of full multiparticle simulations agree with those of mean-field methods in the large-NNN limit. Along the way, we develop novel algorithms for the efficient simulation of entangled neutrino gases on both classical and quantum hardware. We then discuss physical situations in which an entangled neutrino system \emph{cannot} be described through mean-field dynamics alone and quantum entanglement therefore becomes phenomenologically relevant. We comment on the conditions under which these scenarios may be realized in supernova cores or neutron star mergers.
We explore the utility of qutrits and qubits for simulating the flavor dynamics of dense neutrino systems. The evolution of such systems impacts some important astrophysical processes, such as core-collapse supernovae and the nucleosynthesis of heavy nuclei. Many-body simulations require classical resources beyond current computing capabilities for physically relevant system sizes. Quantum computers are therefore a promising candidate to efficiently simulate the many-body dynamics of collective neutrino oscillations. Previous quantum simulation efforts have primarily focused on properties of the two-flavor approximation due to their direct mapping to qubits. Here, we present new quantum circuits for simulating three-flavor neutrino systems on qutrit- and qubit-based platforms, and demonstrate their feasibility by simulating systems of two, four, and eight neutrinos on IBM and Quantinuum quantum computers.
Neutrinos are fascinating, elusive particles that play crucial roles in astrophysical environments such as dense stars, and the early universe, where they dominate energy transport and entropy. As neutral fermions in the Standard Model, neutrinos interact only weakly and exist in three flavors: electron, muon, and tau neutrinos. The discovery of neutrino flavor oscillation—a quantum phenomenon- reveals that neutrinos possess tiny mass, likely less than 0.2 eV. In dense environments, collective neutrino oscillations involving self-interactions emerge, complicating the numerics. However, these oscillations can be naturally simulated using quantum computers, by taking only two flavors as an isospin doublet leading to a spin model. In this review, we discuss the hybrid quantum-classical Lanczos (QLanczos) algorithm, which is used to find the eigenvalues of the collective neutrino Hamiltonian. This method uses the quantum imaginary-time evolution (QITE) to simulate the non-unitary imaginary-time evolution (ITE) of a quantum system using only unitary operations. Unlike variational algorithms that rely on a fixed ansatz, ITE always converges to the ground state. We also explore, as an altenative ITE, the probability ITE (PITE), in which an ancillary qubit is added to apply the ITE operator within an extended unitary. Once the ancilla is measured, the acted state collapses to the desired state. we also address the case with no mid-circuit measurements by employing quantum signal processing techniques.
It is well known that the neutrino flavor in extreme astrophysical environments changes under the effect of three contributions: the vacuum oscillation, the interaction with the surrounding matter, and the collective oscillations due to interactions between different neutrinos. The latter adds a nonlinear contribution to the equations of motion, making the description of their dynamics complex. In this work we study various strategies to simulate the coherent collective oscillations of a system of NNN neutrinos in the two-flavor approximation using quantum computation. This was achieved by using a pair-neutrino decomposition designed to account for the fact that the flavor Hamiltonian, in the presence of the neutrino-neutrino term, presents an all-to-all interaction that makes the implementation of the evolution dependent on the qubit topology. We analyze the Trotter error caused by the decomposition demonstrating that the complexity of the implementation of time evolution scales polynomially with the number of neutrinos and that the noise from near-term quantum device simulation can be reduced by optimizing the quantum circuit decomposition and exploiting a full-qubit connectivity. We find that the gate complexity using second order Trotter-Suzuki formulas scales better with system size than with other decomposition methods such as quantum signal processing. We finally present the application and the results of our algorithm on a real quantum device based on trapped-ion qubits.
We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates $U\ensuremath{\in}SU(4)$ in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. A more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.
Oscillating neutrino beams exhibit quantum coherence over distances of thousands of kilometers. Their unambiguously quantum nature suggests an appealing test system for direct quantum simulation. Such techniques may enable presently analytically intractable calculations involving multineutrino entanglements, such as collective neutrino oscillations in supernovas, but only once oscillation phenomenology is properly reexpressed in the language of quantum circuits. Here we resolve outstanding conceptual issues regarding encoding of arbitrarily mixed neutrino flavor states in the Hilbert space of an n-qubit quantum computer. We introduce algorithms to encode mixing and oscillation of any number of flavor-mixed neutrinos, both with and without CPCPCP-violation, with an efficient number of prescriptive input parameters in terms of subrotations of the Pontecorvo-Maki-Nakagawa-Sakata matrix in standard form. Examples encoded for an IBM-Q quantum computer are shown to converge to analytic predictions both with and without CPCPCP-violation.