Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4255836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1308691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer |
scientific article; zbMATH DE number 1308691 |
Statements
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (English)
0 references
27 June 1999
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
0.9800758361816406
0 references
0.8052259683609009
0 references
0.7983464598655701
0 references
