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:2610.07159

Magnus: neutrino oscillation probabilities for any Hermitian Hamiltonian, any number of flavors, and any matter profile

Mauricio Bustamante

hep-phastro-ph.HEhep-exhep-thquant-phSubmitted Oct 5, 2026• Announced Oct 7, 2026
arXivHTMLPDF

Abstract

Interpreting neutrino oscillation measurements requires computing the probability that a neutrino born with one flavor is detected with another. In vacuum and in matter of constant density, this probability has exact formulas. Where the density varies along the path, as in the Earth, the Sun, or a supernova, it does not. There, the usual approaches either replace the profile by constant-density steps, whose error falls only as the square of their width, or integrate the evolution equation with a general-purpose solver, which must shorten its steps to meet a tighter tolerance. Both become slow at high accuracy, yet an analysis needs the probability at many energies, directions, and parameter values. Each new experiment or model often requires writing and validating a new solver. We present Magnus, an open-source Python code that avoids these limitations. It uses the Magnus expansion, whose error falls as a high power of its step width and whose cost is set by how fast the density varies, not by how many oscillations the path holds. Magnus accepts any density profile, any number of flavors, and any Hermitian Hamiltonian, such as those of non-standard interactions, sterile neutrinos, Lorentz-invariance violation, and pseudo-Dirac neutrinos. Where a cheaper route exists, it takes it automatically. For example, where the density varies slowly, as in the Sun, it follows the instantaneous eigenstates and applies the expansion only at resonances. Besides oscillating probabilities, Magnus returns phase-averaged ones, which describe solar and astrophysical neutrinos. A typical probability takes a few milliseconds, and batched scans are one to two orders of magnitude cheaper per point. Among the public codes we compared, Magnus is the fastest at high accuracy on a varying profile. Magnus shifts the effort of studying a new experiment or model from writing a solver to specifying its physics.

AI Summary

Computing neutrino flavor-transition probabilities through varying matter requires integrating a position-dependent Schrödinger equation, often repeatedly across parameter scans. This paper presents Magnus (`magnuspy`), an open-source Python package accepting an arbitrary Hermitian Hamiltonian and any number of flavors, with wrappers for standard oscillations and several beyond-standard-model scenarios. The numerical core composes unitary slab propagators built from established Magnus-expansion integrators. Gauss–Legendre schemes reach global orders $2,4,6,8$; a cumulative-quadrature implementation retains up to ten Magnus terms. Slab refinement compares successive probability matrices against requested tolerances, with boundaries aligned to declared discontinuities. Specialized routes include constant-Hamiltonian exponentiation, batched scans, and adiabatic eigenstate transport with Magnus patches around nonadiabatic crossings. The package also computes phase-averaged probabilities, retaining partially coherent interference under an approximate energy-resolution model. Validation against independent DOP853 integrations at two to five flavors gives probability differences of a few parts in $10^{12}$ on a smooth exponential profile. Benchmarks report millisecond-scale individual probabilities and one-to-two-order-of-magnitude reductions per point for batched scans. Among eight compared codes, Magnus is fastest at high accuracy on the tested varying Earth profiles; specialized codes remain cheaper at constant density or coarse accuracy. Hermiticity excludes decay, absorption, and open-system decoherence; nonlinear collective oscillations are also unsupported. Successive-grid agreement is not a rigorous error bound, and unresolved narrow features can evade convergence checks. Adiabatic certification has analogous limitations. Phase averaging freezes eigenvectors and linearizes energy-dependent phases; declared discontinuities instead trigger an energy-window average, a different observable.

Little sign of AI-generated textAI use disclosedOverclaims
the author used Claude for research assistance in code development, numerical auditing, workflow documentation, repository maintenance, and editorial revision.

Central claim may not hold: The abstract claims computational cost does not depend on the number of oscillations, but the general Magnus engine uses phase-dependent slab counts and the body explicitly acknowledges that its cost grows with accumulated phase. The abstract's high-power error scaling is conditional on sufficient smoothness within slabs, whereas an unresolved discontinuity can reduce convergence to approximately first order regardless of the selected Magnus order.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
92 pages, 43 figures, plus code listings and appendices. Full documentation: https://mbustama.github.io/Magnus/

Related papers

Neutrino oscillations as weight-preserving quantum circuits: what the qg symmetry filter reads, and what no oscillation circuit can see

Vicente Humberto Monteverde

