Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4376179)

From MaRDI portal
Revision as of 19:18, 17 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55869064, #quickstatements; #temporary_batch_1705514146057)
scientific article; zbMATH DE number 1116368
Language Label Description Also known as
English
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
scientific article; zbMATH DE number 1116368

    Statements

    Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (English)
    0 references
    0 references
    10 February 1998
    0 references
    algorithmic number theory
    0 references
    prime factorization
    0 references
    discrete logarithms
    0 references
    Church's thesis
    0 references
    quantum computers
    0 references
    foundations of quantum mechanics
    0 references
    spin systems
    0 references
    Fourier transforms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references