Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (Q4376179): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/9508027 / rank | |||
Normal rank | |||
Latest revision as of 17:35, 19 April 2024
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
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
