Skip to main content

Publications

2008

Quantum Information and Computation, 8 (5)., pp. 411-429.

Constructions for quantum computing with symmetrized gates

Authors
Ivanyos, Gábor
Nagy, Attila B.
Rónyai, Lajos
Read more
2014

QUANTUM INFORMATION & COMPUTATION, 14 (9-10)., pp. 790-806. ISSN 1533-7146

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems

Authors
Decker, Thomas
Høyer, Peter
Ivanyos, Gábor
Santha, Miklos
Read more
2018

COMPUTATIONAL COMPLEXITY, 27 (4)., pp. 561-593. ISSN 1016-3328

Constructive non-commutative rank computation is in deterministic polynomial time

Authors
Ivanyos, Gábor
Qiao, Y.
Subrahmanyam, K.V.
Read more
2001

In: 13th annual symposium on parallal algorithms and architectures. SPAA 2001. Crete Island, Proceedings..

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Authors
Ivanyos, Gábor
Magniez, F.
Sántha, M.
Read more
2012

QUANTUM INFORMATION & COMPUTATION, 12 (7-8)., pp. 0661-0669. ISSN 1533-7146

Finding hidden Borel subgroups of the general linear group

Authors
Ivanyos, Gábor
Read more
2015

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 81, pp. 1373-1386. ISSN 0022-0000

Generalized Wong sequences and their applications to Edmonds' problems

Authors
Ivanyos, Gábor
Karpinski, M
Qiao, Y
Santha, M
Read more
1996

DISCRETE MATHEMATICS, 153 (1-3)., pp. 177-188.

Lattice basis reduction for indefinite forms and an application

Authors
Ivanyos, Gábor
Szántó, Á.
Read more
2005

LECTURE NOTES IN COMPUTER SCIENCE, 3623, pp. 234-246.

On the black-box complexity of Sperner's Lemma

Authors
Friedl, K.
Ivanyos, Gábor
Santha, M.
Verhoeven, YF
Read more
2007

European Journal of Combinatorics, 28, pp. 1419-1441.

Root shadow spaces

Authors
Cohen, Arjeh M.
Ivanyos, Gábor
Read more
2012

ALGORITHMICA, 62 (1-2)., pp. 480-498. ISSN 0178-4617

An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

Authors
Ivanyos, Gábor
Sanselme, L
Santha, M
Read more