Related papers: Unification of stochastic matrices and quantum ope…
Optimal quantum machines can be implemented by linear projective operations. In the present work a general qubit symmetrization theory is presented by investigating the close links to the qubit purification process and to the programmable…
A large class of non-Markovian quantum processes in open systems can be formulated through time-local master equations which are not in Lindblad form. It is shown that such processes can be embedded in a Markovian dynamics which involves a…
We introduce a necessary and sufficient criterion for the non-Markovianity of Gaussian quantum dynamical maps based on the violation of divisibility. The criterion is derived by defining a general vectorial representation of the covariance…
It is well known that the state operator of an open quantum system can be generically represented as the solution of a time-local equation -- a quantum master equation. Unraveling in quantum trajectories offers a picture of open system…
We consider ontological models of a quantum system, assuming that not all probability distributions over the space $\Lambda$ of ontic states are preparable, only those belonging to a certain set C. We assume further that every POVM with a…
In classical stochastic theory, the joint probability distributions of a stochastic process obey by definition the Kolmogorov consistency conditions. Interpreting such a process as a sequence of physical measurements with probabilistic…
We study gradient drift-diffusion processes on a probability simplex set with finite state Wasserstein metrics, namely finite state Wasserstein common noises. A fact is that the Kolmogorov transition equation of finite reversible Markov…
One-way functions are fundamental to classical cryptography and their existence remains a longstanding problem in computational complexity theory. Recently, a provable quantum one-way function has been identified, which maintains its…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration $\langle p, \varrho\rangle$, but we…
We consider fragmentation processes with values in the space of marked partitions of $\mathbb{N}$, i.e. partitions where each block is decorated with a nonnegative real number. Assuming that the marks on distinct blocks evolve as…
We develop a fundamental framework for the quantum mechanics of stochastic systems (QMSS), showing that classical discrete stochastic processes emerge naturally as perturbations of the quantum harmonic oscillator (QHO). By constructing…
We generalise the Gaussian formalism of Continuous Variable (CV) systems to describe their interactions with qubits/qudits that result in quantum superpositions of Gaussian processes. To this end, we derive a new set of equations in closed…
Determining the Markovianity and non-Markovianity of a quantum process is a critical problem in the theory of open quantum systems, as their behaviors differ significantly in terms of complexity. It is well recognized that a quantum process…
Jarzynski equality and related fluctuation theorems can be formulated for various setups. Such an equality was recently derived for nonunitary quantum evolutions described by unital quantum operations, i.e., for completely positive,…
It is well-known in quantum information theory that a positive operator valued measure (POVM) is the most general kind of quantum measurement. Mathematically, a quantum probability is a normalised POVM, namely a function on certain subsets…
A time-dependent finite-state Markov chain that uses doubly stochastic transition matrices, is considered. Entropic quantities that describe the randomness of the probability vectors, and also the randomness of the discrete paths, are…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice,…
We enhance the standard formalism of quantum theory to enable events. The concepts of experiment and of measurement are defined. Dynamics is given by Liouville's equation that couples quantum system to a classical one. It implies a unique…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…