A neutrino is produced and detected in a flavour state and propagates in mass states, so flavour oscillation is a rotation. We write it in the measurement-level units of the open-source library qang, where a qubit is described by qg_Z = <Z>, and place every flavour on its own qubit with a single excitation (the weight-1 sector). Every gate of the oscillation circuit then conserves the Hamming weight, and the qg symmetry filter (discard the shots that left the sector) applies. Six results follow, all on the noise models of IBM devices, each pre-registered and reported as passed or failed. (i) In vacuum qg_Z = cos²2θ + sin²2θ cos Δ is the spherical law of cosines, and at the oscillation maximum the mixing angle is a quarter of the qang angle arccos(qg_Z), with the θ-independent error bar 1/(4√(N+½)). (ii) Three flavours on three qubits: the filter cuts the error of the transition probabilities about 3× and the CP asymmetry at a DUNE-like baseline survives. (iii) Earth matter enters as a weight-preserving Trotter circuit, and matter fakes CP violation. (iv) In dense neutrino gases the conserved number is the number of ν₂, not the flavour number, so the filter applies in the mass basis (2.2-2.8×). (v) For solar neutrinos the phases are lost before detection, so the whole Sun is one rotation and the filter, though it works, is not needed. (vi) The mass ordering is read correctly through matter on three device models; Majorana phases change no oscillation probability, and the transpiler deletes them; a sterile neutrino is a fourth qubit in the weight-1 sector, where the filter cuts the error 5.5×. The link between neutrinos and qang is modelling, not new physics: the oscillation is a rotation, and qang reads rotations.

•Nov 5, 2026•0 citations

Magnus approximation for nonadiabatic transitions and neutrino oscillations in matter

J. C. D’Olivo

The Magnus expansion of the time-displacement operator is used to calculate nonadiabatic level crossing induced by a time-dependent Hamiltonian. We consider Hamiltonians that can be represented as a Hermitian 2\ifmmode\times\else\texttimes\fi{}2 matrix. As an interesting nontrivial application an analytic expression for the flavor survival probability is derived for neutrinos which propagate through a matter-enhanced oscillation region.

Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•Feb 1, 1992•19 citations

Quantum-circuit simulation of three-flavor neutrino oscillations: vacuum, matter, and CP diagnostics

Daming Li

We simulate three-flavor neutrino oscillations on two-qubit quantum circuits. The flavor space is embedded as $\ket{00}=ν_e$, $\ket{01}=ν_μ$, $\ket{10}=ν_τ$ with the $\ket{11}$ channel kept inert, and the input mixing parameters (NuFIT~5.3, normal ordering, with SK-atm) follow the global fit. We verify three physical settings against analytic or exact references: vacuum propagation, reproduced by a mass-eigenstate phase circuit to $\sim 10^{-16}$; constant-density Mikheev--Smirnov--Wolfenstein (MSW) matter effects, showing resonant flavor conversion when the matter potential $A$ crosses $Δm^2_{31}$; and varying-density (supernova shock-shell) propagation by slicing plus second-order Suzuki--Trotter splitting, with per-slice Trotter error $\sim 10^{-6}$ and total accuracy $\sim 10^{-4}$ against the continuous profile. We report a Suzuki--Trotter precision--resource calibration varying order, step number, and matrix/probability error. It delimits brute-force Trotterization on solar baselines: we quantify both standard alternatives, coherence averaging and adiabatic MSW. We also compute quantum-information diagnostics from the same model parameters, namely mode entanglement and the CP asymmetry. Finally, we extend the framework to open quantum systems via a Lindblad master equation with dephasing and absorptive channels. These results provide a reproducible link between low-energy oscillation observables and quantum-information measures.

quant-pharXiv:2609.30875•Sep 28, 2026•0 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

Quantum circuits for simulating neutrino propagation in matter

Sandeep Joshi, Garima Rajpoot, P. Shukla

Abstract Quantum simulation of particle phenomena is a rapidly advancing field of research. With the widespread availability of quantum simulators, a given quantum system can be simulated in numerous ways, offering flexibility in implementation and exploration. Here, we perform quantum simulation of neutrino propagation in matter, a phenomenon that plays a crucial role in neutrino oscillations. We present quantum circuits with novel gate arrangements to simulate neutrino propagation in both constant and varying matter density profiles. The oscillation probabilities are determined by encoding and measuring the qubit states in the neutrino flavor basis, showing excellent agreement with theoretical predictions.

