Related papers: Quantum renewal processes
The intrinsic multivaluedness of interaction process, revealed in Part I of this series of papers, is interpreted as the origin of the true dynamical (in particular, quantum) chaos. The latter is causally deduced as unceasing series of…
With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In…
In the macroscopic world, time is intrinsically asymmetric, flowing in a specific direction, from past to future. However, the same is not necessarily true for quantum systems, as some quantum processes produce valid quantum evolutions…
We investigate the problem of simulating classical stochastic processes through quantum dynamics, and present three scenarios where memory or time quantum advantages arise. First, by introducing and analysing a quantum version of the…
Compared to quantum logic gates, quantum memory has received far less attention. Here, we explore the prognosis for a solid-state, scalable quantum dynamic random access memory (Q-DRAM), where the qubits are encoded by the spin orientations…
In statistical mechanics, it is well known that finite-state classical lattice models can be recast as quantum models, with distinct classical configurations identified with orthogonal basis states. This mapping makes classical statistical…
Third quantization is used in open quantum systems to construct a superoperator basis in which quadratic Lindbladians can be turned into a normal form. From it follows the spectral properties of the Lindbladian, including eigenvalues and…
In the last few years, there has been increasing interest in quantum processes with indefinite causal order. Process matrices are a convenient framework to study such processes. Ref. [1] defines higher order transformations from process…
We characterize good clocks, which are naturally subject to fluctuations, in statistical terms. We also obtain the master equation that governs the evolution of quantum systems according to these clocks and find its general solution. This…
Quantum information processing protocols are efficiently implemented on spin-$\frac{1}{2}$ networks. A quantum communication protocol generally involves a certain number of parties having local access to a subset of a larger system, whose…
Quantum operations represented by completely positive maps encompass many of the physical processes and have been very powerful in describing quantum computation and information processing tasks. We introduce the notion of relative phase…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
Semigroups describing the time evolution of open quantum systems in finite dimensional spaces have generators of a special form, known as Lindblad generators. The simple generators, characterized by only one operator, are analyzed. The…
Unital quantum channels, defined by their property of leaving the maximally mixed state invariant, form an important class of quantum operations. A distinguished subset of these channels can be represented as a probabilistic mixture of…
The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This motivates the general study of how physical principles bound computational power. In this paper we…
Many important results in modern quantum information theory have been obtained for an idealized situation when the spacetime dependence of quantum phenomena is neglected. However the transmission and processing of (quantum) information is a…
We formally extend the notion of Markov order to open quantum processes by accounting for the instruments used to probe the system of interest at different times. Our description recovers the classical Markov order property in the…
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…
Forgetfulness is a common feature of nature. Moreover, without forgetfulness, repeatability would be impossible. Despite this, small systems constantly leak information about their state to their surroundings, and quantum mechanics tells us…
We review the theory of regenerative processes, which are processes that can be intuitively seen as comprising of i.i.d.\ cycles. Although we focus on the classical definition, we present a more general definition that allows for some form…