Quantum memory is important to quantum information processing in many ways: a synchronization device to match various processes within a quantum computer, an identity quantum gate that leaves any state unchanged, and a tool to convert heralded photons to photons-on-demand. In addition to quantum computing, quantum memory would be instrumental for the implementation of long-distance quantum communication using quantum repeaters. The importance of this basic quantum gate is exemplified by the multitude of optical quantum memory mechanisms being studied: optical delay lines, cavities, electromagnetically-induced transparency, photon-echo, and off-resonant Faraday interaction. Here we report on the state-of-the-art in the field of optical quantum memory, including criteria for successful quantum memory and current performance levels.

The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes can be totally insecure. We provide a thorough investigation of security issues for practical quantum key distribution, taking into account channel losses, a realistic detection process, and modifications of the "qubits" sent from the sender to the receiver. We first show that even quantum key distribution with perfect qubits cannot be achieved over long distances when fixed channel losses and fixed dark count errors are taken into account. Then we show that existing experimental schemes (based on "weak-pulse") are usually totally insecure. Finally we show that parametric downconversion offers enhanced performance compared to its weak coherent pulse counterpart.Pacs: 03.67. Dd, 42.50.Dv, 03.65.Bz, 89.80.+h Quantum information theory suggests the possibility of accomplishing tasks which are beyond the capability of classical computer science, such as information-secure cryptographic key distribution [1,2]. The lack of security proofs for standard (secret-and public-) key distribution schemes, and the insecurity of the strongest classical schemes against "quantum attacks" [3], emphasizes the need for information-secure key distribution. Whereas the security of idealized quantum key distribution (qkd) schemes has been investigated against very sophisticated collective and joint attacks (e.g., [4,5]), the experimental qkd schemes have been proven secure against the simple individual attack only recently [6] (via the application of ideas presented here).In the four-state scheme [1], usually referred to as Bennett-Brassard-84 (BB84), the sender (Alice) and the receiver (Bob) use two conjugate bases (say, the rectilinear basis, +, and the diagonal basis, ×) for the polarization of single photons. In basis + they use the two orthogonal basis states |0 + and |1 + to represent "0" and "1" respectively. In basis × they use the two orthogonal basis states2)[|0 + − |1 + ] to represent "0" and "1". The basis is revealed later on via an unjammable and insecure classical channel. The signals where Bob used the same basis as Alice form the sifted key on which Bob can decode the bit value. The remaining signals are being discarded. Finally, they test a few bits to estimate the error-rate, and if the test passes (the tested error-rate is less than some pre-agreed threshold), they use errorcorrection and privacy amplification to obtain a potentially secure final key [7,8].The security of that scheme, which assumes a source of perfect qubits as well as losses and errors which are bounded by some small threshold, has been investigated in various works. Very simple attacks already render realistic qkd impossible, as we show here.The experiments are usually based on weak coherent pulses (wcp) as signal states with a low probability of containing more than one photon [7,9]. Initial security analysis of such weak-pulse schemes were done [7,10], and evidence of some potentia...

We present an efficient quantum algorithm for simulating the evolution of a sparse Hamiltonian H for a given time t in terms of a procedure for computing the matrix entries of H. In particular, when H acts on n qubits, has at most a constant number of nonzero entries in each row/column, and H is bounded by a constant, we may select any positive integer k such that the simulation requires O((log * n)t 1+1/2k ) accesses to matrix entries of H. We show that the temporal scaling cannot be significantly improved beyond this, because sublinear time scaling is not possible.

Photon-mediated interactions between atoms are of fundamental importance in quantum optics, quantum simulations, and quantum information processing. The exchange of real and virtual photons between atoms gives rise to nontrivial interactions, the strength of which decreases rapidly with distance in three dimensions. Here, we use two superconducting qubits in an open one-dimensional transmission line to study much stronger photon-mediated interactions. Making use of the possibility to tune these qubits by more than a quarter of their transition frequency, we observe both coherent exchange interactions at an effective separation of 3λ/4 and the creation of super- and subradiant states at a separation of one photon wavelength λ. In this system, collective atom-photon interactions and applications in quantum communication may be explored.