dbo:abstract
|
- Quantum fingerprinting is a proposed technique that uses a quantum computer to generate a string with a similar function to the cryptographic hash function. Alice and Bob hold -bit strings and . Their goal and a referee's is to obtain the correct value of . To do this, quantum states are produced from the fingerprints and sent to the referee who performs the Swap test to detect if the fingerprints are similar or different with a high probability. If unconditional guarantees of security are needed, and if it is impractical for the communicating parties to arrange to share a secret that can be used in a , this technique might one day be faster than classical techniques given a quantum computer with 5 to 10 qubits. However, these circumstances are very unusual and it is unlikely the technique will ever have a practical application; it is largely of theoretical interest. (en)
|
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 1746 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
dbp:wikiPageUsesTemplate
| |
dct:subject
| |
gold:hypernym
| |
rdf:type
| |
rdfs:comment
|
- Quantum fingerprinting is a proposed technique that uses a quantum computer to generate a string with a similar function to the cryptographic hash function. Alice and Bob hold -bit strings and . Their goal and a referee's is to obtain the correct value of . To do this, quantum states are produced from the fingerprints and sent to the referee who performs the Swap test to detect if the fingerprints are similar or different with a high probability. (en)
|
rdfs:label
|
- Quantum fingerprinting (en)
|
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:knownFor
of | |
is dbo:wikiPageRedirects
of | |
is dbo:wikiPageWikiLink
of | |
is dbp:knownFor
of | |
is foaf:primaryTopic
of | |