arXiv subjects

Mohsen Razavi

Publications and source records attributed to Mohsen Razavi.

46 records · Page 3Linked to original sources

arXiv2014

Memory-assisted measurement-device-independent quantum key distribution

A protocol with the potential of beating the existing distance records for conventional quantum key distribution (QKD) systems is proposed. It borrows ideas from quantum repeaters by using memories in the middle of the link, and that of measurement-device-independent QKD, which only requires optical source equipment at the user's end. For certain fast memories, our scheme allows a higher repetition rate than that of quantum repeaters, thereby requiring lower coherence times. By accounting for various sources of nonideality, such as memory decoherence, dark counts, misalignment errors, and background noise, as well as timing issues with memories, we develop a mathematical framework within which we can compare QKD systems with and without memories. In particular, we show that with the state-of-the-art technology for quantum memories, it is possible to devise memory-assisted QKD systems that, at certain distances of practical interest, outperform current QKD implementations.

quant-ph↗

arXiv2014

Spacetime effects on satellite-based quantum communications

We investigate the consequences of space-time being curved on space-based quantum communication protocols. We analyze tasks that require either the exchange of single photons in a certain entanglement distribution protocol or beams of light in a continuous-variable quantum key distribution scheme. We find that gravity affects the propagation of photons, therefore adding additional noise to the channel for the transmission of information. The effects could be measured with current technology.

quant-ph↗

arXiv2013

Long-distance quantum key distribution with imperfect devices

Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secure key generation rates per quantum memory. The two schemes under investigation are the one proposed by Duan et al. in [Nat. 414, 413 (2001)] and that of Sangouard et al. in [Phys. Rev. A 76, 050301 (2007)]. We consider various sources of imperfection in both protocols, such as nonzero double-photon probabilities at the sources, dark counts in detectors, and inefficiencies in the channel, photodetectors and memories. We also consider memory decay and dephasing processes in our analysis. For the latter system, we determine the maximum value of the double-photon probability beyond which secretkey distillation is not possible. We also find the crossover distance beyond which the repeater schemes outperform the non-repeater ones. We finally compare the two protocols in terms of their achievable secret key generation rates at their optimal settings

quant-ph↗

arXiv2012

Alternative schemes for measurement-device-independent quantum key distribution

Practical schemes for measurement-device-independent quantum key distribution using phase and path or time encoding are presented. In addition to immunity to existing loopholes in detection systems, our setup employs simple encoding and decoding modules without relying on polarization maintenance or optical switches. Moreover, by employing a modified sifting technique to handle the dead-time limitations in single-photon detectors, our scheme can be run with only two single-photon detectors. With a phase-postselection technique, a decoy-state variant of our scheme is also proposed, whose key generation rate scales linearly with the channel transmittance.

quant-ph↗

arXiv2012

Statistical fluctuation analysis for measurement-device-independent quantum key distribution

Measurement-device-independent quantum key distribution with a finite number of decoy states is analyzed under finite-data-size assumption. By accounting for statistical fluctuations in parameter estimation, we investigate vacuum+weak- and vacuum+two-weak-decoy-state protocols. In each case, we find proper operation regimes, where the performance of our system is comparable to the asymptotic case for which the key size and the number of decoy states approach infinity. Our results show that practical implementations of this scheme can be both secure and efficient.

quant-ph↗

arXiv2011

Multiple-Access Quantum Key Distribution Networks

This paper addresses multi-user quantum key distribution networks, in which any two users can mutually exchange a secret key without trusting any other nodes. The same network also supports conventional classical communications by assigning two different wavelength bands to quantum and classical signals. Time and code division multiple access (CDMA) techniques, within a passive star network, are considered. In the case of CDMA, it turns out that the optimal performance is achieved at a unity code weight. A listen-before-send protocol is then proposed to improve secret key generation rates in this case. Finally, a hybrid setup with wavelength routers and passive optical networks, which can support a large number of users, is considered and analyzed.

quant-ph↗

arXiv2010

