|
|
| Line 28: |
Line 28: |
|
| |
|
| ==Hardware Requirements== | | ==Hardware Requirements== |
| *Network stage: [[:Category: Quantum Computing Network Stage|(Fault-tolerant) Quantum computing network stage]][[Category:Quantum Computing Network Stage]] | | *Network stage: [[:Category: Quantum Memory Network Stage|(Fault-tolerant) Quantum computing network stage]][[Category:Quantum Memory Network Stage]] |
| *Relevant network stage parameters: Required number of qubits <math>q</math>. | | * Relevant parameters to establish one anonymous link: <math>k=1</math> round of quantum communication per node, circuit depth <math>m=1</math>, <math>q=1</math> physical qubits per node. |
| *Benchmark values: The number of qubits <math>q</math> required is precisely known for a finite instance of the protocol. This is calculated in [[Quantum Byzantine Agreement#References|(1)]] for <math>n = 5</math>. They pick the smallest possible security parameter <math>k = 2</math> (of the VQSS scheme) and start calculating the required resources. Summarizing they find that each node requires <math>\sim 200</math> operational qubits, on which quantum circuits of depth <math>\sim 2000</math> must be run. The consumed number of Bell pairs is 648 and the total classical communication cost is 21240 bits. It is not entirely clear if these are the expected costs or the cost per round.
| | * Quantum memories, single-qubit Pauli gates and single-qubit measurements at the end nodes. |
| *In more asymptotic sense it is known that the required number of qubits per node grows rapidly with the number of nodes <math>n</math>, making it therefore, demanding on qubit requirements. | | * Trusted multipartite GHZ source. |
| | * Pairwise authenticated private classical channels. |
| | * Broadcast channel. |
|
| |
|
| ==Properties== | | ==Properties== |