Theoremadvanced
Discrete logarithm is in BQP
Discrete logarithms in standard groups are solvable in quantum polynomial time.
Discrete logarithms in standard groups are solvable in quantum polynomial time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag SAF228 Edit this page History Report an error