Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. Quantum Computation: 4. Quantum circuits 5. The quantum Fourier transform and its application 6. Quantum search algorithms 7. Quantum computers: physical realization Part III. Quantum Information: 8. Quantum noise and quantum operations 9. Distance measures for quantum information 10. Quantum error-correction 11. Entropy and information 12. Quantum information theory Appendices References Index.

Quantum Computation and Quantum Information

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

All our former experience with application of quantum theory seems to say:
{\it what is predicted by quantum formalism must occur in laboratory} But the
essence of quantum formalism - entanglement, recognized by Einstein, Podolsky,
Rosen and Schr\"odinger - waited over 70 years to enter to laboratories as a
new resource as real as energy This holistic property of compound quantum systems, which involves
nonclassical correlations between subsystems, is a potential for many quantum
processes, including ``canonical'' ones: quantum cryptography, quantum
teleportation and dense coding However, it appeared that this new resource is
very complex and difficult to detect Being usually fragile to environment, it
is robust against conceptual and mathematical tools, the task of which is to
decipher its rich structure This article reviews basic aspects of entanglement including its
characterization, detection, distillation and quantifying In particular, the
authors discuss various manifestations of entanglement via Bell inequalities,
entropic inequalities, entanglement witnesses, quantum cryptography and point
out some interrelations They also discuss a basic role of entanglement in
quantum communication within distant labs paradigm and stress some
peculiarities such as irreversibility of entanglement manipulations including
its extremal form - bound entanglement phenomenon A basic role of entanglement
witnesses in detection of entanglement is emphasized

Quantum entanglement

Quantum cryptography could well be the first application of quantum mechanics at the individual quanta level. The very fast progress in both theory and experiments over the recent years are reviewed, with emphasis on open questions and technological issues.

Quantum Cryptography

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.

Quantum algorithms revisited

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 controllednot and single-qubit operations, could be implemented using technology that is currently being developed. [S0031-9007(96)01288-4] Quantum cryptography [1 ‐ 3] allows two parties (traditionally known as Alice and Bob) to establish a secure random cryptographic key if, first, they have access to a quantum communication channel, and second, they can exchange classical public messages which can be monitored but not altered by an eavesdropper (Eve). Using such a key, a secure message of equal length can be transmitted over the classical channel. However, the security of quantum cryptography has so far been proved only for the idealized case where the quantum channel, in the absence of eavesdropping, is noiseless. That is because, under existing protocols, Alice and Bob detect eavesdropping by performing certain quantum measurements on transmitted batches of qubits and then using statistical tests to determine, with any desired degree of confidence, that the transmitted qubits are not entangled with any third system such as Eve. The problem is that there is in principle no way of distinguishing entanglement with an eavesdropper (caused by her measurements) from entanglement with the environment caused by innocent noise, some of which is presumably always present. This implies that all existing protocols are, strictly speaking, inoperable in the presence of noise, since they require the transmission of messages to be suspended whenever an eavesdropper (or, therefore, noise) is detected. Conversely, if we want a protocol that is secure in the presence of noise, we must find one that allows secure transmission to continue even in the presence of eavesdroppers. To this end, one might consider modifying the existing pro

https://arxiv.org/pdf/quant-ph/9604039.pdf

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels

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. [S0031-9007(97)04541-9] PACS numbers: 42.50.Ar, 03.65.Bz The rapid development of laser cooling and trapping techniques has opened up new perspectives in high precision spectroscopy. Frequency standards based on laser cooled ions are expected to achieve accuracies of the order of 1 part in 10 14 10 18 [1]. In this Letter we discuss the limits to the maximum precision achievable in the spectroscopy of n two-level atoms in the presence of decoherence. This question is particularly timely in view of current efforts to improve high precision spectroscopy by means of quantum entanglement. In the present context standard Ramsey spectroscopy refers to the situation schematically depicted in Fig. 1. An ion trap is loaded with n ions initially prepared in the same internal state j0l. A Ramsey pulse of frequency v is applied to all ions. The pulse shape and duration are carefully chosen so that it drives the atomic transition j0l $j 1 lof natural frequency v0 and prepares an equally weighted superposition of the two internal states j0l and j1l for each ion. Next the system evolves freely for a time t followed by the second Ramsey pulse. Finally, the internal state of each particle is measured. Provided that the duration of the Ramsey pulses is much smaller than the free evolution time t, the probability that an ion is found in j1l is given by

Improvement of frequency standards with quantum entanglement

Original article can be found at: http://prola.aps.org/ Copyright American Physical Society DOI : 10.1103/PhysRevA.59.4249

Distributed quantum computation over noisy channels

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.

/pdf/optimal-universal-and-state-dependent-quantum-cloning-3r1fp8ifun.pdf

Chiara Macchiavello

Papers

Quantum algorithms revisited

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels

Improvement of frequency standards with quantum entanglement

Distributed quantum computation over noisy channels

Optimal universal and state-dependent quantum cloning