Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an “entanglement purification” procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed.

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to different instances of quantum phase estimation. We provide an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision.

The optimal precision of frequency measurements in the presence of decoherence is discussed. We analyze different preparations of $n$ two-level systems as well as different measurement procedures. We show that standard Ramsey spectroscopy on uncorrelated atoms and optimal measurements on maximally entangled states provide the same resolution. The best resolution is achieved using partially entangled preparations with a high degree of symmetry.

We analyze the use of entangled states to perform quantum computations nonlocally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the concept of global cost. This parameter allows us to compare the use of physical resources in different schemes. We show that, for ideal channels and for a sufficiently large number of nodes, the use of maximally entangled states is advantageous over uncorrelated ones. For noisy channels, one has to use entanglement purification procedures in order to create entangled states of high fidelity. We show that under certain circumstances a quantum network supplied with a maximally entangled input still yields a smaller global cost, provided that n belongs to a given interval $n\in \left[n_{\min }{,n}_{\max }\right]$. The values of $n_{\min }$ and $n_{\max }$ crucially depend on the purification protocols used to establish the n processor entangled states, as well as on the presence of decoherence processes during the computation. The phase estimation problem has been used to illustrate this fact.

We establish the best possible approximation to a perfect quantum cloning machine that produces two clones out of a single input. We analyze both universal and state-dependent cloners. The maximal fidelity of cloning is shown to be 5/6 for universal cloners. It can be achieved either by a special unitary evolution or by a teleportation scheme. We construct the optimal state-dependent cloners operating on any prescribed two nonorthogonal states and discuss their fidelities and the use of auxiliary physical resources in the process of cloning. The optimal universal cloners permit us to derive an upper bound on the quantum capacity of the depolarizing quantum channel.

We study optimal eavesdropping in quantum cryptography with three-dimensional systems, and show that this scheme is more secure against symmetric attacks than protocols using two-dimensional states. We generalize the according eavesdropping transformation to arbitrary dimensions, and discuss the connection with optimal quantum cloning.