Optimal universal and state-dependent quantum cloning
Physical Review A - Atomic, Molecular, and Optical Physics 57:4 (1998) 2368-2378
Abstract:
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. 漏 1998 The American Physical Society.Quantum algorithms revisited
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences 454:1969 (1998) 339-354
Abstract:
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. 漏 1998 The Royal Society.Quantum computation
Physics World 11:3 (1998) 47-52
Quantum computation: From the sequential approach to simulated annealing
International Journal of Theoretical Physics 37:1 (1998) 463-469
Abstract:
This is a brief outline of some essential features of quantum computation. We describe sequential quantum data processing and speculate on new modes of quantum computation such as quantum annealing.An overview of quantum computing
UNCONVENTIONAL MODELS OF COMPUTATION (1998) 19-44