Related papers: Three-flavor supernova neutrino simulation using a…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
Digital quantum computers promise exponential speedups in performing quantum time-evolution, providing an opportunity to simulate quantum dynamics of complex systems in physics and chemistry. However, the task of extracting desired quantum…
We experimentally study the two-dimensional Fermi-Hubbard model using a Rydberg-based quantum processing unit in the analog mode. Our approach avoids encoding directly the original fermions into qubits and instead relies on reformulating…
Quantum algorithms for molecular electronic structure have been developed with lower computational scaling than their classical counterparts, but emerging quantum hardware is far from being capable of the coherence,connectivity and gate…
We develop a hybrid semiclassical method to study the time evolution of one dimensional quantum systems in and out of equilibrium. Our method handles internal degrees of freedom completely quantum mechanically by a modified time evolving…
We discuss a new kind of astrophysical transport problem: the coherent evolution of neutrino flavor in core collapse supernovae. Solution of this problem requires a numerical approach which can simulate accurately the quantum mechanical…
We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons that avoids the boson-to-qubit mapping overhead encountered in qubit hardware. This framework gives exact…
At the present time even the most sophisticated, multi-dimensional simulations of core-collapse supernovae do not (self-consistently) include neutrino flavor transformation. This physics is missing despite the importance of neutrinos in the…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…
We simulate the evolution of three-node spin chain on the quantum processor of IBM Quantum Experience using the diagonalization of $XX$-Hamiltonian and representing the evolution operator in terms of CNOT operations and one-qubit rotations.…
We consider the quantum magic in systems of dense neutrinos undergoing coherent flavor transformations, relevant for supernova and neutron-star binary mergers. Mapping the three-flavor-neutrino system to qutrits, the evolution of quantum…
Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantially. Here, we demonstrate a hybrid framework that integrates…
Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation…
We discuss time dependent quantum systems on bounded domains. Our work may be viewed as a framework for several models, including linear iterations involved in time dependent density functional theory (TDDFT), the Hartree-Fock model, or…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
In light of recent exciting progress in building up quantum computing facilities based on both optical and cold-atom techniques, the algorithms for quantum simulations of particle-physics systems are in rapid progress. In this paper, we…
Neutrino and antineutrino fluxes from a core-collapse galactic supernova are studied, within a representative three-flavor scenario with inverted mass hierarchy and tiny 1-3 mixing. The initial flavor evolution is dominated by collective…
The quantum imaginary time evolution (QITE) algorithm is a direct implementation of the classical imaginary time evolution algorithm on quantum computer. We implement the QITE algorithm for the case of nuclear Hartree-Fock equations in a…
Using the open quantum system approach applied to the neutrino system, we derive three generations neutrino probability formulae considering the oscillation induced by mass plus quantum decoherence contributions. The introduction of these…