Main Page: Difference between revisions
m (→Structure) |
m (→Structure) |
||
Line 20: | Line 20: | ||
*'''Example:''' | *'''Example:''' | ||
---- | ---- | ||
#'''Outline'''</br> | |||
A non-mathematical detailed outline which provides a rough idea of the method described. A figure is accommodated for most protocols. | A non-mathematical detailed outline which provides a rough idea of the method described. A figure is accommodated for most protocols. | ||
#'''Properties''' A list of important information extracted from the protocol such as, Parameters (threshold values), security claim, success probability, adversarial assumption (see [[Quantum Adversary Definitions|Quantum Adversary Definitions)]], setup assumptions, etc.. | #'''Properties''' A list of important information extracted from the protocol such as, Parameters (threshold values), security claim, success probability, adversarial assumption (see [[Quantum Adversary Definitions|Quantum Adversary Definitions)]], setup assumptions, etc.. |
Revision as of 10:53, 8 November 2018
Welcome to The Quantum Protocol Zoo- Explore, Learn and Implement Quantum Protocols
The Quantum Protocol Zoo is an open repository of quantum protocols which provides a medium to explore all such protocols presented in a compressed form in order to communicate with the computer scientists, engineers and physicists on one platform.
Getting started
Various quantum communication protocols are presented according to the structure given below as lucid as possible. A page on Supplementary Information has been provided for any additional introduction to quantum computation. Various categories have also been used as 'tags' to link several protocols similar in some aspects. Any information on How to Submit or contact can be found on the sidebar.
Structure
- Functionality Description
A lucid definition of functionality achieved and properties satisfied by the method used.
Tags: Any related page or list of protocols is connected by this section
- Use Case
Bridges the gap between users and protocol designers.
- Technological Readiness:
- Requirements
- Network Stage:
- Example:
- Outline
A non-mathematical detailed outline which provides a rough idea of the method described. A figure is accommodated for most protocols.
- Properties A list of important information extracted from the protocol such as, Parameters (threshold values), security claim, success probability, adversarial assumption (see Quantum Adversary Definitions), setup assumptions, etc..
- Pseudo Code Mathematical step-wise protocol algorithm
- Relevant papers
Protocols easy to interpret after reading the concerned formal description, listed in chronological order.