Author: Mina Doosti

—

by

implements Interactive Verification of Quantum Computation Introduction The aim of the protocol is to verify NP-complete problems in the context of communication complexity, so in the case in which the amount of communication between the involved parties is a resource. By definition, if a problem is in NP then it is possible to verify efficiently…

Dual Basis Measurement Based Quantum E-voting

—

by

implements Quantum Electronic Voting Introduction This protocol implements the functionality of Quantum E-voting. The protocol uses an entangled state with a special property as a blank ballot and is self-tallying, i.e. the voters, without the presence of any trusted authority or tallier, need to verify that they share specific quantum states. Related Paper(s) Self-tallying quantum…

Travelling Ballot Based Quantum E-Voting

—

by

implements Quantum Electronic Voting Introduction This protocol implements the functionality of Quantum Electronic Voting. The protocol uses two entangled qudits, one as a blank ballot that travels from voter to voter and the second one for computing the election result. The first quantum scheme in this category was introduced by Vaccaro[1] and later improved by[2,3]…

Quantum voting based on conjugate coding

—

by

implements Quantum Electronic Voting Introduction This protocol [1] implements the task of quantum E-voting. The participants in this family of protocols are one or more election authorities, the tallyer, and the voters. The election authorities are only trusted for the purpose of eligibility, and the voters do not share any entangled states with either the…

Practical Quantum Electronic Voting

—

by

implements Quantum Electronic Voting Introduction This protocol[1] achieves the functionality of Quantum Electronic Voting. In this protocol, an untrusted multipartite entanglement source can be used to carry out an election without any election authorities. Related Paper(s) Quantum protocol for electronic voting without election authorities Outline In the first phase of the protocol, each agent is…

Prepare-and-Measure Weak String Erasure

—

by

implements Weak String Erasure Introduction This protocol implements Weak String Erasure (WSE) in a prepare-and-measure setup. This is often used as a subroutine in other protocols. Related Paper(s) Unconditional Security From Noisy Quantum Storage Outline Alice and Bob first agree on a duration $\Delta_t$ that should correspond to an estimation of the time needed to…

Weak String Erasure

—

by

in Functionalities

Functionality Description Weak String Erasure (WSE)[1] is a two-party functionality, say between Alice and Bob, that allows Alice to send a random bit string to Bob, in such a way that Alice is guaranteed that a fraction (ideally half) of the bits are lost during the transmission. However, Alice should not know which bits Bob…

Distributed Routing in a Quantum Internet

—

by

implements Entanglement Routing Introduction This protocol [1] implements the functionality of Entanglement Routing. They develop routing protocols considering different types of path discovery algorithms, considering a continuous model in which entanglement between a subset of the nodes is produced continuously in the background and an on-demand model where entanglement production starts when a request is…

Distributing Graph States Over Arbitrary Quantum Networks

—

by

implements Entanglement Routing Introduction This protocol [1] implements the task of distributing arbitrary graph states over quantum networks of arbitrary topology. The goal is to distribute these states in a way that is most efficient in terms of the number of Bell pairs consumed and the number of operations realised by the protocol. Related…

Anonymous Multiparty Entanglement Distribution

—

by