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

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

Vicente Humberto Monteverde

Published Nov 5, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.23989992

Related papers

Symmetry-filtered read-out on IBM quantum devices: the qg filter on twenty device noise models through IBM Runtime

Vicente Humberto Monteverde

Circuits built from gates that conserve the Hamming weight keep their state in one weight sector, so the shots that left the sector can be discarded at read-out: the qg filter of the open-source library qang [1], a form of symmetry verification [2, 3]. We make it usable on IBM devices through IBM Runtime and Qiskit, and measure it on the noise models of twenty IBM devices. The library adds a Qiskit transpiler pass that decides whether the filter applies, read-out correction from each device's published per-qubit errors, qg read-outs of IBM Runtime Sampler and Estimator results, zero-noise extrapolation by gate folding that stacks with the filter, a prediction of the filter's kept fraction from the calibration, qubit selection with that prediction, a shot planner, and the weight-conserving quantum neural network (QNN) of qang as one parameterized job and as a qiskit-machine-learning SamplerQNN. Every prediction was committed before its run and is reported as passed or failed. On ten five-qubit weight-1 circuits the filter lowers the error of the measured qgZ = ⟨Z⟩ from 0.065-0.104 to 0.018-0.023 on three devices (0.013-0.022 with read-out correction), and filter plus zero-noise extrapolation reaches 0.011-0.015. On seventeen further devices never used before, the filter cuts the error 2.4-8.9× on every one (median 3.1× with read-out correction). Choosing the qubits by the predicted kept fraction keeps 6-17 points more shots than Qiskit's default layout on chain circuits, avoids a qubit published as reading 1 always, and the shot planner met a 0.02 target precision on three devices. For classification the gain is small: the QNN recovers 5-6 of the 10 decisions noise costs it. Reading a known five-component principal-component spectrum out of the data's density matrix in the weight-1 sector, filter plus read-out correction lowers the error 4.6× (median over twenty-one devices) and orders the spectrum correctly on 18 of 21 (13 raw). In Trotter simulation of the XY chain the filter halves the best error and moves the optimal number of Trotter steps deeper (16 of 21 devices), and in a quantum walk it turns a raw spreading indistinguishable from a classical random walk (exponent 0.87) into ballistic spreading (1.84). With two or three interacting excitations (XXZ chain) the gain falls from 5.6× to 2.6×: larger sectors let more of the noise through. Two interoperability bugs were found, one in qiskit-machine-learning and one in the library. All results are on device noise models; no hardware run is reported.

•Oct 13, 2026•0 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

Quantum gates and algorithms in qg units: Hamming-weight conservation and readout classes

Vicente Humberto Monteverde

We write fifteen standard quantum gates and fourteen standard quantum algorithms in qg units [1]. An -qubit state is described by its qg values, for every Pauli string , and a gate acts as . With this one rule each gate becomes a table of qg transformations and each algorithm a readout identity: which qg values hold the answer. The formulation is the Pauli (Heisenberg) representation and adds no new physics. It gives three practical classifications in the units used by the rest of the qang project: which gates conserve Hamming weight, and therefore admit the qg symmetry witness and filter; which algorithms are read out from a few qg values and which need the full outcome histogram; and where reading qg values is strictly worse than the standard readout. Three readout identities are, as far as we know, not stated in this form elsewhere: the per-qubit polar bias after Grover iterations, Simon’s secret as the unique non-trivial Z-parity equal to one, and quantum counting as a single . Every identity is checked numerically and pinned by tests in the open-source library qang (version 0.5.1, pip install qang), module qang.formulation.

•Oct 2, 2026•0 citations

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

Mauricio Bustamante

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.

hep-phCross-listedarXiv:2610.07159•Oct 7, 2026

Simulating three-flavor neutrino oscillations on a nuclear magnetic resonance quantum processor

Gayatri Singh, Kavita Dorai

Abstract Neutrino oscillations can be efficiently simulated on a quantum computer using the Pontecorvo-Maki-Nakagawa-Sakata (PMNS) theory in close analogy to the physical processes realized in experiments. We simulate three-flavor neutrino oscillations on a two-qubit NMR quantum information processor. The three-flavor neutrino states were encoded into the two-qubit system, leaving one redundant basis state (representing an unphysical sterile neutrino). The neutrino oscillations were experimentally simulated in different scenarios, including propagation in vacuum and through surrounding matter, and both with and without a CP violating phase δ at a Deep Underground Neutrino Experiment (DUNE) baseline distance of L = 1285 km. The oscillation probabilities were obtained after unitarily time evolving the initial flavor state and comparisons were performed between different scenarios. The interaction with matter is considered as a perturbation to the vacuum Hamiltonian, and the same quantum circuit is employed with an approximation of two mixing angles (θ 12 and θ 13) and mass eigenvalues. Our experimental results match well with numerical simulations and highlight the potential of quantum computers for exploring the physics of neutrino oscillations.