arXiv:2503.20238•Physica Scripta•Jul 24, 2025•2 citations

Neutrino oscillations in discrete-time quantum walk framework

Arindam Mallick, Sanjoy Mandal, C. M. Chandrashekar

Here we present neutrino oscillation in the framework of quantum walks. Starting from a one spatial dimensional discrete-time quantum walk we present a scheme of evolutions that will simulate neutrino oscillation. The set of quantum walk parameters which is required to reproduce the oscillation probability profile obtained in both, long range and short range neutrino experiment is explicitly presented. Our scheme to simulate three-generation neutrino oscillation from quantum walk evolution operators can be physically realized in any low energy experimental set-up with access to control a single six-level system, a multiparticle three-qubit or a qubit–qutrit system. We also present the entanglement between spins and position space, during neutrino propagation that will quantify the wave function delocalization around instantaneous average position of the neutrino. This work will contribute towards understanding neutrino oscillation in the framework of the quantum information perspective.

arXiv:1604.04233•The European Physical Journal C•Feb 1, 2017•35 citations
Interpreting neutrino oscillation measurements requires computing the probability that a neutrino born with one flavor is detected with another. In vacuum and in matter of constant density, this probability has exact formulas. Where the density varies along the path, as in the Earth, the Sun, or a supernova, it does not. There, the usual approaches either replace the profile by constant-density steps, whose error falls only as the square of their width, or integrate the evolution equation with a general-purpose solver, which must shorten its steps to meet a tighter tolerance. Both become slow at high accuracy, yet an analysis needs the probability at many energies, directions, and parameter values. Each new experiment or model often requires writing and validating a new solver. We present Magnus, an open-source Python code that avoids these limitations. It uses the Magnus expansion, whose error falls as a high power of its step width and whose cost is set by how fast the density varies, not by how many oscillations the path holds. Magnus accepts any density profile, any number of flavors, and any Hermitian Hamiltonian, such as those of non-standard interactions, sterile neutrinos, Lorentz-invariance violation, and pseudo-Dirac neutrinos. Where a cheaper route exists, it takes it automatically. For example, where the density varies slowly, as in the Sun, it follows the instantaneous eigenstates and applies the expansion only at resonances. Besides oscillating probabilities, Magnus returns phase-averaged ones, which describe solar and astrophysical neutrinos. A typical probability takes a few milliseconds, and batched scans are one to two orders of magnitude cheaper per point. Among the public codes we compared, Magnus is the fastest at high accuracy on a varying profile. Magnus shifts the effort of studying a new experiment or model from writing a solver to specifying its physics.
Computing neutrino flavor-transition probabilities through varying matter requires integrating a position-dependent Schrödinger equation, often repeatedly across parameter scans. This paper presents Magnus (magnuspy), an open-source Python package accepting an arbitrary Hermitian Hamiltonian and any number of flavors, with wrappers for standard oscillations and several beyond-standard-model scenarios.
The numerical core composes unitary slab propagators built from established Magnus-expansion integrators. Gauss–Legendre schemes reach global orders 2,4,6,82,4,6,82,4,6,8; a cumulative-quadrature implementation retains up to ten Magnus terms. Slab refinement compares successive probability matrices against requested tolerances, with boundaries aligned to declared discontinuities. Specialized routes include constant-Hamiltonian exponentiation, batched scans, and adiabatic eigenstate transport with Magnus patches around nonadiabatic crossings. The package also computes phase-averaged probabilities, retaining partially coherent interference under an approximate energy-resolution model.
Validation against independent DOP853 integrations at two to five flavors gives probability differences of a few parts in 101210^{12}1012 on a smooth exponential profile. Benchmarks report millisecond-scale individual probabilities and one-to-two-order-of-magnitude reductions per point for batched scans. Among eight compared codes, Magnus is fastest at high accuracy on the tested varying Earth profiles; specialized codes remain cheaper at constant density or coarse accuracy.
Hermiticity excludes decay, absorption, and open-system decoherence; nonlinear collective oscillations are also unsupported. Successive-grid agreement is not a rigorous error bound, and unresolved narrow features can evade convergence checks. Adiabatic certification has analogous limitations. Phase averaging freezes eigenvectors and linearizes energy-dependent phases; declared discontinuities instead trigger an energy-window average, a different observable.
A neutrino is produced and detected in a flavour state and propagates in mass states, so flavour oscillation is a rotation. We write it in the measurement-level units of the open-source library qang, where a qubit is described by qg_Z = <Z>, and place every flavour on its own qubit with a single excitation (the weight-1 sector). Every gate of the oscillation circuit then conserves the Hamming weight, and the qg symmetry filter (discard the shots that left the sector) applies. Six results follow, all on the noise models of IBM devices, each pre-registered and reported as passed or failed. (i) In vacuum qg_Z = cos²2θ + sin²2θ cos Δ is the spherical law of cosines, and at the oscillation maximum the mixing angle is a quarter of the qang angle arccos(qg_Z), with the θ-independent error bar 1/(4√(N+½)). (ii) Three flavours on three qubits: the filter cuts the error of the transition probabilities about 3× and the CP asymmetry at a DUNE-like baseline survives. (iii) Earth matter enters as a weight-preserving Trotter circuit, and matter fakes CP violation. (iv) In dense neutrino gases the conserved number is the number of ν₂, not the flavour number, so the filter applies in the mass basis (2.2-2.8×). (v) For solar neutrinos the phases are lost before detection, so the whole Sun is one rotation and the filter, though it works, is not needed. (vi) The mass ordering is read correctly through matter on three device models; Majorana phases change no oscillation probability, and the transpiler deletes them; a sterile neutrino is a fourth qubit in the weight-1 sector, where the filter cuts the error 5.5×. The link between neutrinos and qang is modelling, not new physics: the oscillation is a rotation, and qang reads rotations.
We simulate three-flavor neutrino oscillations on two-qubit quantum circuits. The flavor space is embedded as ∣00⟩=νe\ket{00}=ν_e∣00⟩=νe​, ∣01⟩=νμ\ket{01}=ν_μ∣01⟩=νμ​, ∣10⟩=ντ\ket{10}=ν_τ∣10⟩=ντ​ with the ∣11⟩\ket{11}∣11⟩ channel kept inert, and the input mixing parameters (NuFIT~5.3, normal ordering, with SK-atm) follow the global fit. We verify three physical settings against analytic or exact references: vacuum propagation, reproduced by a mass-eigenstate phase circuit to ∼10−16\sim 10^{-16}∼10−16; constant-density Mikheev--Smirnov--Wolfenstein (MSW) matter effects, showing resonant flavor conversion when the matter potential AAA crosses Δm312Δm^2_{31}Δm312​; and varying-density (supernova shock-shell) propagation by slicing plus second-order Suzuki--Trotter splitting, with per-slice Trotter error ∼10−6\sim 10^{-6}∼10−6 and total accuracy ∼10−4\sim 10^{-4}∼10−4 against the continuous profile. We report a Suzuki--Trotter precision--resource calibration varying order, step number, and matrix/probability error. It delimits brute-force Trotterization on solar baselines: we quantify both standard alternatives, coherence averaging and adiabatic MSW. We also compute quantum-information diagnostics from the same model parameters, namely mode entanglement and the CP asymmetry. Finally, we extend the framework to open quantum systems via a Lindblad master equation with dephasing and absorptive channels. These results provide a reproducible link between low-energy oscillation observables and quantum-information measures.
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.
Abstract Quantum simulation of particle phenomena is a rapidly advancing field of research. With the widespread availability of quantum simulators, a given quantum system can be simulated in numerous ways, offering flexibility in implementation and exploration. Here, we perform quantum simulation of neutrino propagation in matter, a phenomenon that plays a crucial role in neutrino oscillations. We present quantum circuits with novel gate arrangements to simulate neutrino propagation in both constant and varying matter density profiles. The oscillation probabilities are determined by encoding and measuring the qubit states in the neutrino flavor basis, showing excellent agreement with theoretical predictions.
Here we present neutrino oscillation in the framework of quantum walks. Starting from a one spatial dimensional discrete-time quantum walk we present a scheme of evolutions that will simulate neutrino oscillation. The set of quantum walk parameters which is required to reproduce the oscillation probability profile obtained in both, long range and short range neutrino experiment is explicitly presented. Our scheme to simulate three-generation neutrino oscillation from quantum walk evolution operators can be physically realized in any low energy experimental set-up with access to control a single six-level system, a multiparticle three-qubit or a qubit–qutrit system. We also present the entanglement between spins and position space, during neutrino propagation that will quantify the wave function delocalization around instantaneous average position of the neutrino. This work will contribute towards understanding neutrino oscillation in the framework of the quantum information perspective.