Related papers: Collective Neutrino Oscillations on a Quantum Comp…

Decays of heavier neutrino mass eigenstates into lighter ones, while very slow in the Standard Model, can be significantly enhanced in scenarios with more than three neutrino flavours, or in models with new ultra-light particles such as…

Hamiltonian diagonalization is at the heart of understanding physical properties and practical applications of quantum systems. It is highly desired to design quantum algorithms that can speedup Hamiltonian diagonalization, especially those…

Quantum simulations of electronic structure with a transformed Hamiltonian that includes some electron correlation effects are demonstrated. The transcorrelated Hamiltonian used in this work is efficiently constructed classically, at…

The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed…

We solve the model of N quantum Brownian oscillators linearly coupled to an environment of quantum oscillators at finite temperature, with no extra assumptions about the structure of the system-environment coupling. Using a compact…

Parity-time ($PT$)-symmetric Hamiltonians exhibit non-unitary dynamical evolution while maintaining real spectra, and offer unique approaches to quantum sensing and entanglement generation. Here we present a method for simulating the…

If a system of flavor-oscillating neutrinos is at high enough densities that neutrino-neutrino coherent forward scatterings are non-negligible, the system becomes a time-dependent many-body problem. An important and open question is whether…

The method of quantum Lanczos recursion is extended to solve for multiple excitations on the quantum computer. While quantum Lanczos recursion is in principle capable of obtaining excitations, the extension to a block Lanczos routine can…

On basis of effective interactions of charged lepton and hadron currents, we obtain an effective interacting Hamiltonian of neutrinos in nuclear media up to the leading order. Using this effective Hamiltonian, we study neutrino mixing and…

Variational algorithms have received significant attention in recent years due to their potential to solve practical problems using noisy intermediate-scale quantum (NISQ) devices. A fundamental step of these algorithms is the evaluation of…

We describe quantum behaviors of a simple harmonic oscillator, starting from the classical mechanics. By imposing two conditions on the phase points generated from a symplectic algorithm, we obtain discrete energy levels, satisfying $E_n…

Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…

One of the most severe bottlenecks to reach high-precision predictions in QFT is the calculation of multiloop multileg Feynman integrals. Several new strategies have been proposed in the last years, allowing impressive results with deep…

Neutrino oscillations are studied employing sources of low energy monoenergetic neutrinos following electron capture by the nucleus and measuring electron recoils. Since the neutrino energy is very low the oscillation length appearing in…

We establish a physically meaningful representation of a quantum energy density for use in Quantum Monte Carlo calculations. The energy density operator, defined in terms of Hamiltonian components and density operators, returns the correct…

A consistent description of the results of the neutrino oscillation experiments carried out so far can be obtained from three basic properties of neutrinos and the parameters of the Hamiltonian matrix. Using these basic neutrino properties,…

Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…

Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…

We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…

The coherent states that describe the classical motion of a mechanical oscillator do not have well-defined energy, but are rather quantum superpositions of equally-spaced energy eigenstates. Revealing this quantized structure is only…