Searcharxiv⌕ Search

arXiv · quant-ph/0305162

Generation of Nonclassical Photon Pairs for Scalable Quantum Communication with Atomic Ensembles

Abstract

Quantum information science attempts to exploit capabilities from the quantum realm to accomplish tasks that are otherwise impossible in the classical domain [1]. Although sufficient conditions have been formulated for the physical resources required to achieve quantum computation and communication [2], there is an evolving understanding of the power of quantum measurement combined with conditional evolution for accomplishing diverse tasks in quantum information science [3-5]. In this regard, a significant advance is the invention of a protocol by Duan, Lukin, Cirac, and Zoller (DLCZ) [6] for the realization of scalable long distance quantum communication and the distribution of entanglement over quantum networks. Here, we report the first enabling step in the realization of the protocol of DLCZ, namely the observation of quantum correlations for photon pairs generated in the collective emission from an atomic ensemble. The nonclassical character of the fields is evidenced by the violation of a Cauchy-Schwarz inequality for the two fields (1,2). As compared to prior investigations of nonclassical correlations for photon pairs produced in atomic cascades [7] and in parametric down conversion [8], our experiment is distinct in that the correlated (1,2) photons are separated by a programmable time interval delta t, with delta t ~ 400 nsec in our initial experiments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Kuzmich, W. P. Bowen, A. D. Boozer, A. Boca, C. W. Chou, L. -M. Duan, H. J. Kimble. 2003-05-27. Generation of Nonclassical Photon Pairs for Scalable Quantum Communication with Atomic Ensembles. https://doi.org/10.1038/nature01714

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A quantum central path algorithm for linear optimization

We propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a simulation working directly with the nonlinear complementarity equations. Using a two-stage quantum eigenpath traversal schedule, this approach yields an algorithm for solving linear optimization problems involving $m$ constraints and $n$ variables to $\varepsilon$-optimality using $\widetilde{O}\!\left((m+n)^{3/2}\,\varepsilon^{-1}+(m+n)^{1/2}\,\varepsilon^{-3/2}\right)$ queries to an oracle that evaluates a potential function. In the standard gate model (i.e., without access to quantum RAM), our algorithm can obtain $\varepsilon$-precise solutions to LO problems using at most $$\widetilde{O}\!\left(\left[\frac{(m+n)^{3/2}}{\varepsilon} + \frac{(m+n)^{1/2}}{\varepsilon^{3/2}}\right] \cdot \mathrm{nnz}(A)\right)$$ elementary gates, where $\mathrm{nnz}(A)$ is the total number of non-zero elements found in the constraint matrix.

quant-ph↗

Entanglement Scaling of Motzkin Chains under Spiral Hamiltonian-path Embeddings

We investigate how a two-dimensional spatial embedding changes the entanglement observed across geometrically local bipartitions of a one-dimensional quantum spin chain. A $q$-deformed colored Motzkin chain is placed along a spiral-inspired Hamiltonian path that visits $N(L)=Θ(L^2)$ sites of a square-lattice region while retaining a path interaction graph. Straight ambient-space cuts then correspond to unions of $Θ(L)$ disconnected intervals in the chain ordering. We derive the scaling of a height-variation proxy for the leading color-pairing contribution and predict ambient-space entropy scaling proportional to $L^2$, $L$, and $O(1)$ for $q>1$, $q=1$, and $q<1$, respectively. We evaluate this proxy numerically using the matrix-product-state representation and verify its predicted finite-size scaling. The embedded and original Hamiltonians have exactly identical spectra and spectral gaps at fixed chain length. We also describe a sparse tensor-network representation and propose a two-chain junction extension. These results isolate the roles of interaction connectivity, spatial embedding, and subsystem geometry in entanglement scaling.

quant-ph↗

Brace for impact: ECDLP challenges for quantum cryptanalysis

Precise suites of benchmarks are required to assess the progress of early fault-tolerant quantum computers at economically impactful applications such as cryptanalysis. Appropriate challenges exist for factoring but those for elliptic curve cryptography are either too sparse or inadequate for standard applications of Shor's algorithm. We introduce a difficulty-graded suite of elliptic curve discrete logarithm (ECDLP) challenges that use Bitcoin's curve y^2=x^3+7 mod p while incrementally lowering the prime field from 256 down to 6 bits. For each bit-length, we provide the prime, the prime group order, and two deterministic nothing-up-my-sleeve (NUMS) points in compressed SEC1 form. All challenges are generated by a deterministic, reproducible procedure, and no private challenge scalar is chosen in advance. We calibrate classical cost against Pollard's rho records and quantum cost against resource estimation results for Shor's algorithm. We compile Shor's ECDLP circuit to logical counts and map them to physical resources for various parameters of the surface code, the repetition cat code and the LDPC cat codes. Under explicit and testable assumptions on physical error rates, code distances, and non-Clifford supply, our scenarios place the full 256-bit instance within a 2027--2033 window. The challenge ladder thus offers a transparent ruler to track fault-tolerant progress on a cryptanalytic target of immediate relevance, and it motivates proactive migration of digital assets to post-quantum signatures.

quant-ph↗