Chiral oscillations in the non-relativistic regime

Massive Dirac particles are a superposition of left and right chiral components. Since chirality is not a conserved quantity, the free Dirac Hamiltonian evolution induces chiral quantum oscillations, a phenomenon related to the Zitterbewegung, the trembling motion of free propagating particles. While not observable for particles in relativistic dynamical regimes, chiral oscillations become relevant when the particle’s rest energy is comparable to its momentum. In this paper, we quantify the effect of chiral oscillations on the non-relativistic evolution of a particle state described as a Dirac bispinor and specialize our results to describe the interplay between chiral and flavor oscillations of non-relativistic neutrinos: we compute the time-averaged survival probability and observe an energy-dependent depletion of the quantity when compared to the standard oscillation formula. In the non-relativistic regime, this depletion due to chiral oscillations can be as large as 40$$\%$$ % . Finally, we discuss the relevance of chiral oscillations in upcoming experiments which will probe the cosmic neutrino background.

Efficient quantum algorithms for state measurement and linear algebra applications

We present an algorithm for measurement of [Formula: see text]-local operators in a quantum state, which scales logarithmically both in the system size and the output accuracy. The key ingredients of the algorithm are a digital representation of the quantum state, and a decomposition of the measurement operator in a basis of operators with known discrete spectra. We then show how this algorithm can be combined with (a) Hamiltonian evolution to make quantum simulations efficient, (b) the Newton–Raphson method based solution of matrix inverse to efficiently solve linear simultaneous equations, and (c) Chebyshev expansion of matrix exponentials to efficiently evaluate thermal expectation values. The general strategy may be useful in solving many other linear algebra problems efficiently.

Optimization of quantum Hamiltonian evolution: From two projection operators to local Hamiltonians

Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points and different series expansions. A choice among these possibilities can then be made to obtain the best computational complexity and control over errors. It is shown how a construction based on Grover's algorithm scales linearly in time and logarithmically in the error bound, and is exponentially superior in error complexity to the scheme based on the straightforward application of the Lie–Trotter formula. The strategy is then extended first to simulation of any Hamiltonian that is a linear combination of two projection operators, and then to any local efficiently computable Hamiltonian. The key feature is to construct an evolution in terms of the largest possible steps instead of taking small time steps. Reflection operations and Chebyshev expansions are used to efficiently control the total error on the overall evolution, without worrying about discretization errors for individual steps. We also use a digital implementation of quantum states that makes linear algebra operations rather simple to perform.