32 citations · 157 across the 38 of their papers we have counts for
45 papers
Beyond odd characteristic: Faster isomorphism testing of 2-groups of Frattini class 2
Joshua A. Grochow, Gábor Ivanyos, Youming Qiao +1
The finite group isomorphism problem asks whether two finite groups of order are isomorphic. The first algorithm, attributed to Tarjan (see Miller, STOC '78), runs in time $N^{…
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
Jonathan Allcock, Joao F. Doriguello, Gábor Ivanyos +1
Bell sampling is a simple yet powerful tool based on measuring two copies of a quantum state in the Bell basis, and has found applications in a plethora of problems related to stab…
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
Jonathan Allcock, Joao F. Doriguello, Gábor Ivanyos +1
Bell sampling is a simple yet powerful measurement primitive that has recently attracted a lot of attention, and has proven to be a valuable tool in studying stabiliser states. Unf…
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
Muhammad Imran, Gábor Ivanyos
The semidirect discrete logarithm problem (SDLP) is the following analogue of the standard discrete logarithm problem in the semidirect product semigroup …
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH
Mingjie Chen, Muhammad Imran, Gábor Ivanyos +3
The Isogeny to Endomorphism Ring Problem (IsERP) asks to compute the endomorphism ring of the codomain of an isogeny between supersingular curves in characteristic given only a…
Zero sum subsequences and hidden subgroups
Muhammad Imran, Gabor Ivanyos
We propose a method for solving the hidden subgroup problem in nilpotent groups. The main idea is iteratively transforming the hidden subgroup to its images in the quotient groups…