Combining Blockchain and Swarm Robotics to Deploy Surveillance Missions

Current swarm robotics systems are not utilized as frequently in surveillance missions due to the limitations of the existing distributed systems\u27 designs. The main limitation of swarm robotics is the absence of a framework for robots to be self-governing, secure, and scalable. As of today, a swarm of robots is not able to communicate and perform tasks in transparent and autonomous ways. Many believe blockchain is the imminent future of distributed autonomous systems. A blockchain is a system of computers that stores and distributes data among all participants. Every single participant is a validator and protector of the data in the blockchain system. The data cannot be modified since all participants are storing and watching the same records. In this thesis, we will focus on blockchain applications in swarm robotics using Ethereum smart contracts because blockchain can make a swarm globally connected and secure. A decentralized application (DApp) is used to deploy surveillance missions. After mission deployment, the swarm uses blockchain to communicate and make decisions on appropriate tasks within Ethereum private networks. We set a test swarm robotics system and evaluate the blockchain for its performance, scalability, recoverability, and responsiveness. We conclude that, although blockchain enables a swarm to be globally connected and secure, there are performance limitations that can become a critical issue

Quantum repeaters with imperfect memories: cost and scalability

Memory dephasing and its impact on the rate of entanglement generation in quantum repeaters is addressed. For systems that rely on probabilistic schemes for entanglement distribution and connection, we estimate the maximum achievable rate per employed memory for our optimized partial nesting protocol. We show that, for any given distance $L$, the polynomial scaling of rate with distance can only be achieved if quantum memories with coherence times on the order of $L/c$ or longer, with $c$ being the speed of light in the channel, are available. The above rate degrades as a power of $\exp[-\sqrt{(L/c)/ \tau_c}]$ with distance when the coherence time $\tau_c \ll L/c$.Comment: Extended version with 5 figure

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.Comment: 12 pages, 6 figures; Fig. 5(a) is replace

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.Comment: 15 pages, 10 figure