ﻻ يوجد ملخص باللغة العربية
Simple, controllable models play an important role to learn how to manipulate and control quantum resources. We focus here on quantum non-Markovianity and model the evolution of open quantum systems by quantum renewal processes. This class of quantum dynamics provides us with a phenomenological approach to characterise dynamics with a variety of non-Markovian behaviours, here described in terms of the trace distance between two reduced states. By adopting a trajectory picture for the open quantum system evolution, we analyse how non-Markovianity is influenced by the constituents defining the quantum renewal process, namely the time-continuous part of the dynamics, the type of jumps and the waiting time distributions. We focus not only on the mere value of the non-Markovianity measure, but also on how different features of the trace distance evolution are altered, including times and number of revivals.
We introduce a general construction of master equations with memory kernel whose solutions are given by completely positive trace preserving maps. These dynamics going beyond the Lindblad paradigm are obtained with reference to classical renewal proc
Understanding temporal processes and their correlations in time is of paramount importance for the development of near-term technologies that operate under realistic conditions. Capturing the complete multi-time statistics defining a stochastic proce
Here we deal in a pedagogical way with an approach to construct an algebraic structure for the Quantum Mechanical measurement processes from the concept of emph{Measurement Symbol}. Such concept was conceived by Julian S. Schwinger and constitutes a
We consider the dynamics of fluctuations in the quantum asymmetric simple exclusion process (Q-ASEP) with periodic boundary conditions. The Q-ASEP describes a chain of spinless fermions with random hoppings that are induced by a Markovian environment
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 significant