Noise robustness in the detection of non separable random unitary maps

We briefly review a recently proposed method to detect properties of quantum noise processes and quantum channels. We illustrate in detail the method for detecting non separable random unitary channels and consider in particular the explicit examples of the CNOT and CZ gates. We analyse their robustness in the presence of noise for several quantum noise models.Comment: 10 pages, 1 figur

Multipartite entanglement in quantum algorithms

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement

Multipartite entanglement in quantum algorithms

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement

On the entanglement structure in quantum cloning

We study the entanglement properties of the output state of a universal cloning machine. We analyse in particular bipartite and tripartite entanglement of the clones, and discuss the ``classical limit'' of infinitely many output copies.Comment: 7 pages, 1 figure, contribution to "David Mermin Festschrift", Foundations of Physic

Detection methods to rule out completely co-positive and bi-entangling operations

In this work we extend the quantum channel detection method developed in [Phys. Rev. A 88, 042335 (2013)] and [Phys. Script. T153, 014044 (2013)] in order to detect other interesting convex sets of quantum channels. First we work out a procedure to detect non completely co-positive maps. Then we focus on the set of so-called bi-entangling operations and show how a map outside this set can be revealed. In both cases we provide explicit examples showing the theoretical technique and the corresponding experimental procedure.Comment: 6 pages, 2 figure

Classical and quantum capacities of a fully correlated amplitude damping channel

We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We discuss the degradability properties of the channel and evaluate the quantum capacity for any value of the noise parameter. We finally compute the entanglement-assisted classical channel capacity.Comment: 16 pages, 9 figure

Information transmission over an amplitude damping channel with an arbitrary degree of memory

We study the performance of a partially correlated amplitude damping channel acting on two qubits. We derive lower bounds for the single-shot classical capacity by studying two kinds of quantum ensembles, one which allows to maximize the Holevo quantity for the memoryless channel and the other allowing the same task but for the full-memory channel. In these two cases, we also show the amount of entanglement which is involved in achieving the maximum of the Holevo quantity. For the single-shot quantum capacity we discuss both a lower and an upper bound, achieving a good estimate for high values of the channel transmissivity. We finally compute the entanglement-assisted classical channel capacity.Comment: 17 pages, 7 figure

Optimal cloning for two pairs of orthogonal states

We study the optimal cloning transformation for two pairs of orthogonal states of two-dimensional quantum systems, and derive the corresponding optimal fidelities.Comment: 4 pages, 3 figure

Entangled states maximize the two qubit channel capacity for some Pauli channels with memory

We prove that a general upper bound on the maximal mutual information of quantum channels is saturated in the case of Pauli channels with an arbitrary degree of memory. For a subset of such channels we explicitly identify the optimal signal states. We show analytically that for such a class of channels entangled states are indeed optimal above a given memory threshold. It is noteworthy that the resulting channel capacity is a non-differentiable function of the memory parameter.Comment: 4 pages no figure