Quantum Computing
Members , Projects , Publications
, Contact
This page is under construction .....
Current and past members:
Katalin Friedl
Gábor Ivanyos
Attila Nagy
Lajos Rónyai
Csaba Schneider
back to top
Past projects:
RESQ: Resources for
Quantum
Information, IST-2001-37559 (2003-2006).
QUIPROCONE:
Quantum
Information Processing and Communications Network of Excellence
(2000-2003).
back to top
Recent papers and reports:
T. Decker, G. Ivanyos, M. Santha, P. Wocjan,
Hidden symmetry subgroup problems,
arXiv:1107.2189
[quant-ph].
G. Ivanyos, Finding hidden Borel subgroups of the general
linear group,
Quantum Information and Computation 12 (2012),
0661-0669.
Preprint:
arXiv:1105.4416
[quant-ph].
G. Ivanyos, M. Santha, L. Sanselme,
An efficient quantum algorithm for the hidden subgroup problem in
nil-2 groups,
Proc LATIN'08 (Springer Vol. LNCS 4957), 759-771.
Journal version: Algoritmica 62 (2012),
480-498.
Preprint: arXiv:0707.1260
[quant-ph].
G. Ivanyos,
On solving systems of random linear disequations,
Quantum Information and Computation 8 (2008), 0579-0594.
Preprint: arXiv:0704.2988
[quant-ph].
G. Ivanyos, A. B. Nagy, L. Rónyai,
Constructions for quantum computing with symmetrized gates,
Quantum Information and Computation 8 (2008), 0411-0429.
Preprint:
quant-ph/0608241.
G. Ivanyos, M. Santha, L. Sanselme,
An efficient quantum algorithm for the hidden subgroup problem in
extraspecial groups,
Proc STACS'07, Springer LNCS Vol. 4393,
586-597.
Preprint:
quant-ph/0701235.
A. B. Nagy, Cs. Schneider,
SKA:
An implementation of the Solovay-Kitaev Algorithm, Version 0.1.
Article:
A. B. Nagy,
On an implementation of the Solovay-Kitaev algorithm,
Proc. 10th Rhine Workshop on Computer Algebra (RWCA 2006)
201-208.
Reprint:
quant-ph/0606077.
K. Friedl, G. Ivanyos, M. Santha, Y. F. Verhoeven,
Locally 2-dimensional Sperner problems complete for the
polynomial parity
argument classes,
Proc. 6th Italian Conference on Algorithms and Complexity
(CIAC 2006), Springer LNCS Vol. 3998 / 2006,
380-391.
Preprint of the full version:
http://www.lri.fr/~verhoeve/papers/Sperner_2D.pdf.
G. Ivanyos,
Deciding universality of quantum gates,
J. Algebra 310 (2007),
49-56.
Preprint: quant-ph/0603009.
G. Ivanyos, S. Massar, A. B. Nagy,
Quantum computing on lattices using global
two-qubit gates,
Physical Review A. Vol. 72, No. 2,
022339 (9 pages).
Preprint: quant-ph/0502142.
K. Friedl, G. Ivanyos, M. Santha, Y. F. Verhoeven,
On the black-box complexity of Sperner's
Lemma,
Proc. 15th International Symp. on Fundaments of Computation
Theory, Springer LNCS Vol. 3623 / 2005,
245-257.
Preprint of the full version:
quant-ph/0505185.
K. Friedl, G. Ivanyos, M. Santha, Efficient testing of groups,
Proc. 37th ACM STOC (2005), 157-166.
Preprint: ps
at Miklos.
Study of a quantum computer based on
atoms in optical lattices
K. Friedl, G. Ivanyos, F. Magniez, M. Santha, P. Sen, Hidden
translation
and orbit coset in quantum computing,
35th ACM STOC (2003), 1-9.
Preprint: quant-ph/0211091,
a
fresher
version (pdf) at Fred.
K. Friedl, F. Magniez, M. Santha, P. Sen, Quantum testers for
hidden
group properties.
Proc. MFCS'03, Springer LNCS Vol. 2747/2003,
419-428.
Preprint: quant-ph/0208184.
G. Ivanyos, F. Magniez, M. Santha,
Efficient quantum algorithms for some
instances of the non-Abelian hidden subgroup problem,
Journal of Foundations of Computer Science 14 No 5 (2003), 723-739.
Preliminary extended abstract:
Proc. 13th SPAA (2001), 263-270.
Preprint: quant-ph/0102014
back to top
Slides of talks, tutorials, etc.
G. Ivanyos,
Shor's discrete log algorithm
, in Hungarian. University of Debrecen, 2011.
G. Ivanyos,
On solving disequations
, in Hungarian. MTA SZTAKI 2010.
G. Ivanyos,
Tutorial lectures on fast quantum
algorithms
,
De Brún Centre for Computational Algebra, Galway, 2009.
G. Ivanyos,
Rejtett részcsoprtok és
kvantumszámítógépek
(Hidden subgroups and quantum computers, in Hungarian)
Notes (pdf) for a talk given at the Hungarian Academy of Sciences,
2007.
G. Ivanyos,
Hidden subgroup minicourse, CWI Amsterdam, 2006.
K. Friedl, G. Ivanyos,
Quantum algorithms for groups, Groups and Probability,
Budapest, 2003.
Part I. (ps.gz),
Part
II. (ps.gz).
Miklos Santha's
Introduction to Quantum Computing (pdf)
during his visit at the Center of Excellence MTA SZTAKI
(2003).
back to top
Contact:
Gábor Ivanyos
Informatics Laboratory
MTA
SZTAKI
(
Institute for Computer Science and Control, Hungarian Academy of Sciences)
Kende u. 13-17
H-1111
Budapest,
Hungary
Phone: +361 2796164
Fax: +361 2095269
E-mail:
Gabor.Ivanyos sztaki mta hu
back to top
This page is maintained by Gábor
Ivanyos. Last update: March 19, 2013.
back to top