arXiv:2412.15617•Physica Scripta•Jul 10, 2025•7 citations

Training quantum neural networks for Tl-limited hardware: what the qg symmetry filter does and does not do

Vicente Humberto Monteverde

A quantum neural network (QNN) built from gates that conserve the Hamming weight keeps its data in one weight sector, so the shots that left the sector can be discarded at readout. This is the qg filter of the qang library [1, 2]. We show that, with equal amplitude damping (T1) on every qubit, the filtered readout of such a network is exactly the noiseless one in any weight sector. The kept fraction of shots is (1 − γ)k d for weight k and depth d, and training under T1 with the filter gives exactly the parameters of noiseless training. We then measure what this is worth on four small classification datasets. Every result is reported with the filter and without it, and every prediction was committed before its run, failures included. Over 60 runs per model, a network trained on a simulator and run under T1 gains +2.5 points from the filter at weight 1 (95% CI [0.8, 4.1]) and +16.5 points at weight 2 ([11.8, 21.2]), recovering its noiseless accuracy exactly. A network trained under the calibrated noise without the filter catches up (diflerences of 0.1 points), and the filter corrects neither dephasing nor unequal T1 across qubits, although alone it loses less than one point up to a ±80% spread of 1/T1. With noise-aware training and a richer readout, the model without the filter was 1.2 points better in one study, but over 60 new runs that gap shrank to +0.5 points and was not significant. The weight-2 deficit comes from the pair-product encoding, not from the readout; with an encoding that fills the whole sector and a full-rank readout, weight 2 reaches the weight-1 accuracy. On noise models of IBM and IonQ devices the filter cuts the error of the measured qgZ by 2.7-3.6×; on the IonQ Forte-1 noise model over 189 inputs of four datasets the filtered model is 1.1 points more accurate than the raw one, and calibrating the errors the filter keeps with five echo circuits per model halves the remaining error of the decision value: decisions that difler from the noiseless model fall from 15 (raw) and 7 (filter) to 3 over 945 readings on five device noise models. With a faithful weight-2 encoding the advantage of the unfiltered model under noise-aware training disappears, and a classifier given both the filtered and the raw features gains nothing over the filter alone. Over 513 readout configurations, including kept fractions down to 2.6×10−7, unequal T1 and dephasing, the filter has the lower readout error whenever about 20 shots are kept, and a closed-form rule predicts the winner. These models are classically simulable and no quantum advantage is claimed. The filter is a way to make noise-free training valid under relaxation, at a shot cost known in advance. The models are released as qang. qml (version 0.6.13, pip install qang).

