Related papers: Three-flavor supernova neutrino simulation using a…
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized…
The flavor evolution of neutrinos in core collapse supernovae and neutron star mergers is a critically important unsolved problem in astrophysics. Following the electron flavor evolution of the neutrino system is essential for calculating…
The simulation of time evolution of large quantum systems is a classically challenging and in general intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation…
We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using…
Neutrinos in a core-collapse supernova undergo coherent flavor transformations in their own background. We explore this phenomenon during the cooling stage of the explosion. Our three-flavor calculations reveal qualitatively new effects…
We propose a hybrid quantum algorithm based on the Harrow-Hassidim-Lloyd (HHL) algorithm for solving a system of linear equations. In our hybrid scheme, a classical information feed-forward is required from the quantum phase estimation…
Two and three flavor oscillating neutrinos are shown to exhibit the properties bipartite and tripartite quantum entanglement. The two and three flavor neutrinos are mapped to qubit states used in quantum information theory. Such quantum…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a…
Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources by useful control schemes. In this paper, we develop an HQC algorithm using an efficient variational…
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from…
We examine neutrino evolution in astrophysical environments where the neutrino flux is very large, including core-collapse supernovae and neutron star mergers. In these environments, the neutrino-neutrino and neutrino-antineutrino…
We revisit the decoupling of neutrinos in the early universe with flavour oscillations. We rederive the quantum kinetic equations which determine the neutrino evolution based on a BBGKY-like hierarchy, and include for the first time the…
We propose a scheme to simulate the dynamics of neutrino oscillations using trapped ions. For neutrinos in 1+1 dimensions, our scheme is experimentally implementable with existing trapped ion technology. We show that the three generation…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
We present an efficient and precise framework to quantum simulate the dynamics of the ultra-relativistic quark-nucleus scattering. This framework employs the eigenbasis of the asymptotic scattering system and implements a compact scheme for…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and…
We present results of large-scale numerical simulations of the evolution of neutrino and antineutrino flavors in the region above the late-time post-supernova-explosion proto-neutron star. Our calculations are the first to allow explicit…
Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we…