A Link Layer Protocol for Quantum Networks

Slides:



Advertisements
Similar presentations
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Advertisements

System Area Network Abhiram Shandilya 12/06/01. Overview Introduction to System Area Networks SAN Design and Examples SAN Applications.
Topic 7 Local Area Networks (LAN)
Z-MAC: a Hybrid MAC for Wireless Sensor Networks Injong Rhee, Ajit Warrier, Mahesh Aia and Jeongki Min Dept. of Computer Science, North Carolina State.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Quantum Cryptography Qingqing Yuan. Outline No-Cloning Theorem BB84 Cryptography Protocol Quantum Digital Signature.
Improving Robustness in Distributed Systems Jeremy Russell Software Engineering Honours Project.
Architecture and Real Time Systems Lab University of Massachusetts, Amherst An Application Driven Reliability Measures and Evaluation Tool for Fault Tolerant.
Future Challenges in Long-Distance Quantum Communication Jian-Wei Pan Hefei National Laboratory for Physical Sciences at Microscale, USTC and Physikalisches.
DAC: Distributed Asynchronous Cooperation for Wireless Relay Networks 1 Xinyu Zhang, Kang G. Shin University of Michigan.
BB84 Quantum Key Distribution 1.Alice chooses (4+  )n random bitstrings a and b, 2.Alice encodes each bit a i as {|0>,|1>} if b i =0 and as {|+>,|->}
Lo-Chau Quantum Key Distribution 1.Alice creates 2n EPR pairs in state each in state |  00 >, and picks a random 2n bitstring b, 2.Alice randomly selects.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
1 Computer Networks Course: CIS 3003 Fundamental of Information Technology.
Copyright © 2006 Keio University Networking Problems in Using Quantum Repeaters Rodney Van Meter MAUI, 2009/4/16
Runtime Authentication in Highly-Secured Network Systems Iftakhar Ahmad Department of Computer Science and Engineering.
IIS 2004, CroatiaSeptember 22, 2004 Quantum Cryptography and Security of Information Systems 1 2
R. Demkowicz-Dobrzański 1, J. Kołodyński 1, K. Banaszek 1, M. Jarzyna 1, M. Guta 2 1 Faculty of Physics, Warsaw University, Poland 2 School of Mathematical.
Copyright © 2006 Keio University Applications of an Entangled Quantum Internet Conference on Future Internet Technologies Seoul, Korea June 20, 2008 Rodney.
Kraków4FutureDaQ Institute of Physics & Nowoczesna Elektronika P.Salabura,A.Misiak,S.Kistryn,R.Tębacz,K.Korcyl & M.Kajetanowicz Discrete event simulations.
Systems Research Barbara Liskov October Replication Goal: provide reliability and availability by storing information at several nodes.
Evaluating Mobility Support in ZigBee Networks
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
Distributed Systems Lecture 5 Time and synchronization 1.
Pouya Ostovari and Jie Wu Computer & Information Sciences
-SECRECY ENSURED TECHNOLOGYKEY DISTRIBUTUION CLASSICAL CRYPTOGRAPHY QUANTAM CRYPTOGRAPHY WORKING INTRODUCTION SECURITY CONCLUSION ADVANTAGESLIMITATIONS.
Institute of Physics (IOP), Bhubaneswar
In the name of God.
Developing an Implementation Framework for the Future Internet using the Y-Comm Architecture, SDN and NFV Glenford Mapp Associate Professor Middlesex University,
Media Access Methods MAC Functionality CSMA/CA with ACK
Introduction to Distributed Platforms
Cognitive Link Layer for Wireless Local Area Networks
Nada Al Dosary CT 1502 Planning and Design of Communication Networks Local Area Networks (LANs) & Networks.
Wireless LANs Wireless proliferating rapidly.
Alternative system models
Large Distributed Systems
Routing design goals, challenges,
Peer-to-peer networking
Chapter 9 – RPCs, Messaging & EAI
Understanding the OSI Reference Model
CS691 M2009 Semester Project PHILIP HUYNH
Quantum Technologies Flagship
Quantum Engineering & Control
CS691 M2009 Semester Project PHILIP HUYNH
CS 258 Reading Assignment 4 Discussion Exploiting Two-Case Delivery for Fast Protected Messages Bill Kramer February 13, 2002 #
November 18 July 2008 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Task Group 4e definitions Date.
Shadow: Scalable and Deterministic Network Experimentation
Department of Computer Science Southern Illinois University Carbondale CS441-Mobile & Wireless Computing IEEE Standard.
Tarun Banka Department of Computer Science Colorado State University
Connections Johan Lukkien
Discretized Streams: A Fault-Tolerant Model for Scalable Stream Processing Zaharia, et al (2012)
From Viewstamped Replication to BFT
EEC 688/788 Secure and Dependable Computing
Cross-layer DTN Task Scheduling in Disaster Recovery
Fault-Tolerant State Machine Replication
Performance Evaluation of Computer Networks
Teechain: Scalable Blockchain Payments using Trusted Execution Environments GIZEM AKDENIZ DECEMBER 13 , 2018.
Performance Evaluation of Computer Networks
Introducing complex networks into quantum regime
Co-designed Virtual Machines for Reliable Computer Systems
Chapter-5 Traffic Engineering.
Quantum repeater scheme from refs. 13 and 14 (CTSL scheme).
INTERNATIONAL CONFERENCE ON QUANTUM INFORMATION
Design.
Modeling and Evaluating Variable Bit rate Video Steaming for ax
A Study of On-Off Attack Models for Wireless Ad Hoc Networks
Introduction to Computer Networks
Brahim Ayari, Abdelmajid Khelil and Neeraj Suri
Presentation transcript:

