Write, autoreview, editor, reviewer
3,129
edits
(→Format) |
|||
Line 30: | Line 30: | ||
**No new terms should be used unless explained in the same paragraph. If the term is complex | **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 | and needs further explanation one can also provide a link for the same to the supplementary | ||
information page. e.g. | information page. e.g. 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. | would direct one to a mathematical formulae of the same in the supplementary page. | ||
**No | **No fictional names to be used. The parties should be called according to their roles. E.g. Client- | ||
Server instead of Alice-Bob is preferred. | Server instead of Alice-Bob is preferred. | ||
**Avoid mathematical equations or notations. | **Avoid mathematical equations or notations. | ||
Line 43: | Line 43: | ||
** No mathematical notations or equations should be used. | ** No mathematical notations or equations should be used. | ||
**Bullet points are preferred. | **Bullet points are preferred. | ||
**It should be lucid, and one is free to make this section lengthy (yet avoid redundancy) such that it gives a rough picture of the protocol without any | **It should be lucid, and one is free to make this section lengthy (yet avoid redundancy) such that it gives a rough picture of the protocol without any specific details like number of qubits used or threshold value if any. | ||
*'''Notations''' The following sections on properties and pseudo code contain mathematical equations and hence | *'''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. | to connect it with the wordy outline this section displays all notations used. | ||
Line 51: | Line 51: | ||
and can be extracted from the protocol. e.g: | and can be extracted from the protocol. e.g: | ||
# List of parameters used e.g. threshold value etc. | # List of parameters used e.g. threshold value etc. | ||
# Security Claims and other theorems used for the protocol e.g. correctness, | # Security Claims and other theorems used for the protocol e.g. correctness, verifiability, blindness, universality | ||
# Advantages in terms of resources. e.g. no quantum memory needed etc. | # Advantages in terms of resources. e.g. no quantum memory needed etc. | ||
# Success probability of protocols (for entanglement routing and other building blocks protocols). | # Success probability of protocols (for entanglement routing and other building blocks protocols). | ||
Line 57: | Line 57: | ||
be accommodated here. | be accommodated here. | ||
#If using new term for any of the above, please explain it here itself and if needed, provide a link to | #If using new term for any of the above, please explain it here itself and if needed, provide a link to | ||
supplementary information page for a detailed explanation. E.g. Any property not | supplementary information page for a detailed explanation. E.g. Any property not defined in the | ||
functionality description already could be | functionality description already could be defined here. | ||
*'''Pseudo Code'''This section contains an algorithm/ pseudo code of the protocol. | *'''Pseudo Code'''This section contains an algorithm/ pseudo code of the protocol. | ||
**Should be step-wise description of the protocol with mathematical equations. Avoid words as much as possible. | **Should be step-wise description of the protocol with mathematical equations. Avoid words as much as possible. |