Entanglement between an electron and a nuclear spin 1/2

We report on the preparation and detection of entangled states between an electron spin 1/2 and a nuclear spin 1/2 in a molecular single crystal. These were created by applying pulses at ESR (9.5 GHz) and NMR (28 MHz) frequencies. Entanglement was detected by using a special entanglement detector sequence based on a unitary back transformation including phase rotation.Comment: 4 pages, 3 figure

Passive decoy state quantum key distribution: Closing the gap to perfect sources

We propose a quantum key distribution scheme which closely matches the performance of a perfect single photon source. It nearly attains the physical upper bound in terms of key generation rate and maximally achievable distance. Our scheme relies on a practical setup based on a parametric downconversion source and present-day, non-ideal photon-number detection. Arbitrary experimental imperfections which lead to bit errors are included. We select decoy states by classical post-processing. This allows to improve the effective signal statistics and achievable distance.Comment: 4 pages, 3 figures. State preparation correcte

A deterministic cavity-QED source of polarization entangled photon pairs

We present two cavity quantum electrodynamics proposals that, sharing the same basic elements, allow for the deterministic generation of entangled photons pairs by means of a three-level atom successively coupled to two single longitudinal mode high-Q optical resonators presenting polarization degeneracy. In the faster proposal, the three-level atom yields a polarization entangled photon pair via two truncated Rabi oscillations, whereas in the adiabatic proposal a counterintuitive Stimulated Raman Adiabatic Passage process is considered. Although slower than the former process, this second method is very efficient and robust under fluctuations of the experimental parameters and, particularly interesting, almost completely insensitive to atomic decay.Comment: 5 pages, 5 figure

Quantum complexities of ordered searching, sorting, and element distinctness

We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of \frac{1}{\pi}(\ln(N)-1) accesses to the list elements for ordered searching, a lower bound of \Omega(N\log{N}) binary comparisons for sorting, and a lower bound of \Omega(\sqrt{N}\log{N}) binary comparisons for element distinctness. The previously best known lower bounds are {1/12}\log_2(N) - O(1) due to Ambainis, \Omega(N), and \Omega(\sqrt{N}), respectively. Our proofs are based on a weighted all-pairs inner product argument. In addition to our lower bound results, we give a quantum algorithm for ordered searching using roughly 0.631 \log_2(N) oracle accesses. Our algorithm uses a quantum routine for traversing through a binary search tree faster than classically, and it is of a nature very different from a faster algorithm due to Farhi, Goldstone, Gutmann, and Sipser.Comment: This new version contains new results. To appear at ICALP '01. Some of the results have previously been presented at QIP '01. This paper subsumes the papers quant-ph/0009091 and quant-ph/000903

Quantum state transfer and entanglement distribution among distant nodes in a quantum network

We propose a scheme to utilize photons for ideal quantum transmission between atoms located at spatially-separated nodes of a quantum network. The transmission protocol employs special laser pulses which excite an atom inside an optical cavity at the sending node so that its state is mapped into a time-symmetric photon wavepacket that will enter a cavity at the receiving node and be absorbed by an atom there with unit probability. Implementation of our scheme would enable reliable transfer or sharing of entanglement among spatially distant atoms.Comment: 4 pages, 3 postscript figure

Using of small-scale quantum computers in cryptography with many-qubit entangled states

We propose a new cryptographic protocol. It is suggested to encode information in ordinary binary form into many-qubit entangled states with the help of a quantum computer. A state of qubits (realized, e.g., with photons) is transmitted through a quantum channel to the addressee, who applies a quantum computer tuned to realize the inverse unitary transformation decoding of the message. Different ways of eavesdropping are considered, and an estimate of the time needed for determining the secret unitary transformation is given. It is shown that using even small quantum computers can serve as a basis for very efficient cryptographic protocols. For a suggested cryptographic protocol, the time scale on which communication can be considered secure is exponential in the number of qubits in the entangled states and in the number of gates used to construct the quantum network

Entangled photon pairs produced by a quantum dot strongly coupled to a microcavity

We show theoretically that entangled photon pairs can be produced on demand through the biexciton decay of a quantum dot strongly coupled to the modes of a photonic crystal. The strong coupling allows to tune the energy of the mixed exciton-photon (polariton) eigenmodes, and to overcome the natural splitting existing between the exciton states coupled with different linear polarizations of light. Polariton states are moreover well protected against dephasing due to their lifetime ten to hundred times shorter than that of a bare exciton. Our analysis shows that the scheme proposed can be achievable with the present technology

Quantum Cryptography Based on the Time--Energy Uncertainty Relation

A new cryptosystem based on the fundamental time--energy uncertainty relation is proposed. Such a cryptosystem can be implemented with both correlated photon pairs and single photon states.Comment: 5 pages, LaTex, no figure

Evolving rules for document classification

We describe a novel method for using Genetic Programming to create compact classification rules based on combinations of N-Grams (character strings). Genetic programs acquire fitness by producing rules that are effective classifiers in terms of precision and recall when evaluated against a set of training documents. We describe a set of functions and terminals and provide results from a classification task using the Reuters 21578 dataset. We also suggest that because the induced rules are meaningful to a human analyst they may have a number of other uses beyond classification and provide a basis for text mining applications

Geometry of the 3-Qubit State, Entanglement and Division Algebras

We present a generalization to 3-qubits of the standard Bloch sphere representation for a single qubit and of the 7-dimensional sphere representation for 2 qubits presented in Mosseri {\it et al.}\cite{Mosseri2001}. The Hilbert space of the 3-qubit system is the 15-dimensional sphere $S^{15}$, which allows for a natural (last) Hopf fibration with $S^8$ as base and $S^7$ as fiber. A striking feature is, as in the case of 1 and 2 qubits, that the map is entanglement sensitive, and the two distinct ways of un-entangling 3 qubits are naturally related to the Hopf map. We define a quantity that measures the degree of entanglement of the 3-qubit state. Conjectures on the possibility to generalize the construction for higher qubit states are also discussed.Comment: 12 pages, 2 figures, final versio