A Link Layer Protocol for Quantum Networks Axel Dahlberg, Matt Skrzypczyk, Tim Coopmans, Leon Wubben, Filip Rozpędek, Matteo Pompili, Arian Stolk, Przemysław Pawełczak, Robert Knegjens, Julio de Oliveira Filho, Ronald Hanson, Stephanie Wehner ACM SIGCOMM 2019 – Wednesday 08/21/2019

Joint work with Axel Dahlberg Tim Coopmans Leon Wubben Filip Rozpędek Matteo Pompili Arian Stolk Przemysław Pawełczak Rob Knegjens Julio de Oliveira Filho Ronald Hanson Stephanie Wehner

Quantum Information Classical Quantum 1 0+1

Applications Quantum Key Distribution Clock Synchronization Bennett and Brassard. Theor. Comput. Sci. 560.12 (2014): 1984 Ekert. Physical review letters 67.6 (1991): 661. 1991 Clock Synchronization Gottesman, Jennewein, and Croke. Physical Review Letters 109.7 (2012) Secure Quantum Computing in the Cloud Fitzsimons and Kashefi. Physical Review A 96.1 (2017). 2017

Quantum Network Structure End Node Bridge long distances Repeater Prepare/Measure Qubits Store/Manipulate Qubits

Stages of Quantum Networks Functionality Quantum Computing Networks Cryptography Sensing and Metrology Distributed Systems Secure Quantum Cloud Computing Fault-Tolerant Few Qubit Networks Quantum Memory Networks Entanglement Distribution Networks Prepare and Measure Networks Trusted Repeater Networks Time Wehner, Elkouss, and Hanson. Science 362, 6412 (oct). 2018

Our Contribution Functional allocation of quantum network stack Systematic study of design considerations and use cases First physical and link layer protocols Performance evaluation and scheduling investigation

Related Work Entanglement generation experiments QKD networks Hensen et al. Nature 526, 7575 (2015), 682-686. 2015 Hofmann et al. Science 337, 6090 (2012), 72-75. 2012 QKD networks Liu et al. ACM SIGCOMM Computer Communication Review. Vol. 43. No. 4. 2013 Yu et al. IEEE International Conference on Computer and Communications. IEEE, 2017 Network stack sketches Aparicio et al. Asian Internet Engineering Conference. ACM, 2011 Pirker and Dür. New Journal of Physics 21.3. 2019

Why a Quantum Network Stack is Different No copying! Short lifetime! Inherently connected!

Sending Qubits via Entanglement End node End node

Sending Qubits via Entanglement End node End node

Sending Qubits via Entanglement End node End node

Quantum Repeater… Entanglement Swapping End node Repeater End node

