Quantum computers can search arbitrarily large databases by a single query

This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database, can search a database in a single query (a query is defined as any question to the database to which the database has to return a (YES/NO) answer). A classical algorithm will be limited to the information theoretic bound of at least O(log N) queries (which it would achieve by using a binary search).Comment: Several enhancements to the original pape

When only two thirds of the entanglement can be distilled

We provide an example of distillable bipartite mixed state such that, even in the asymptotic limit, more pure-state entanglement is required to create it than can be distilled from it. Thus, we show that the irreversibility in the processes of formation and distillation of bipartite states, recently proved in [G. Vidal, J.I. Cirac, Phys. Rev. Lett. 86, (2001) 5803-5806], is not limited to bound-entangled states.Comment: 4 pages, revtex, 1 figur

Entanglement Swapping Chains for General Pure States

We consider entanglement swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalised Bell measurements with the result that the two end parties end up sharing a entangled state which can be converted into maximally entangled states. We obtain an expression for the average amount of maximal entanglement concentrated in such a scheme and show that in a certain reasonably broad class of cases this scheme is provably optimal and that, in these cases, the amount of entanglement concentrated between the two ends is equal to that which could be concentrated from the weakest link in the chain.Comment: 18 pages, 5 figure

Quantum Cryptography with Coherent States

The safety of a quantum key distribution system relies on the fact that any eavesdropping attempt on the quantum channel creates errors in the transmission. For a given error rate, the amount of information that may have leaked to the eavesdropper depends on both the particular system and the eavesdropping strategy. In this work, we discuss quantum cryptographic protocols based on the transmission of weak coherent states and present a new system, based on a symbiosis of two existing ones, and for which the information available to the eavesdropper is significantly reduced. This system is therefore safer than the two previous ones. We also suggest a possible experimental implementation.Comment: 20 pp. Revtex, Figures available from the authors upon request, To be published in PRA (March 95

Quantum secret sharing

Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original qubit.Comment: 6 pages, revtex, revised version, to appear in Phys. Rev.

Quantifying nonorthogonality

An exploratory approach to the possibility of analyzing nonorthogonality as a quantifiable property is presented. Three different measures for the nonorthogonality of pure states are introduced, and one of these measures is extended to single-particle density matrices using methods that are similar to recently introduced techniques for quantifying entanglement. Several interesting special cases are considered. It is pointed out that a measure of nonorthogonality can meaningfully be associated with a single mixed quantum state. It is then shown how nonorthogonality can be unlocked with classical information; this analysis reveals interesting inequalities and points to a number of connections between nonorthogonality and entanglement.Comment: Accepted for publication in Phys. Rev.

Compression Bases in Unital Groups

We study unital groups with a distinguished family of compressions called a compression base. A motivating example is the partially ordered additive group of a von Neumann algebra with all Naimark compressions as the compression base.Comment: 8 page

Photon-number-solving Decoy State Quantum Key Distribution

In this paper, a photon-number-resolving decoy state quantum key distribution scheme is presented based on recent experimental advancements. A new upper bound on the fraction of counts caused by multiphoton pulses is given. This upper bound is independent of intensity of the decoy source, so that both the signal pulses and the decoy pulses can be used to generate the raw key after verified the security of the communication. This upper bound is also the lower bound on the fraction of counts caused by multiphoton pulses as long as faint coherent sources and high lossy channels are used. We show that Eve's coherent multiphoton pulse (CMP) attack is more efficient than symmetric individual (SI) attack when quantum bit error rate is small, so that CMP attack should be considered to ensure the security of the final key. finally, optimal intensity of laser source is presented which provides 23.9 km increase in the transmission distance. 03.67.DdComment: This is a detailed and extended version of quant-ph/0504221. In this paper, a detailed discussion of photon-number-resolving QKD scheme is presented. Moreover, the detailed discussion of coherent multiphoton pulse attack (CMP) is presented. 2 figures and some discussions are added. A detailed cauculation of the "new" upper bound 'is presente