Shor's Factoring Algorithm and Modular Exponentiation Operators (Q6143096): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure communications over insecure channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and Quantum Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalability of Shor’s algorithm with a limited set of rotation gates / rank
 
Normal rank

Latest revision as of 21:03, 23 August 2024

scientific article; zbMATH DE number 7793671
Language Label Description Also known as
English
Shor's Factoring Algorithm and Modular Exponentiation Operators
scientific article; zbMATH DE number 7793671

    Statements