Quantum Repeater… Entanglement Swapping End node Repeater End node

Quantum Repeater… Entanglement Swapping End node Repeater End node

Example of Quantum Hardware Nitrogen vacancy in diamond Communication qubit Storage qubits Entanglement at 1.3 km 10 mm

Physical Entanglement Generation

How Entanglement is Produced

Our Contribution Functional allocation of quantum network stack Systematic study of design considerations and use cases First physical and link layer protocols Performance evaluation and scheduling investigation

Quantum Network Stack Application Transport Network Link Physical

Quantum Network Stack Application Transport Network Link Physical Quantum Application Protocols Transport End-to-end Qubit Delivery Network Long-distance Entanglement Generation Link Entanglement Generation on a Link Physical Quantum Device Layer

Quantum Network Stack Application Transport Network Link Physical Quantum Application Protocols Transport End-to-end Qubit Delivery Network Long-distance Entanglement Generation Link Entanglement Generation on a Link Physical Quantum Device Layer

Our Contribution Functional allocation of quantum network stack Systematic study of design considerations and use cases First physical and link layer protocols Performance evaluation and scheduling investigation

Link Layer: Entanglement Generation Service CREATE OK, … OK, … QEGP QEGP

Performance Metrics Quantum Metrics Fidelity: quality of entanglement, rate of success trade-off Standard Metrics Latency: issuing request to getting a pair Throughput: pairs/s Fairness: difference in performance metrics between nodes

Use Cases Application Use Cases Measure directly: many pairs measured immediately Create and keep: few pair(s) stored for processing Network Layer Use Case Create and keep: entanglement swapping with two pairs

Design Considerations Noise due to attempts Producing entanglement induces noise on storage qubits (Kalb et al, Phys. Rev. A, 97. 2018) Avoid triggering unless both nodes agree Noise is time dependent Avoid waiting once entanglement made Prior discussion preferred Quantum CRC for error detection difficult Applications do not require perfect entanglement Reduce complexity

Our Contribution Functional allocation of quantum network stack Systematic study of design considerations and use cases First physical and link layer protocols Performance evaluation and scheduling investigation

CREATE: Expected Service Node A Node B QEGP QEGP Link Layer Physical Layer Higher layer to QEGP Remote node ID, # pairs, min fidelity, max time, request type, ...

OK: Expected Service QEGP to higher layer Node A Node B QEGP QEGP Link Layer Physical Layer QEGP to higher layer Entanglement ID, qubit ID, fidelity estimate, ...

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol

A Link Layer Protocol ?

How to Prioritize CREATE Requests Requires context and information Simple version: first come first serve More interesting: cater to different use cases

Our Contribution Functional allocation of quantum network stack Systematic study of design considerations and use cases First physical and link layer protocols Performance evaluation and scheduling investigation

Simulation Tool: NetSQUID Discrete event simulator Model and validate simulated quantum hardware Model physical components e.g. fibers, nodes, and midpoint

Simulation Environment: SurfSARA Long runs Protocol robustness: recovery mechanisms Short runs Performance trade-offs: latency, throughput and fidelity Metric fluctuations: different scheduling strategies Simulations Core hours Simulated time Scenarios 2578 94244 707 hours 173

Simulation Example: QL2020 KPN PB400 node location 15km KPN PBX detector location Assumed loss 0.1 dB/splice 0.3 dB/km 10km TU Delft node location

Evaluation: Quantum Hardware Model Simulate experiments Fidelity vs rate of success Qubit memory lifetimes

Evaluation: Single Request Types Parameters Takeaways Robust against extreme channel loss Fidelity primarily impacts latency and throughput Request frequency 0.9 Fidelity >0.5 Control message loss probability Up to 10^-4

Some Takeaways Protocol robust Fidelity versus throughput and latency Mixed request simulations Scheduling versus performance metrics

Our Contribution Functional allocation of quantum network stack Systematic study of design considerations and use cases First physical and link layer protocols Performance evaluation and scheduling investigation

Future Work Hardware realization of Link Layer (ongoing) Network Layer Protocol Other (smarter) scheduling strategies Combat memory lifetimes Consider role of node in network

Thank you