Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.34666

Neutrinos as Quantum Information Carriers? A Gap Analysis Against the DiVincenzo Criteria

Ramanuj Awasthi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Photons, trapped ions, neutral atoms, and superconducting circuits are all well-known quantum information platforms. Neutrinos offer a unique possibility, displaying quantum interference (flavour oscillation) over thousands of kilometres, yet interacting so weakly that they can travel through the Earth with minimal interaction. This short paper is a gap analysis. We use information from the existing literature to compare neutrinos to the seven DiVincenzo requirements. Firstly, there are five requirements to do with computation and secondly two requirements to do with communication. We analyse where the gaps are for each requirement. Overall, we find that neutrinos have high fidelity and good coherence; however, they do not have a clear qubit definition and initialisation. They do not have universal gates, individual qubit readout, or stationary-to-flying conversion, meaning they either fail or are very poor. Therefore, we think they are best considered as an exceptional flying information carrier; however, they are very difficult to control. We have outlined all of the gaps which can be used to inform future work.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramanuj Awasthi. 2026-10-26. Neutrinos as Quantum Information Carriers? A Gap Analysis Against the DiVincenzo Criteria. https://arxiv.org/abs/2610.34666

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Robust Preparation of Bell States by Time Boundary Effect

Quantum entanglement is essential for modern quantum information processing. Entanglement gates convert initially non-entangled states into entangled ones by applying time-dependent parametric pulses. While Bell state preparation has been experimentally validated in various platforms, its stability and fidelity are constrained by environmental decoherence and parametric fluctuations. Here, we propose a dynamically robust method for preparing Bell states by leveraging the time boundary effect and momentum-space projective measurements within Su-Schrieffer-Heeger systems. Employing the Lindblad master equation, we theoretically demonstrate that the prepared Bell states exhibit remarkable robustness against both environmental decoherence and parametric time fluctuations, achieving nearly perfect quantum fidelity, with the momentum conservation law governing this robust behavior. This framework based on the time boundary effect is applicable to both fermionic and bosonic excitations, offering a unified paradigm for generating Bell states in quantum computation and communication.

quant-ph↗
arXiv2026

Hamiltonian Chaos

Through semiclassical methods the subject of quantum chaos motivates and depends on Hamiltonian chaos research. Presented here is a selection of some of the most important Hamiltonian chaos topics that in this way get directly related to any of a variety of quantum chaos research problems. The overall emphasis is on intuitive explanations and illustrations of various ideas with the references containing more mathematically rigorous expositions. The chapter begins with a description of various useful theoretical and computational tools of chaos research, e.g.~surfaces of section, paradigms of chaos, stability analysis, and symbolic dynamics... This is followed by discussions regarding the geometry of chaos, how chaotic systems respond to perturbations, and the complexification of Hamiltonian dynamics. Most of the contents concern topics that are long established and well known by now. The exceptions involve complications that arise from the complexification of phase space variables and time. There are relatively recent results summarized regarding the appropriate branches of determinant phases and how to distinguish complex trajectories that are associated with classically allowed processes versus those associated with non-allowed ones.

quant-ph↗
arXiv2026

Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions

The linear combination of unitaries (LCU) is a fundamental quantum computing primitive used to embed non-unitary operators into larger systems via ancilla post-selection. In standard LCU implementations, only the zero-state ancilla outcome is retained, while all other measurement branches are discarded as unusable overhead. We study these discarded parts. Every computational-basis outcome of the ancilla projects the system onto a different linear combination of the target unitaries; collecting these outcome states in a matrix gives a factorization $Φ=CX$, where $C$ is determined by the ancilla preparation and the rows of $X$ are the states $U_t|ψ\rangle$, so that $rank(Φ)\le K$. Although this holds for any LCU circuit; to make the analysis easier, we use a simplified model circuit with Hadamard gates on the index register and a single rotation qubit in place of the coefficient preparation unitary, in which $C$ is explicit. The structure suggests two complementary applications: (i) in an explicit amplitude-access model, classical low-rank matrix completion can reconstruct the full output (including the target) from a subset of its amplitude entries, while computational basis counts provide intensities and generally require additional phase information for full complex recovery; (ii) treating $C$ as a secret key suggests a candidate quantum trapdoor function, whose security remains informal and depends on the difficulty of structured phase retrieval. The scheme thus turns the "junk" ancilla outcomes into a structured resource, possibly opening paths for further applications.

quant-ph↗