Related papers: Generating random quantum channels
In this paper the random channels and their compositions in the space of quantum states are studied. For compositions of i.i.d. random unitary channels, the limit behaviour of probability distributions is described. The sufficient condition…
We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. We define the measure of coherence generating power (CGP) for a generic quantum channel to be the average coherence generated by…
This paper is the first of a series where we study quantum channels from the random matrix point of view. We develop a graphical tool that allows us to compute the expected moments of the output of a random quantum channel. As an…
We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. Based on probabilistic averages, we define a measure of such coherence generating power (CGP) for a generic quantum channel, based…
The numerical generation of random quantum states (RQS) is an important procedure for investigations in quantum information science. Here we review some methods that may be used for performing that task. We start by presenting a simple…
The simplest building blocks for quantum computations are the qubit-qubit quantum channels. In this paper, we analyze the structure of these channels via their Choi representation. The restriction of a quantum channel to the space of…
Quantum channels describe the most general dynamics of open quantum systems. A quantum channel, as a linear map on vectorized quantum states, can be represented by a single matrix, whose spectrum is called the channel spectrum. Here we…
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output $p$-norm can be…
Using the recent ability of quantum computers to initialize quantum states rapidly with high fidelity, we use a function operating on a discrete set to create a simple class of quantum channels. Fixed points and periodic orbits, that are…
We show that a quantum channel $\mathcal{N}$ constructed by averaging over $\mathcal{O}(\log d/\epsilon^2)$ randomly chosen unitaries gives a local $\epsilon$-randomizing map with non-negative probability. The idea comes from a small…
We formulate the notion of quantum channels in the framework of quantum tomography and address there the issue of whether such maps can be regarded as classical stochastic maps. In particular kernels of maps acting on probability…
Quantum random number generation exploits inherent randomness of quantum mechanical processes and measurements. Real-time generation rate of quantum random numbers is usually limited by electronic bandwidth and data processing rates. Here…
Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…
The simplest building blocks for quantum computations are the qbit-qbit quantum channels. In this paper we analyse the structure of these channels via their Choi representation. The restriction of a quantum channel to the space of classical…
We examine stochastic maps in the context of quantum optics. Making use of the master equation, the damping basis, and the Bloch picture we calculate a non-unital, completely positive, trace-preserving map with unequal damping eigenvalues.…
The recently introduced random purification channel, which converts $n$ i.i.d. copies of any mixed quantum state into a uniform convex combination of $n$ i.i.d. copies of its purifications, has proved to be an extremely useful tool in…
Quantum random number generator harnesses the power of quantum mechanics to generate true random numbers, making it valuable for various scientific applications. However, real-world devices often suffer from imperfections that can undermine…
In this study, we generate quantum channels with random Kraus operators to typically obtain almost twirling quantum channels and quantum expanders. To prove the concentration phenomena, we use matrix Bernstein's inequality. In this way, our…
The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum…
The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this paper, we introduce natural probability distributions for covariant quantum channels.…