Quantum key distribution in a high-dimensional state space: exploiting the transverse degree of freedom of the photon

Author(s):  
Robert W. Boyd ◽  
Anand Jha ◽  
Mehul Malik ◽  
Colin O'Sullivan ◽  
Brandon Rodenburg ◽  
...  
2011 ◽  
Vol 11 (3&4) ◽  
pp. 313-325
Author(s):  
Warner A. Miller

An increase in the dimension of state space for quantum key distribution (QKD) can decrease its fidelity requirements while also increasing its bandwidth. A significant obstacle for QKD with qu$d$its ($d\geq 3$) has been an efficient and practical quantum state sorter for photons whose complex fields are modulated in both amplitude and phase. We propose such a sorter based on a multiplexed thick hologram, constructed e.g. from photo-thermal refractive (PTR) glass. We validate this approach using coupled-mode theory with parameters consistent with PTR glass to simulate a holographic sorter. The model assumes a three-dimensional state space spanned by three tilted planewaves. The utility of such a sorter for broader quantum information processing applications can be substantial.


2016 ◽  
Vol 24 (19) ◽  
pp. 22159 ◽  
Author(s):  
Haize Bao ◽  
Wansu Bao ◽  
Yang Wang ◽  
Ruike Chen ◽  
Chun Zhou ◽  
...  

2020 ◽  
Vol 18 (06) ◽  
pp. 2050031
Author(s):  
Ali Mehri-Toonabi ◽  
Mahdi Davoudi Darareh ◽  
Shahrooz Janbaz

In this work, we introduce a high-dimensional polarization-phase (PoP)-based quantum key distribution protocol, briefly named PoP[Formula: see text], where [Formula: see text] is the dimension of a hybrid quantum state including polarization and phase degrees of freedom of the same photon, and [Formula: see text] is the number of mutually unbiased bases. We present a detailed description of the PoP[Formula: see text] protocol as a special case, and evaluate its security against various individual and coherent eavesdropping strategies, and in each case, we compare it with the BB84 and the two-dimensional (TD)-PoP protocols. In all the strategies, the error threshold and the effective transmission rate of the PoP[Formula: see text] protocol are far greater than the other two protocols. Unlike most high-dimensional protocols, the simplicity of producing and detecting the qudits and the use of conventional components (such as traditional single-photon sources and quantum channels) are among the features of the PoP[Formula: see text] protocol.


2010 ◽  
Vol 30 (2) ◽  
pp. 192-215 ◽  
Author(s):  
Alexander Shkolnik ◽  
Michael Levashov ◽  
Ian R. Manchester ◽  
Russ Tedrake

A motion planning algorithm is described for bounding over rough terrain with the LittleDog robot. Unlike walking gaits, bounding is highly dynamic and cannot be planned with quasi-steady approximations. LittleDog is modeled as a planar five-link system, with a 16-dimensional state space; computing a plan over rough terrain in this high-dimensional state space that respects the kinodynamic constraints due to underactuation and motor limits is extremely challenging. Rapidly Exploring Random Trees (RRTs) are known for fast kinematic path planning in high-dimensional configuration spaces in the presence of obstacles, but search efficiency degrades rapidly with the addition of challenging dynamics. A computationally tractable planner for bounding was developed by modifying the RRT algorithm by using: (1) motion primitives to reduce the dimensionality of the problem; (2) Reachability Guidance, which dynamically changes the sampling distribution and distance metric to address differential constraints and discontinuous motion primitive dynamics; and (3) sampling with a Voronoi bias in a lower-dimensional “task space” for bounding. Short trajectories were demonstrated to work on the robot, however open-loop bounding is inherently unstable. A feedback controller based on transverse linearization was implemented, and shown in simulation to stabilize perturbations in the presence of noise and time delays.


Author(s):  
Murat Can Sarihan ◽  
Kai-Chi Chang ◽  
Xiang Cheng ◽  
Yoo Seung Lee ◽  
Changchen Chen ◽  
...  

Author(s):  
Tristan B. H. Tentrup ◽  
Willemijn M. Luiten ◽  
Peter Hooijschuur ◽  
Reinier van der Meer ◽  
Pepijn W. H. Pinkse

Sign in / Sign up

Export Citation Format

Share Document