•Oct 5, 2026•0 citations
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.
Circuits built from gates that conserve the Hamming weight keep their state in one weight sector, so the shots that left the sector can be discarded at read-out: the qg filter of the open-source library qang [1], a form of symmetry verification [2, 3]. We make it usable on IBM devices through IBM Runtime and Qiskit, and measure it on the noise models of twenty IBM devices. The library adds a Qiskit transpiler pass that decides whether the filter applies, read-out correction from each device's published per-qubit errors, qg read-outs of IBM Runtime Sampler and Estimator results, zero-noise extrapolation by gate folding that stacks with the filter, a prediction of the filter's kept fraction from the calibration, qubit selection with that prediction, a shot planner, and the weight-conserving quantum neural network (QNN) of qang as one parameterized job and as a qiskit-machine-learning SamplerQNN. Every prediction was committed before its run and is reported as passed or failed. On ten five-qubit weight-1 circuits the filter lowers the error of the measured qgZ = ⟨Z⟩ from 0.065-0.104 to 0.018-0.023 on three devices (0.013-0.022 with read-out correction), and filter plus zero-noise extrapolation reaches 0.011-0.015. On seventeen further devices never used before, the filter cuts the error 2.4-8.9× on every one (median 3.1× with read-out correction). Choosing the qubits by the predicted kept fraction keeps 6-17 points more shots than Qiskit's default layout on chain circuits, avoids a qubit published as reading 1 always, and the shot planner met a 0.02 target precision on three devices. For classification the gain is small: the QNN recovers 5-6 of the 10 decisions noise costs it. Reading a known five-component principal-component spectrum out of the data's density matrix in the weight-1 sector, filter plus read-out correction lowers the error 4.6× (median over twenty-one devices) and orders the spectrum correctly on 18 of 21 (13 raw). In Trotter simulation of the XY chain the filter halves the best error and moves the optimal number of Trotter steps deeper (16 of 21 devices), and in a quantum walk it turns a raw spreading indistinguishable from a classical random walk (exponent 0.87) into ballistic spreading (1.84). With two or three interacting excitations (XXZ chain) the gain falls from 5.6× to 2.6×: larger sectors let more of the noise through. Two interoperability bugs were found, one in qiskit-machine-learning and one in the library. All results are on device noise models; no hardware run is reported.
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.
We write fifteen standard quantum gates and fourteen standard quantum algorithms in qg units [1]. An -qubit state is described by its qg values, for every Pauli string , and a gate acts as . With this one rule each gate becomes a table of qg transformations and each algorithm a readout identity: which qg values hold the answer. The formulation is the Pauli (Heisenberg) representation and adds no new physics. It gives three practical classifications in the units used by the rest of the qang project: which gates conserve Hamming weight, and therefore admit the qg symmetry witness and filter; which algorithms are read out from a few qg values and which need the full outcome histogram; and where reading qg values is strictly worse than the standard readout. Three readout identities are, as far as we know, not stated in this form elsewhere: the per-qubit polar bias after Grover iterations, Simon’s secret as the unique non-trivial Z-parity equal to one, and quantum counting as a single . Every identity is checked numerically and pinned by tests in the open-source library qang (version 0.5.1, pip install qang), module qang.formulation.
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.
Abstract Neutrino oscillations can be efficiently simulated on a quantum computer using the Pontecorvo-Maki-Nakagawa-Sakata (PMNS) theory in close analogy to the physical processes realized in experiments. We simulate three-flavor neutrino oscillations on a two-qubit NMR quantum information processor. The three-flavor neutrino states were encoded into the two-qubit system, leaving one redundant basis state (representing an unphysical sterile neutrino). The neutrino oscillations were experimentally simulated in different scenarios, including propagation in vacuum and through surrounding matter, and both with and without a CP violating phase δ at a Deep Underground Neutrino Experiment (DUNE) baseline distance of L = 1285 km. The oscillation probabilities were obtained after unitarily time evolving the initial flavor state and comparisons were performed between different scenarios. The interaction with matter is considered as a perturbation to the vacuum Hamiltonian, and the same quantum circuit is employed with an approximation of two mixing angles (θ 12 and θ 13) and mass eigenvalues. Our experimental results match well with numerical simulations and highlight the potential of quantum computers for exploring the physics of neutrino oscillations.
A quantum neural network (QNN) built from gates that conserve the Hamming weight keeps its data in one weight sector, so the shots that left the sector can be discarded at readout. This is the qg filter of the qang library [1, 2]. We show that, with equal amplitude damping (T1) on every qubit, the filtered readout of such a network is exactly the noiseless one in any weight sector. The kept fraction of shots is (1 − γ)k d for weight k and depth d, and training under T1 with the filter gives exactly the parameters of noiseless training. We then measure what this is worth on four small classification datasets. Every result is reported with the filter and without it, and every prediction was committed before its run, failures included. Over 60 runs per model, a network trained on a simulator and run under T1 gains +2.5 points from the filter at weight 1 (95% CI [0.8, 4.1]) and +16.5 points at weight 2 ([11.8, 21.2]), recovering its noiseless accuracy exactly. A network trained under the calibrated noise without the filter catches up (diflerences of 0.1 points), and the filter corrects neither dephasing nor unequal T1 across qubits, although alone it loses less than one point up to a ±80% spread of 1/T1. With noise-aware training and a richer readout, the model without the filter was 1.2 points better in one study, but over 60 new runs that gap shrank to +0.5 points and was not significant. The weight-2 deficit comes from the pair-product encoding, not from the readout; with an encoding that fills the whole sector and a full-rank readout, weight 2 reaches the weight-1 accuracy. On noise models of IBM and IonQ devices the filter cuts the error of the measured qgZ by 2.7-3.6×; on the IonQ Forte-1 noise model over 189 inputs of four datasets the filtered model is 1.1 points more accurate than the raw one, and calibrating the errors the filter keeps with five echo circuits per model halves the remaining error of the decision value: decisions that difler from the noiseless model fall from 15 (raw) and 7 (filter) to 3 over 945 readings on five device noise models. With a faithful weight-2 encoding the advantage of the unfiltered model under noise-aware training disappears, and a classifier given both the filtered and the raw features gains nothing over the filter alone. Over 513 readout configurations, including kept fractions down to 2.6×10−7, unequal T1 and dephasing, the filter has the lower readout error whenever about 20 shots are kept, and a closed-form rule predicts the winner. These models are classically simulable and no quantum advantage is claimed. The filter is a way to make noise-free training valid under relaxation, at a shot cost known in advance. The models are released as qang. qml (version 0.6.13, pip install qang).