Latest revision |
Your text |
Line 1: |
Line 1: |
|
| |
|
| '''[https://scholar.googleusercontent.com/scholar.bib?q=info:1tFUyiAGSicJ:scholar.google.com/&output=citation&scisdr=ClH3gw_SEOypwjKNmnk:AFWwaeYAAAAAZaWLgnmyQj9Db57Zdp6fbpm8Gmc&scisig=AFWwaeYAAAAAZaWLgnf5EfmL2FMU4hgCdbiauQw&scisf=4&ct=citation&cd=-1&hl=en| Cite Us]'''
| |
| {| class="wikitable" | | {| class="wikitable" |
| !width="40%"|Functionality | | !width="40%"|Functionality |
Line 9: |
Line 8: |
| |[[Verifiable Quantum Anonymous Transmission]] | | |[[Verifiable Quantum Anonymous Transmission]] |
| |- | | |- |
| |rowspan="1"|[[Authentication of Classical Messages]]||[[Uncloneable Encryption]] | | |rowspan="2"|[[Authentication of Classical Messages]]||[[]] |
| |- | | |- |
| |rowspan="7"|[[Authentication of Quantum Messages]]||[[Purity Testing based Quantum Authentication]] | | |rowspan="2"|[[Authentication of Quantum Messages]]||[[]] |
| |- | | |- |
| |[[Polynomial Code based Quantum Authentication]] | | |[[Polynomial Code based Quantum Authentication]] |
| |-
| |
| |[[Clifford Code for Quantum Authentication]]
| |
| |-
| |
| |[[Trap Code for Quantum Authentication]]
| |
| |-
| |
| |[[Auth-QFT-Auth Scheme for Quantum Authentication]]
| |
| |-
| |
| |[[Unitary Design Scheme for Quantum Authentication]]
| |
| |-
| |
| |[[Naive approach using Quantum Teleportation]]
| |
| |- | | |- |
| ||[[Byzantine Agreement]]||[[Fast Quantum Byzantine Agreement]] | | ||[[Byzantine Agreement]]||[[Fast Quantum Byzantine Agreement]] |
Line 29: |
Line 18: |
| ||[[Bit Commitment]]||[[Quantum Bit Commitment]] | | ||[[Bit Commitment]]||[[Quantum Bit Commitment]] |
| |- | | |- |
| |rowspan="2"|[[Coin Flipping]]||[[Quantum Strong Coin Flipping]] | | ||[[Coin Flipping]]||[[Quantum Coin Flipping]] |
| |-
| |
| |[[Quantum Weak Coin Flipping]]
| |
| |- | | |- |
| |[[Copy Protection]]||[[Copy Protection of Compute and Compare Programs]]
| |
| |-
| |
| |rowspan="8"|[[Quantum Digital Signature|(Quantum) Digital Signature]] |||[[Gottesman and Chuang Quantum Digital Signature]] | | |rowspan="8"|[[Quantum Digital Signature|(Quantum) Digital Signature]] |||[[Gottesman and Chuang Quantum Digital Signature]] |
| |- | | |- |
Line 75: |
Line 60: |
| |[[Wiesner Quantum Money]] | | |[[Wiesner Quantum Money]] |
| |- | | |- |
| |rowspan="2"|[[Oblivious Transfer]]||[[Quantum Oblivious Transfer]] | | ||[[Oblivious Transfer]]||[[Quantum Oblivious Transfer]] |
| |-
| |
| |[[Device-Independent Oblivious Transfer]]
| |
| |-
| |
| |rowspan="10"| [[(Symmetric) Private Information Retrieval]] ||[[Multi-Database Classical Symmetric Private Information Retrieval with Quantum Key Distribution]]
| |
| |-
| |
| |[[Multi-Database Quantum Symmetric Private Information Retrieval for Coded Servers]]
| |
| |-
| |
| |[[Multi-Database Quantum Symmetric Private Information Retrieval for Communicating and Colluding Servers]]
| |
| |-
| |
| |[[Multi-Database Quantum Symmetric Private Information Retrieval in the Visible Setting for a Quantum Database]]
| |
| |-
| |
| |[[Multi-Database Quantum Symmetric Private Information Retrieval without Shared Randomness]]
| |
| |-
| |
| |[[Single-Database Quantum Private Information Retrieval in the Honest Server Model]]
| |
| |-
| |
| |[[Single-Database Quantum Private Information Retrieval in the Honest Server Model and in the Blind Setting for a Quantum Database]]
| |
| |-
| |
| |[[Single-Database Quantum Private Information Retrieval with Prior Shared Entanglement in the Honest Server Model]]
| |
| |-
| |
| |[[Quantum Private Queries Protocol Based on Quantum Oblivious Key Distribution]]
| |
| |-
| |
| |[[Quantum Private Queries Protocol Based on Quantum Random Access Memory]]
| |
| |- | | |- |
| |rowspan="2"| [[Quantum Secret Sharing|Secret Sharing]] ||[[Quantum Secret Sharing using GHZ States]] | | |rowspan="2"| [[Quantum Secret Sharing|Secret Sharing]] ||[[Quantum Secret Sharing using GHZ States]] |
Line 131: |
Line 94: |
| |[[Gate Teleporation]] | | |[[Gate Teleporation]] |
| |- | | |- |
| |rowspan="4"|[[Verification of Quantum Computation]]||[[Interactive Proofs for Quantum Computation|Quantum Prover Interactive Proofs]]
| | |[[Verification of Universal Quantum Computation]]||[[Interactive Proofs for Quantum Computation|Quantum Prover Interactive Proofs]] |
| |-
| |
| |[[Verification of NP-complete problems]]
| |
| |-
| |
| |[[Verification of Sub-Universal Quantum Computation]]
| |
| |-
| |
| |[[Classical Verification of Universal Quantum Computation]]
| |
| |-
| |
| |rowspan="5"|[[Quantum Electronic Voting]]||[[Dual Basis Measurement Based Protocol]]
| |
| |- | | |- |
| |[[Travelling Ballot Based Protocol]] | | |[[Verification of Sub-Universal Quantum Computation]]||[[-]] |
| |- | | |- |
| |[[Distributed Ballot Based Protocol]] | | |[[Verification of NP-complete problems]]||[[-]] |
| |- | | |- |
| |[[Quantum voting based on conjugate coding]] | | |[[Classical Verification of Universal Quantum Computation]]||[[-]] |
| |- | |
| |[[Practical Quantum Electronic Voting]] | |
| |- | | |- |
| ||-||[[Weak String Erasure]] | | ||-||[[Weak String Erasure]] |
| |- | | |- |
| |rowspan="3"|[[Entanglement Routing]]||[[Distributed Routing in a Quantum Internet]] | | {| class="wikitable" |
| | !width="40%"|Nodal Subroutine |
| | !width="60%"|Types |
| |- | | |- |
| |[[Routing Entanglement in the Quantum Internet]] | | ||[[Quantum Cloning]] |
| |- | | |- |
| |[[Distributing Graph States Over Arbitrary Quantum Networks]] | | ||[[Universal Superposition of Orthogonal States|Superposition]] |
| |- | | |- |
| |rowspan="1"|[[Quantum Conference Key Agreement]]||[[Anonymous Conference Key Agreement using GHZ states]] | | |rowspan="3"|[[Quantum Random Number Generator]]||[[Certified finite randomness expansion]] |
| |- | | |- |
| |rowspan="1"|[[Quantum Encryption with Certified Deletion]]||[[Prepare-and-Measure Certified Deletion]]
| | |[[Certified infinite randomness expansion]] |
| |- | | |- |
| | |[[Randomness amplification (8 devices)]] |