arXiv:2610.12334
Quantum Co-Design of Inhomogeneous Many-Body Neutrino Fast Flavor Transformation
Zoha Laraib, Sherwood Richers, Alessandro Baroni, Kathleen Hamilton, In-Saeng Suh
Abstract
Dense-neutrino flavor evolution is a quantum many-body problem whose fully correlated treatment becomes rapidly more expensive with increasing particle number and spatial structure. We develop a \texttt{QCNO} quantum simulation code that maps a inhomogeneous forward-scattering neutrino Hamiltonian with advection and finite-range interactions to TEBD2 product-formula quantum circuits, and connects ideal many-body simulation, backend-aware execution, and fault-tolerant resource estimation within the same physical model. We reproduce the exact many-body evolution of the suppressed mean-field-like transverse fast flavor instability through $N=30$ and show that even a single open-boundary interaction generates Rënyi entanglement and non-stabilizer magic, although noisy backends still produce polarization RMSEs of order $0.1$--$0.3$. The restricted active interaction graph of this problem allows us to estimate the circuit depth and $T$ gate cost through $N=50$ for both NISQ and fault-tolerant approaches. The measured TEBD2 error in our fiducial ideal simulation of order $10^{-3}$ motivates a synthesis tolerance $\varepsilon_{\rm syn}\sim10^{-7}$, corresponding to about $70$ $T$ gates per $R_Z$ rotation. The generated circuit contains $1.4\times10^4$ $T$ gates per qubit for open boundaries (twice that for closed boundaries), requiring an application-level logical-$T$ error target of order $10^{-7}$ for early fault-tolerant architectures.
AI Summary
The paper asks whether suppression of mean-field fast flavor instability persists in fully correlated, spatially inhomogeneous neutrino dynamics, and what quantum resources are needed to simulate it. It introduces QCNO, mapping a two-flavor, two-beam forward-scattering Hamiltonian with finite-range interactions, advection, and open or periodic boundaries to second-order product-formula circuits. Ideal statevector calculations extend earlier many-body benchmarks from $N=24$ to $N=30$. Mean-field evolution develops exponential transverse coherence, whereas correlated evolution loses longitudinal polarization without comparable transverse growth. At $N=6,8$, reduced-state Rényi entropies and global stabilizer Rényi magic show that a single open-boundary crossing generates entanglement and non-stabilizer structure, which plateau after separation. Backend comparisons combine ideal and noisy simulators with IBM hardware runs reaching $N=42$. Noisy polarization RMSEs are approximately $0.1$–$0.3$; at 1024 shots per basis, sampling is subdominant, and tested readout correction, routing optimization, and zero-noise extrapolation provide inconsistent improvement. Compiled gate counts grow approximately linearly with $N$ over the studied range. Resource estimates through $N=50$ use synthesis tolerance $10^{-7}$, about 70 $T$ gates per rotation, yielding roughly $1.4\times10^4$ $T$ gates per qubit for open boundaries and twice that for periodic boundaries. Limitations include the simplified physical model, no established large-$N$ limit or quantum advantage, and compiler-dependent finite-size scaling. Error matching extrapolates from small systems; the measured splitting error excludes time-discretization error from freezing advected couplings. Complete error-correction, factory, physical-qubit, and runtime estimates are not provided.
Central claim may not hold: The synthesis-error budget divides the rotation-error bound by N without justification and compares it with an unnormalized full-system propagator error, so the stated conservative tolerance matching does not follow. The logical-T reliability target uses the per-qubit T count instead of the total circuit count; at N=50 the quoted open-boundary workload requires approximately 1.4×10^-9 error per T gate for a total failure allowance of 10^-3. The production-circuit synthesis tolerance is extrapolated from smaller-system splitting errors measured at a different timestep and excluding Hamiltonian time-freezing error, rather than being validated against the production circuits' total numerical error.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 26 pages. 14 Figures. Applies to both the astrophysics and quantum computing field