EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM (Q5696935): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0102014 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Projective Representations of Minimum Degree of Group Extensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the minimal degrees of projective representations of the finite Chevalley groups / rank | |||
Normal rank | |||
| 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: On the Power of Quantum Computation / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967900748 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 2024
scientific article; zbMATH DE number 2216305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM |
scientific article; zbMATH DE number 2216305 |
Statements
EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM (English)
0 references
19 October 2005
0 references
quantum computing
0 references
hidden subgroup problem
0 references
Black-box groups
0 references
0 references
