Quantum Computation

at the Informatics Laboratory of MTA SZTAKI.

Members , Projects , Publications , Contact

This page is under construction .....

Current members:

Attila Nagy

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:

G. Ivanyos, On solving systems of random linear disequations,
Quantum Information and Computation, to appear.
Preprint: arXiv:0704.2988 [quant-ph].

G. Ivanyos, M. Santha, L. Sanselme, An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups,
Proc LATIN'08, to appear.
Preprint: arXiv:0707.1260 [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, 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