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

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

Quantum Cloning by Cellular Automata

We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations for improving the performance with given resources.Comment: 4 pages, 6 figures, 1 table, published versio

Quantum Hypergraph States

We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a generalised stabilizer formalism to describe this class of states. We introduce the notion of k-uniformity and show that this gives rise to classes of states which are inequivalent under the action of the local Pauli group. Finally we disclose a one-to-one correspondence with states employed in quantum algorithms, such as Deutsch-Jozsa's and Grover's.Comment: 9+5 pages, 5 figures, 1 table, published versio

Quantum channel detection

We present a method to detect properties of quantum channels, assuming that some a priori information about the form of the channel is available. The method is based on a correspondence with entanglement detection methods for multipartite density matrices based on witness operators. We first illustrate the method in the case of entanglement breaking channels and non separable random unitary channels, and show how it can be implemented experimentally by means of local measurements. We then study the detection of non separable maps and show that for pairs of systems of dimension higher than two the detection operators are not the same as in the random unitary case, highlighting a richer separability structure of quantum channels with respect to quantum states. Finally we consider the set of PPT maps, developing a technique to reveal NPT maps.Comment: 7 pages, 4 figures, published versio

On Quantum Algorithms

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.Comment: 15 pages, 8 figure

Equi-entangled bases in arbitrary dimensions

For the space of two identical systems of arbitrary dimensions, we introduce a continuous family of bases with the following properties: i) the bases are orthonormal, ii) in each basis, all the states have the same values of entanglement, and iii) they continuously interpolate between the product basis and the maximally entangled basis. The states thus constructed may find applications in many areas related to quantum information science including quantum cryptography, optimal Bell tests and investigation of enhancement of channel capacity due to entanglement.Comment: 10 pages, 2 figures, 1 table, Accepted for publication in Phys. Rev.

Superbroadcasting of mixed states

We derive the optimal universal broadcasting for mixed states of qubits. We show that the nobroadcasting theorem cannot be generalized to more than a single input copy. Moreover, for four or more input copies it is even possible to purify the input states while broadcasting. We name such purifying broadcasting superbroadcasting.Comment: 4 pages, 4 figures, to appear on Phys. Rev. Let

Experimental achievement of the entanglement assisted capacity for the depolarizing channel

We experimentally demonstrate the achievement of the entanglement assisted capacity for classical information transmission over a depolarizing channel. The implementation is based on the generation and local manipulation of 2-qubit Bell states, which are finally measured at the receiver by a complete Bell state analysis. The depolarizing channel is realized by introducing quantum noise in a controlled way on one of the two qubits. This work demonstrates the achievement of the maximum allowed amount of information that can be shared in the presence of noise and the highest reported value in the noiseless case.Comment: 4 pages, 3 figure