Implementation of quantum maps by programmable quantum processors

A quantum processor is a device with a data register and a program register. The input to the program register determines the operation, which is a completely positive linear map, that will be performed on the state in the data register. We develop a mathematical description for these devices, and apply it to several different examples of processors. The problem of finding a processor that will be able to implement a given set of mappings is also examined, and it is shown that while it is possible to design a finite processor to realize the phase-damping channel, it is not possible to do so for the amplitude-damping channel.Comment: 10 revtex pages, no figure

Quantum walks with random phase shifts

We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail the role of decoherence in quantum walks and to investigate the quantum-to-classical transition. We also provide classical analogues of the quantum random walks studied. Interestingly enough, it turns out that the classical counterparts of some quantum random walks are classical random walks with a memory and biased coin. In addition random phase shifts "simplify" the dynamics (the cross interference terms of different paths vanish on average) and enable us to give a compact formula for the dispersion of such walks.Comment: to appear in Phys. Rev. A (10 pages, 5 figures

Representation of entanglement by negative quasi-probabilities

Any bipartite quantum state has quasi-probability representations in terms of separable states. For entangled states these quasi-probabilities necessarily exhibit negativities. Based on the general structure of composite quantum states, one may reconstruct such quasi-propabilities from experimental data. Because of ambiguity, the quasi-probabilities obtained by the bare reconstruction are insufficient to identify entanglement. An optimization procedure is introduced to derive quasi-probabilities with a minimal amount of negativity. Negativities of optimized quasi-probabilities unambiguously prove entanglement, their positivity proves separability.Comment: 9 pages, 2 figures; An optimization procedure for the quasi-probabilities has been adde

Quantum interference with molecules: The role of internal states

Recent experiments have shown that fullerene and fluorofullerene molecules can produce interference patterns. These molecules have both rotational and vibrational degrees of freedom. This leads one to ask whether these internal motions can play a role in degrading the interference pattern. We study this by means of a simple model. Our molecule consists of two masses a fixed distance apart. It scatters from a potential with two or several peaks, thereby mimicking two or several slit interference. We find that in some parameter regimes the entanglement between the internal states and the translational degrees of freedom produced by the potential can decrease the visibility of the interference pattern. In particular, different internal states correspond to different outgoing wave vectors, so that if several internal states are excited, the total interference pattern will be the sum of a number of patterns, each with a different periodicity. The overall pattern is consequently smeared out. In the case of two different peaks, the scattering from the different peaks will excite different internal states so that the path the molecule takes become entangled with its internal state. This will also lead to degradation of the interference pattern. How these mechanisms might lead to the emergence of classical behavior is discussed.Comment: 12 pages, 4 eps figures, quality of figures reduced because of size restriction

Quantum copying: A network

We present a network consisting of quantum gates which produces two imperfect copies of an arbitrary qubit. The quality of the copies does not depend on the input qubit. We also show that for a restricted class of inputs it is possible to use a very similar network to produce three copies instead of two. For qubits in this class, the copy quality is again independent of the input and is the same as the quality of the copies produced by the two-copy network.Comment: 10 pages LaTeX, with 1 figure, submitted to the Physical Review

Optimal unambiguous filtering of a quantum state: An instance in mixed state discrimination

Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e. allow for inconclusive outcomes to occur, then unambiguous discrimination becomes possible with a certain probability of success. A variant of the problem is set discrimination: the states are grouped in sets and we want to determine to which particular set a given pure input state belongs. We consider here the simplest case, termed quantum state filtering, when the $N$ given non-orthogonal states, $\{|\psi_{1} >,..., |\psi_{N} > \}$, are divided into two sets and the first set consists of one state only while the second consists of all of the remaining states. We present the derivation of the optimal measurement strategy, in terms of a generalized measurement (POVM), to distinguish $|\psi_1>$ from the set $\{|\psi_2 >,...,|\psi_N > \}$ and the corresponding optimal success and failure probabilities. The results, but not the complete derivation, were presented previously [\prl {\bf 90}, 257901 (2003)] as the emphasis there was on appplication of the results to novel probabilistic quantum algorithms. We also show that the problem is equivalent to the discrimination of a pure state and an arbitrary mixed state.Comment: 8 page