A Universal Two--Bit Gate for Quantum Computation

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.Comment: 3 pages, RevTeX, two figures in a uuencoded fil

Quantum Algorithms: Entanglement Enhanced Information Processing

We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the principles underlying the fast Fourier transform algorithm. We describe the implementation of the FFT algorithm for the group of integers modulo 2^n in the quantum context, showing how the group-theoretic formalism leads to the standard quantum network and identifying the property of entanglement that gives rise to the exponential speedup (compared to the classical FFT). Finally we outline the use of the Fourier transform in extracting periodicities, which underlies its utility in the known quantum algorithms.Comment: 17 pages latex, no figures. To appear in Phil. Trans. Roy. Soc. (Lond.) 1998, Proceedings of Royal Society Discussion Meeting ``Quantum Computation: Theory and Experiment'', held in November 199

Robustness of entangled states that are positive under partial transposition

We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust, in the sense, both inseparability and positivity are preserved under sufficiently small perturbations in its immediate neighborhood. Such unconditionally robust PPT entangled states lie inside an open PPT entangled ball. We construct examples of such balls whose radii are shown to be finite and can be explicitly calculated. This provides a lower bound on the volume of all PPT entangled states. Multipartite generalization of our constructions are also outlined.Comment: Published versio

Quantum Computers and Dissipation

We analyse dissipation in quantum computation and its destructive impact on efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum register of arbitrary length coupled with an environment of arbitrary coherence length. We discuss relations between decoherence and computational complexity and show that the quantum factorization algorithm must be modified in order to be regarded as efficient and realistic.Comment: 20 pages, Latex, 7 Postscript figure

Direct estimation of functionals of density operators by local operations and classical communication

We present a method of direct estimation of important properties of a shared bipartite quantum state, within the "distant laboratories" paradigm, using only local operations and classical communication. We apply this procedure to spectrum estimation of shared states, and locally implementable structural physical approximations to incompletely positive maps. This procedure can also be applied to the estimation of channel capacity and measures of entanglement

Optimal purification of single qubits

We introduce a new decomposition of the multiqubit states of the form $\rho^{\otimes N}$ and employ it to construct the optimal single qubit purification procedure. The same decomposition allows us to study optimal quantum cloning and state estimation of mixed states.Comment: 4 pages, 1 figur

Quantum cryptography based on qutrit Bell inequalities

We present a cryptographic protocol based upon entangled qutrit pairs. We analyze the scheme under a symmetric incoherent attack and plot the region for which the protocol is secure and compare this with the region of violations of certain Bell inequalities

Analysis and interpretation of high transverse entanglement in optical parametric down conversion

Quantum entanglement associated with transverse wave vectors of down conversion photons is investigated based on the Schmidt decomposition method. We show that transverse entanglement involves two variables: orbital angular momentum and transverse frequency. We show that in the monochromatic limit high values of entanglement are closely controlled by a single parameter resulting from the competition between (transverse) momentum conservation and longitudinal phase matching. We examine the features of the Schmidt eigenmodes, and indicate how entanglement can be enhanced by suitable mode selection methods.Comment: 4 pages, 4 figure

Geometric phases for mixed states in interferometry

We provide a physical prescription based on interferometry for introducing the total phase of a mixed state undergoing unitary evolution, which has been an elusive concept in the past. We define the parallel transport condition that provides a connection-form for obtaining the geometric phase for mixed states. The expression for the geometric phase for mixed state reduces to well known formulas in the pure state case when a system undergoes noncyclic and unitary quantum evolution.Comment: Two column, 4 pages, Latex file, No figures, Few change