ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Kvantekryptering (BB84)×Kvanteteleportasjon×Shors algoritme×
FagfeltKvanteberegningKvanteberegningKvanteberegning
FamilieMachine learningMachine learningMachine learning
Opprinnelsesår198419931994
OpphavspersonCharles Bennett and Gilles BrassardCharles Bennett and colleaguesPeter Shor
TypeCryptographic protocolCommunication protocolQuantum algorithm
Opprinnelig kildeBennett, C. H., Brassard, G. (1984). Quantum cryptography: public key distribution and coin tossing. Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, 175–179. link ↗Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W. K. (1993). Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters, 70, 1895–1899. DOI ↗Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. DOI ↗
AliasBB84, quantum cryptographyteleportation, entanglement-assisted communicationShor factorization, quantum factorization
Relaterte223
SammendragQuantum Key Distribution (QKD) BB84 is a cryptographic protocol allowing two parties to establish a shared secret key using quantum mechanics. Proposed by Bennett and Brassard in 1984, BB84 provides information-theoretic security: an eavesdropper's presence is guaranteed to be detected, and the secret key is provably secure against unlimited computational power.Quantum Teleportation is a protocol for transferring an unknown quantum state between distant parties using entanglement and classical communication. Discovered by Bennett et al. in 1993, teleportation violates no fundamental principles but demonstrates the power of entanglement: an unknown quantum state can be reconstructed at a distant location without ever being transmitted.Shor's Algorithm is a polynomial-time quantum algorithm for factoring large integers and computing discrete logarithms, problems believed to be intractable on classical computers. Discovered by Peter Shor in 1994, it demonstrated the potential of quantum computers to break widely used cryptographic systems like RSA, marking a landmark in quantum computing theory.
ScholarGateDatasett
  1. v1
  2. 3 Kilder
  3. PUBLISHED
  1. v1
  2. 3 Kilder
  3. PUBLISHED
  1. v1
  2. 3 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Quantum Key Distribution (BB84) · Quantum Teleportation · Shor's Algorithm. Hentet 2026-06-17 fra https://scholargate.app/no/compare