Write, autoreview, editor, reviewer
3,129
edits
mNo edit summary |
mNo edit summary |
||
Line 1: | Line 1: | ||
Submissions can be made to the google form provided in the link below. A request can be made to include an article | Submissions can be made to the google form provided in the link below. A request can be made to include an article in the "Discussion" section for a certain protocol. If you do not find any required functionality or think your protocol requires a new page, submit *.tex/ *.txt/ *.html version of the protocol using instructions in the guidelines given below. Note that Quantum Protocol Zoo accepts only published articles. The final decision on a request resides with the Quantum Protocol Zoo team. | ||
Link to Google Form: https://goo.gl/forms/UXhrqzQEVpm98Mkt1 | Link to Google Form: https://goo.gl/forms/UXhrqzQEVpm98Mkt1 | ||
Line 6: | Line 6: | ||
== | ==Structure== | ||
*Defines the functionality and | *Defines the functionality, objective and method used for the concerned protocol. | ||
*Should define all the properties of protocol that fit the functionality. E.g. For Blind Quantum Computation, it defines Delegated Quantum Computation, Blind Computation and the properties concerned i.e. blindness, correctness and universality. | *Should define all the properties of protocol that fit the functionality. E.g. For Blind Quantum Computation, it defines Delegated Quantum Computation, Blind Computation and the properties concerned i.e. blindness, correctness and universality. | ||
*No new terms should be used unless explained in the same paragraph. If the term is complex and needs further explanation one can also provide a link for the same to the supplementary information page. e.g. [[fidelity|fidelity]] (measure of how close two quantum states are), and the link would direct one to a mathematical formulae of the same in the supplementary page. | *No new terms should be used unless explained in the same paragraph. If the term is complex and needs further explanation one can also provide a link for the same to the supplementary information page. e.g. [[fidelity|fidelity]] (measure of how close two quantum states are), and the link would direct one to a mathematical formulae of the same in the supplementary page. | ||
Line 15: | Line 15: | ||
*Avoid mathematical equations or notations. | *Avoid mathematical equations or notations. | ||
'''Tags''' | '''Tags''' | ||
*One- or two-words tags. | *One- or two-words tags. | ||
Line 22: | Line 20: | ||
*All related pages which one wants to bring notice to the reader are also included in tags. | *All related pages which one wants to bring notice to the reader are also included in tags. | ||
*One should try to put as many tags as possible. e.g for Public Quantum Money, Tags: Money, Specific Task, Multi party, Private Quantum Money,.. | *One should try to put as many tags as possible. e.g for Public Quantum Money, Tags: Money, Specific Task, Multi party, Private Quantum Money,.. | ||
===Model Assumptions=== | |||
== | ---- | ||
*All setup assumptions taken into account for this protocol should be mentioned here. </br> | |||
* | For e.g. classical or quantum authenticated channel | ||
===Outline=== | ===Outline=== | ||
Line 36: | Line 32: | ||
*Same as functionality description it should be lucid, but one is free to make this section lengthy (yet avoid redundancy) | *Same as functionality description it should be lucid, but one is free to make this section lengthy (yet avoid redundancy) | ||
*Should give a rough picture of the protocol without any specific details like number of qubits used or threshold value if any. | *Should give a rough picture of the protocol without any specific details like number of qubits used or threshold value if any. | ||
*In the end, this section | *In the end, this section should accommodate a figure of the protocol which describes the quantum and classical channels distribution for the protocol and elicits an example of the protocol. See an example in Protocol Library (sidebar). A hand-rough hand drawn figure can be submitted. | ||
'''Notations''' The following sections on properties and pseudo code contain mathematical equations and hence to connect it with the wordy outline this section displays all notations used. | '''Notations''' The following sections on properties and pseudo code contain mathematical equations and hence to connect it with the wordy outline this section displays all notations used. | ||
---- | ---- | ||
===Hardware Requirements=== | |||
---- | |||
*Network Stage: | |||
*Network Stage parameters of relevance: | |||
*Benchmark values for the various parameters of the protocol such as fidelity value, transmission distance, Qubit Error Rate (QBER), estimated time, number of rounds, network stage the protocol belongs to, etc.. should be included in this section explicitly. | |||
*Hardware setup for this protocol. (e.g. BB84 QKD or Decoy state preparation and measurement devices, etc) | |||
===Properties=== | ===Properties=== | ||
---- | ---- | ||
Line 63: | Line 64: | ||
*Avoid words as much as possible. | *Avoid words as much as possible. | ||
== | ===Discussion=== | ||
---- | |||
Any useful information related to the protocols belonging to this class of functionality and network stage as the protocol discussed above, which cannot not find place in the above sections go here. | |||
==Extra Information== | ==Extra Information== | ||
*If the paper used for given description has multiple protocols, pick the most general one and if needed one can merge it. The concerned paper thus goes in the relevant papers section mentioning the other versions of protocols as its one line description. | *If the paper used for given description has multiple protocols, pick the most general one and if needed one can merge it. The concerned paper thus goes in the relevant papers section mentioning the other versions of protocols as its one line description. |