Related papers: Operational Characterization of Divisibility of Dy…
Dynamics of many-qubit systems, that may correspond to computational processing with quantum systems, can be efficiently and generally approximated by a sequence of two- and single-qubit gates. In practical applications, however, a quantum…
$P$-divisibility is a central concept in both classical and quantum non-Markovian processes; in particular, it is strictly related to the notion of information backflow. When restricted to a fixed commutative algebra generated by a complete…
We provide further characterization of non-Markovian quantum dynamics based on the concept of divisible dynamical maps. In analogy to entanglement witness we propose a non-Markovianity witness and introduce the corresponding measure of…
We explore a notion of decomposably divisible (D-divisible) quantum evolution families, recently introduced in J. Phys. A: Math. Theor. 56, 485202 (2023). Both necessary and sufficient conditions are presented for highly-symmetric qubit and…
Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the…
Distinguishability is a fundamental and operational task generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and…
We have established a novel method to detect non-Markovian indivisible quantum channels using structural physical approximation. We have shown that this method can be used to detect eternal non -Markovian operations. We have further…
Recent work has identified nonlinear deterministic structure in neuronal dynamics using periodic orbit theory. Troublesome in this work were the significant periods of time where no periodic orbits were extracted - "dynamically dark"…
Established methods for characterizing quantum information processes do not capture non-Markovian (history-dependent) behaviors that occur in real systems. These methods model a quantum process as a fixed map on the state space of a…
In the classical domain, it is well-known that divisibility does not imply that a stochastic process is Markovian. However, for quantum processes, divisibility is often considered to be synonymous with Markovianity. We show that completely…
We study quantum processes, as one parameter families of differentiable completely positive and trace preserving (CPTP) maps. Using different representations of the generator, and the Sylvester criterion for positive semi-definite matrices,…
Entangling and disentangling capacities are the key manifestation of the nonlocal content of a quantum operation. A lot of effort has been put recently into investigating (dis)entangling capacities of unitary operations, but very little is…
The presence of a dissipative environment disrupts the unitary spectrum of dynamical quantum maps. Nevertheless, key features of the underlying unitary dynamics -- such as their integrable or chaotic nature -- are not immediately erased by…
Positive maps that are not decomposable are a key resource in entanglement theory because they can detect bound entangled states, yet systematic methods for constructing them remain limited. We introduce an optimization framework based on…
In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of…
Entanglement-breaking channels are quantum channels transforming entangled states to separable states. Despite a detailed discussion of their operational structure, to be found in the literature, studies on dynamical characteristics of this…
Dynamical A and B maps have been employed extensively by Sudarshan and co-workers to investigate open system evolution of quantum systems. A canonical structure of the A-map is introduced here. It is shown that this canonical A-map enables…
Intrinsic computation refers to how dynamical systems store, structure, and transform historical and spatial information. By graphing a measure of structural complexity against a measure of randomness, complexity-entropy diagrams display…
Memory effects in the dynamics of open systems have been the subject of significant interest in the last decades. The methods involved in quantifying this effect, however, are often difficult to compute and may lack analytical insight. With…
There are certain dynamics while being non-Markovian, do never exhibit information backflow. We show that if two such dynamical maps are considered in a scenario where the order of application of these two dynamical maps are not definite,…