Metraipolis › archive › dc_418bf1dd3b3d
Quantum fingerprinting — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Quantum_fingerprinting
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T23:50:35.431Z
- SHA-256 of the archived text
b61445d5baeddead8c48b4ae681d139f306763134224bba11407ea52ea2ee39a- Stable URL of this page
https://metraipolis.com/documento/dc_418bf1dd3b3d
How to cite
Quantum fingerprinting — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_fingerprinting (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_418bf1dd3b3d (Metraipolis archive dc_418bf1dd3b3d, sha256 b61445d5baeddead8c48b4ae681d139f306763134224bba11407ea52ea2ee39a)
BibTeX
@misc{dc418bf1dd3b3d,
title = {Quantum fingerprinting — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Quantum_fingerprinting},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_418bf1dd3b3d; sha256 b61445d5baeddead8c48b4ae681d139f306763134224bba11407ea52ea2ee39a},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_fingerprinting. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 n {\displaystyle n} -bit strings x {\displaystyle x} and y {\displaystyle y} . Their goal and a referee's is to obtain the correct value of f ( x , y ) = { 1 if x = y , 0 if x ≠ y . {\displaystyle f(x,y)={\begin{cases}1&{\text{if }}x=y,\\0&{\text{if }}x\neq y.\\\end{cases}}} . To do this, 2 n {\displaystyle 2^{n}} quantum states are produced from the O(logn)-qubit state 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 Carter–Wegman MAC, 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.
Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; categoria «Cryptographic hash functions»).
Fonte: Wikipedia in inglese, voce «Quantum fingerprinting» — https://en.wikipedia.org/wiki/Quantum_fingerprinting
Wikidata Q7269049 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7269049
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_fingerprinting?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1358553931, consultata il 2026-10-05T23:20:37.340Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ff3c7ddc032a55e0ad95f45f41be19cfa4d3c9b0499a47378f1d08bf7916fe24