Quantum Key Distribution over Probabilistic Quantum Repeaters

A feasible route towards implementing long-distance quantum key distribution (QKD) systems relies on probabilistic schemes for entanglement distribution and swapping as proposed in the work of Duan, Lukin, Cirac, and Zoller (DLCZ) [Nature 414, 413 (2001)]. Here, we calculate the conditional throughput and fidelity of entanglement for DLCZ quantum repeaters, by accounting for the DLCZ self-purification property, in the presence of multiple excitations in the ensemble memories as well as loss and other sources of inefficiency in the channel and measurement modules. We then use our results to find the generation rate of secure key bits for QKD systems that rely on DLCZ quantum repeaters. We compare the key generation rate per logical memory employed in the two cases of with and without a repeater node. We find the cross-over distance beyond which the repeater system outperforms the non-repeater one. That provides us with the optimum inter-node distancing in quantum repeater systems. We also find the optimal excitation probability at which the QKD rate peaks. Such an optimum probability, in most regimes of interest, is insensitive to the total distance.

quant-ph↗

arXiv2007

Continuous-time cross-phase modulation and quantum computation

The weak nonlinear Kerr interaction between single photons and intense laser fields has been recently proposed as a basis for distributed optics-based solutions to few-qubit applications in quantum communication and computation. Here, we analyze the above Kerr interaction by employing a continuous-time multi-mode model for the input/output fields to/from the nonlinear medium. In contrast to previous single-mode treatments of this problem, our analysis takes into account the full temporal content of the free-field input beams as well as the non-instantaneous response of the medium. The main implication of this model, in which the cross-Kerr phase shift on one input is proportional to the photon flux of the other input, is the existence of phase noise terms at the output. We show that these phase noise terms will preclude satisfactory performance of the parity gate proposed by Munro, Nemoto, and Spiller [New J. Phys. 7, 137 (2005)].

quant-ph↗

arXiv2007

A non-adiabatic approach to entanglement distribution over long distances

Entanglement distribution between trapped-atom quantum memories, viz. single atoms in optical cavities, is addressed. In most scenarios, the rate of entanglement distribution depends on the efficiency with which the state of traveling single photons can be transferred to trapped atoms. This loading efficiency is analytically studied for two-level, $V$-level, $Λ$-level, and double-$Λ$-level atomic configurations by means of a system-reservoir approach. An off-resonant non-adiabatic approach to loading $Λ$-level trapped-atom memories is proposed, and the ensuing trade-offs between the atom-light coupling rate and input photon bandwidth for achieving a high loading probability are identified. The non-adiabatic approach allows a broad class of optical sources to be used, and in some cases it provides a higher system throughput than what can be achieved by adiabatic loading mechanisms. The analysis is extended to the case of two double-$Λ$ trapped-atom memories illuminated by a polarization-entangled biphoton.

quant-ph↗

arXiv2005

Long-Distance Quantum Communication with Neutral Atoms

The architecture proposed by Duan, Lukin, Cirac, and Zoller (DLCZ) for long-distance quantum communication with atomic ensembles is analyzed. Its fidelity and throughput in entanglement distribution, entanglement swapping, and quantum teleportation is derived within a framework that accounts for multiple excitations in the ensembles as well as loss and asymmetries in the channel. The DLCZ performance metrics that are obtained are compared to the corresponding results for the trapped-atom quantum communication architecture that has been proposed by a team from the Massachusetts Institute of Technology and Northwestern University (MIT/NU). Both systems are found to be capable of high-fidelity entanglement distribution. However, the DLCZ scheme only provides conditional teleportation and repeater operation, whereas the MIT/NU architecture affords full Bell-state measurements on its trapped atoms. Moreover, it is shown that achieving unity conditional fidelity in DLCZ teleportation and repeater operation requires ideal photon-number resolving detectors. The maximum conditional fidelities for DLCZ teleportation and repeater operation that can be realized with non-resolving detectors are 1/2 and 2/3, respectively.

quant-ph↗