Presentation | 2008-04-18 Quantum Isomorphism Testing for Semidirect Product Groups Yoshifumi INUI, GALL Francois LE, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | The group isomorphism problem asks whether two given groups are isomorphic or not, a problem closely connected to the graph isomorphism problem. In this paper, we given an efficient quantum algorithm solving this problem for a class of solvable groups, including the class of semidirect product groups of the form Z_ ⋊Z_q where p and q are distinct primes. The running time of this algorithm is polylogarithmic in the orders of the input groups. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Group Isomorphism / Solvable Groups / Semidirect Product |
Paper # | COMP2008-5 |
Date of Issue |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 2008/4/11(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Theoretical Foundations of Computing (COMP) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Quantum Isomorphism Testing for Semidirect Product Groups |
Sub Title (in English) | |
Keyword(1) | Group Isomorphism |
Keyword(2) | Solvable Groups |
Keyword(3) | Semidirect Product |
1st Author's Name | Yoshifumi INUI |
1st Author's Affiliation | Graduate School of Information Science and Technology, The University of Tokyo() |
2nd Author's Name | GALL Francois LE |
2nd Author's Affiliation | ERATO-SORST Quantum Computation and Information Project, JST |
Date | 2008-04-18 |
Paper # | COMP2008-5 |
Volume (vol) | vol.108 |
Number (no) | 11 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |