Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases (Q942549): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Power of Quantum Computation / 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 quantum algorithms for noncommutative hidden subgroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The quantum query complexity of the hidden subgroup problem is polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3522480 / rank | |||
Normal rank | |||
Latest revision as of 15:21, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases |
scientific article |
Statements
Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases (English)
0 references
5 September 2008
0 references
quantum algorithm
0 references
hidden subgroup problem
0 references
semi-direct product group
0 references
0 references
