Tools

"... 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. ..."

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.

"... A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used ..."

A quantum error-correcting code is defined to be a unitary mapping (encoding) of k qubits (2-state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum error-correcting codes are shown to exist with asymptotic rate k/n = 1 − 2H2(2t/n) where H2(p) is the binary entropy function −p log2 p − (1 − p)log2(1 − p). Upper bounds on this asymptotic rate are given.

"... The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on s ..."

The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.

... starts with a binary linear code containing its dual Independently, Steane also discovered the existence of quantum codes [73] and the same construction [72]. At around the same time, Bennett et al. =-=[4]-=- discovered that two experimenters each holding one component of many noisy Einstein–Podolsky–Rosen (EPR) pairs could purify them using only a classical channel to obtain fewer nearly perfect EPR pair...

"... It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information i ..."

It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, making long computations impossible. A further difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1 / log c t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1 /t). We do this by showing that operations can be performed on quantum data encoded by quantum error-correcting codes without decoding this data. 1.

...In quantum teleportation [5], if two researchers share an EPR pair, they can use this pair and classical communication to &quot;teleport&quot; the quantum state of a particle from one researcher to an=-=other. In [6], a small -=-number of &quot;USDA&quot; pairs of qubits known to be in perfect EPR states can used to purify a set of noisy EPR states, sacrificing some of them but yielding a large set of good EPR pairs. This par...

"... If two separated observers are supplied with entanglement, in the form of n pairs of particles in identical partly-entangled pure states, one member of each pair being given to each observer; they can, by local actions of each observer, concentrate this entanglement into a smaller number of maximall ..."

If two separated observers are supplied with entanglement, in the form of n pairs of particles in identical partly-entangled pure states, one member of each pair being given to each observer; they can, by local actions of each observer, concentrate this entanglement into a smaller number of maximally-entangled pairs of particles, for example Einstein-Podolsky-Rosen singlets, similarly shared between the two observers. The concentration process asymptotically conserves entropy of entanglement—the von Neumann entropy of the partial density matrix seen by either observer—with the yield of singlets approaching, for large n, the base-2 entropy of entanglement of the initial partly-entangled pure state. Conversely, any pure or mixed entangled state of two systems can be produced by two classically-communicating separated observers, drawing on a supply of singlets as their sole source of entanglement. Recent results in quantum information theory have shed light on the channel resources needed for faithful transmission of quantum states, and the extent to which these resources

"... We survey the field of quantum information theory. In particular, we discuss the fundamentals of the field, source coding, quantum error-correcting codes, capacities of quantum channels, measures of entanglement, and quantum cryptography. ..."

We survey the field of quantum information theory. In particular, we discuss the fundamentals of the field, source coding, quantum error-correcting codes, capacities of quantum channels, measures of entanglement, and quantum cryptography.

"... This article presents a general discussion of several aspects of our present understanding of quantum mechanics. The emphasis is put on the very special correlations that this theory makes possible: they are forbidden by very general arguments based on realism and local causality. In fact, these cor ..."

This article presents a general discussion of several aspects of our present understanding of quantum mechanics. The emphasis is put on the very special correlations that this theory makes possible: they are forbidden by very general arguments based on realism and local causality. In fact, these correlations are completely impossible in any circumstance, except the very special situations designed by physicists especially to observe these purely quantum effects. Another general point that is emphasized is the necessity for the theory to predict the emergence of a single result in a single realization of an experiment. For this purpose, orthodox quantum mechanics introduces a special postulate: the reduction of the state vector, which comes in addition to the Schrödinger evolution postulate. Nevertheless, the presence in parallel of two evolution processes of the same object (the state vector) may be a potential source for conflicts; various attitudes that are possible

...ble to “purify” quantum states by combining several systems in perturbed entangled states and applying to them local operations, in order to extract a smaller number of systems in nonperturbed states =-=[127]-=-; one sometimes also speaks of “quantum distillation” in this context. This scheme applies in various situations, including quantum computation as well as communication or cryptography [128]. Similarl...

"... Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In th ..."

Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states.

...e only a classical key, however, the task is more difficult. We start with a simple approach: first distribute EPR pairs (which might get corrupted in transit), and then use entanglement purification =-=[5]-=- to establish clean pairs for teleportation. However, we do not need entanglement purification, which produces good EPR pairs even if the channel is noisy; instead we only need a purity testing protoc...

"... Abstract. We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that in a previous paper we have reduced the proof of the unconditionally security of this QKD protocol to a proof ..."

Abstract. We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that in a previous paper we have reduced the proof of the unconditionally security of this QKD protocol to a proof that a corresponding Quantum String Oblivious Transfer (String-QOT) protocol would be unconditionally secure against Bob if implemented on top of an unconditionally secure bit commitment scheme. We prove a lemma that extends a security proof given by Yao for a (one bit) QOT protocol to this String-QOT protocol. This result and the reduction mentioned above implies the unconditional security of our QKD protocol despite our previous proof that unconditionally secure bit commitment schemes are impossible. 1

...l. proposed another EPR-based protocol with a new element, an entanglement purification procedure also called in this context a quantum privacy amplification procedure [14]. Entanglement purification =-=[9]-=- allows Alice and Bob to generate, from any supply of pairs of photons with non-zero entanglement, a smaller set of maximally entangled EPR pairs whose entanglement with any outside system, including ...