ﻻ يوجد ملخص باللغة العربية
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 processes, so that they are termed quantum renewal processes. They can be described by means of semigroup dynamics interrupted by jumps, separated by independently distributed time intervals, following suitable waiting time distributions. In this framework, one can further introduce modified processes, in which the first few events follow different distributions. A crucial role, marking an important difference with respect to the classical case, is played by operator ordering. Indeed, for the same choice of basic quantum transformations, different quantum dynamics arise. In particular, for the case of modified processes, it is natural to consider the time inverted operator ordering, in which the last few events are distributed differently.
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
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 quantum (trajectories) filtering equation for the case when the system is driven by Bose field inputs prepared in an arbitrary non-zero mean Gaussian state. The a posteriori evolution of the system is conditioned by the results of a s
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