Quantum computing

• Quantum algorithms for highly non-linear Boolean functions,
  M. Rötteler,
  Proceedings SODA'10, ACM-SIAM press, 2010 (accepted for publication).

• Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm,
  M. Rötteler,
  Proceedings MFCS'09, LNCS, vol. 5734, pp. 663-674. Springer, 2009.
  

• An efficient quantum algorithm for the hidden subgroup problem over Weyl-Heisenberg groups,
  H. Krovi and M. Rötteler,
  Proceedings MMICS'08, LNCS, vol. 5393, pp. 70-88, Springer, 2008.

• Random measurement bases, quantum state distinction and applications to the hidden subgroup problem,
  J. Radhakrishnan, M. Rötteler, and P. Sen,
  Algorithmica, vol. 55, no. 3, pp. 490-516, 2009.

• Quadratic form expansions for unitaries,
  N. de Beaudrap, V. Danos, E. Kashefi, and M. Rötteler,
  Proceedings TQC'08, LNCS, vol. 5106, pp. 29-46, Springer, 2008.

• Dynamical decoupling schemes derived from Hamilton cycles,
  M. Rötteler,
  Journal of Mathematical Physics, 49:042106, 2008.

• Representation-theoretical properties of the approximate quantum Fourier transform,
  M. Rötteler and Th. Beth,
  Applicable Algebra in Engineering, Communication and Computing, vol. 19, Issue 3, pp. 177-193. Springer, 2008.

• Limitations of quantum coset states for graph isomorphism,
  S. Hallgren, C. Moore, M. Rötteler, A. Russell, and P. Sen,
  Proceedings 38th ACM Symposium on Theory of Computing (STOC'06), pp. 604-617, 2006.

• Efficient quantum algorithms (in German),
  A. Klappenecker and M. Rötteler,
  it - Information Technology (Oldenbourg), vol. 48, Issue 6, pp. 344-353, 2006.

• Quantum algorithms: a survey of some recent results,
  M. Rötteler,
  Informatik - Forschung und Entwicklung (Springer), vol. 21, no. 1-2, pp. 3-20, 2006.

• Equivalence of decoupling schemes and orthogonal arrays,
  M. Rötteler and P. Wocjan,
  IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4171-4181, 2006.

• Thresholds for linear optics quantum computing with photon loss at the detectors,
  M. Silva, M. Rötteler, and Ch. Zalka,
  Physical Review A, 72:032307, 2005.

• Solution to the Mean King's problem in prime power dimensions using discrete tomography,
  A. Klappenecker and M. Rötteler,
  Proceedings 2005 Workshop on Discrete Tomography, Electronic Notes in Discrete Mathematics, Elsevier, Vol. 20, pp. 165-177, 2005.
  

• On the power of random bases in Fourier sampling: hidden subgroup problem in the Heisenberg group,
  J. Radhakrishnan, M. Rötteler, and P. Sen,
  Proceedings ICALP'05, LNCS, vol. 3580, pp. 1399-1411, Springer, 2005.

• Implementation of group-covariant POVMs by orthogonal measurements,
  Th. Decker, D. Janzing, and M. Rötteler,
  Journal of Mathematical Physics, 46:012104, 2005.

• Quantum software reusability,
  A. Klappenecker and M. Rötteler,
  International Journal of Foundations of Computer Science, vol. 14, no. 5, pp. 777-796, 2003.

• Engineering functional quantum algorithms,
  A. Klappenecker and M. Rötteler,
  Physical Review A, 67:010302, 2003.

• Algorithms for quantum systems - quantum algorithms,
  Th. Beth, M. Grassl, D. Janzing, M. Rötteler, P. Wocjan, and R. Zeier,
  In: Quantum Information Processing, Edited by G. Leuchs and Th. Beth, Wiley-VCH, pp. 1-13, 2003.

• Universal simulation of Hamiltonians using a finite set of control operations,
  P. Wocjan, M. Rötteler, D. Janzing, and Th. Beth,
  Quantum Information and Computation, vol. 2, no. 2, pp. 133-150, 2002.

• Simulating Hamiltonians in quantum networks: efficient schemes and complexity bounds,
  P. Wocjan, M. Rötteler, D. Janzing, and Th. Beth,
  Physical Review A, 65:042309 2002.

• Quantum information: an introduction to basic theoretical concepts and experiments,
  G. Alber, Th. Beth, M. Horodecki, P. Horodecki, R. Horodecki, M. Rötteler, H. Weinfurter, R. Werner, and A. Zeilinger,
  Springer Tracts in Modern Physics, vol. 172, Springer Verlag, 2001.

• Discrete cosine transforms on quantum computers,
  A. Klappenecker and M. Rötteler,
  Proceedings IEEE R8-EURASIP Symposium on Image and Signal Processing and Analysis (ISPA01), pp. 464-468, Pula, Croatia, 2001.

• On the irresistible efficiency of signal processing methods in quantum computing,
  A. Klappenecker and M. Rötteler,
  Proceedings of the First International Workshop on Spectral Techniques and Logic Design for Future Digital Systems, Tampere, Finland, 2000.

• Efficient realisation of discrete cosine transforms on a quantum computer,
  M. Rötteler and Th. Beth,
  Proceedings X. International Symposium on Theoretical Electrical Engineering (ISTET'99), pp. 85-89, 1999.

• Fast signal transforms for quantum computers,
  M. Püschel, M. Rötteler, and Th. Beth,
  Proceedings PII99-Workshop, Heidelberg, March 15-16, 1999.

• Quantum Fourier transforms for a class of non-abelian groups,
  M. Rötteler, M. Püschel, and Th. Beth,
  Proceedings AAECC-13, LNCS, vol. 1719, pp. 148-159. Springer, 1999.

• Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups,
  M. Rötteler and Th. Beth,
  ArXiv preprint quant-ph/9812070, 1998.

Quantum codes

• General scheme for perfect quantum network coding with free classical communication,
  H. Kobayashi, F. Le Gall, H. Nishimura und M. Rötteler,
  Proceedings ICALP'09, LNCS, vol. 5555, pp. 622-633. Springer, 2009.
  

• New decoding algorithms for a class of subsystem codes and generalized Shor codes,
  P.K. Sarvepalli, M. Rötteler, and A. Klappenecker,
  Proceedings IEEE International Symposium on Information Theory (ISIT'09), pp. 804-808, 2009.

• Asymmetric quantum codes: constructions, bounds, and performance,
  P.K. Sarvepalli, A. Klappenecker, and M. Rötteler,
  Proceedings of the Royal Society London, Ser. A, vol. 465, no. 2105, pp. 1645-1672, 2009.

• Quantum error correction and fault tolerant quantum computing,
  M. Grassl and M. Rötteler,
  In R. A. Meyers, editor, Encyclopedia of Complexity and Systems Science, Springer, pp. 7324-7342, 2009.

• Quantum error correction,
  M. Rötteler,
  Encyclopedia of Algorithms, Ming-Yang Kao (editor), pp. 705-708. Springer, 2008.

• Quantum Goethals-Preparata codes,
  M. Grassl and M. Rötteler,
  Proceedings IEEE International Symposium on Information Theory (ISIT'08), pp. 300-304, 2008.

• Asymmetric quantum LDPC codes,
  P.K. Sarvepalli, M. Rötteler, and A. Klappenecker,
  Proceedings IEEE International Symposium on Information Theory (ISIT'08), pp. 305-309, 2008.

• Non-additive quantum codes from Goethals and Preparata codes,
  M. Grassl and M. Rötteler,
  Proceedings 2008 IEEE Information Theory Workshop (ITW'08), pp. 396-400, 2008.

• Quantum convolutional BCH codes,
  S. Aly, M. Grassl, A. Klappenecker, M. Rötteler, and P. Sarvepalli,
  Proceedings 10th Canadian Workshop on Information Theory (CWIT'07), pp. 180-183, 2007.

• Constructions of quantum convolutional codes,
  M. Grassl and M. Rötteler,
  Proceedings IEEE International Symposium on Information Theory (ISIT'07), pp. 816-820, 2007.

• Noncatastrophic encoders and encoder inverses for quantum convolutional codes,
  M. Grassl and M. Rötteler,
  Proceedings IEEE International Symposium on Information Theory (ISIT'06), pp. 1109-1113, 2006.

• Quantum convolutional codes: encoders and structural properties,
  M. Grassl and M. Rötteler,
  Proceedings 44th Allerton Conference on Communication, Control, and Computing, 2006.

• Mutually unbiased bases are complex projective 2-designs,
  A. Klappenecker and M. Rötteler,
  Proceedings of the 2005 IEEE International Symposium on Information Theory (ISIT'05), pp. 1740-1744, 2005.

• Quantum block and convolutional codes from self-orthogonal product codes,
  M. Grassl and M. Rötteler,
  Proceedings of the 2005 IEEE International Symposium on Information Theory (ISIT'05), pp. 1018-1022, 2005.

• Mutually unbiased bases, spherical designs, and frames,
  A. Klappenecker and M. Rötteler,
  Proceedings of SPIE International Symposium on Optics and Photonics, Wavelets XI, vol. 5914, pp. 59140P (13 pages), 2005.

• On approximately symmetric informationally complete POVMs and related systems of quantum states,
  A. Klappenecker, M. Rötteler, I. Shparlinski, and A. Winterhof,
  Journal of Mathematical Physics, 46:082104, 2005.

• On the monomiality of nice error bases,
  A. Klappenecker and M. Rötteler,
  IEEE Transactions on Information Theory, vol. 51, no. 3, pp. 1084-1089, 2005.

• On the structure of nonstabilizer Clifford codes,
  A. Klappenecker and M. Rötteler,
  Quantum Information and Computation, vol. 4, no. 2, pp. 152-160, 2004.

• Remarks on Clifford codes,
  A. Klappenecker and M. Rötteler,
  Proceedings IEEE International Symposium on Information Theory (ISIT'04), p. 354, 2004.

• On optimal quantum codes,
  M. Grassl, Th. Beth, and M. Rötteler,
  International Journal of Quantum Information, vol. 2, no. 1, pp. 55-64, 2004.

• On quantum MDS codes,
  M. Rötteler, M. Grassl, and Th. Beth,
  Proceedings IEEE International Symposium on Information Theory (ISIT'04), p. 356, 2004.

• Constructions of mutually unbiased bases,
  A. Klappenecker and M. Rötteler,
  Proceedings International Conference on Finite Fields and Applications, LNCS, vol. 2948, pp. 137-144. Springer, 2004.
  

• Unitary error bases: constructions, equivalence, and applications,
  A. Klappenecker and M. Rötteler,
  Proceedings AAECC-15, LNCS, vol. 2643, pp. 139-149, Springer, 2003.

• Efficient quantum circuits for non-qubit quantum error-correcting codes,
  M. Grassl, M. Rötteler, and Th. Beth,
  International Journal of Foundations of Computer Science, vol. 14, no. 5, pp. 757-775, 2003.

• Graphs, quadratic forms, and quantum codes,
  M. Grassl, A. Klappenecker, and M. Rötteler,
  Proceedings IEEE International Symposium on Information Theory (ISIT'02), p. 45, 2002.

• Clifford codes,
  A. Klappenecker and M. Rötteler,
  In: The Mathematics of Quantum Computation (ed. by R. Brylinski and G. Chen), pp. 253-273. CRC Press, 2002.

• Beyond stabilizer codes I: nice error bases,
  A. Klappenecker and M. Rötteler,
  IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2392-2395, 2002.

• Beyond stabilizer codes II: Clifford codes,
  A. Klappenecker and M. Rötteler,
  IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2396-2399, 2002.

Signal processing and parallel computing

• A hybrid nano-CMOS architecture for defect and fault tolerance,
  M. Simsir, S. Cadambi, F. Ivancic, M. Rötteler, and N. Jha,
  ACM Journal on Emerging Technologies in Computing Systems, vol. 5, no. 3, pp. 14:2-14:26, 2009.

• Using hardware transactional memory for data race detection,
  S. Gupta, F. Sultan, S. Cadambi, F. Ivancic, and M. Rötteler,
  Proceedings IEEE International Parallel and Distributed Processing Symposium (IPDPS'09), pp. 1-11, 2009.

• Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice,
  M. Püschel and M. Rötteler,
  Applicable Algebra in Engineering, Communication and Computing, vol. 19, Issue 3, pp. 259-292. Springer, 2008.

• RaceTM: detecting data races using hardware transactional memory (brief announcement),
  S. Gupta, F. Sultan, S. Cadambi, F. Ivancic, and M. Rötteler,
  Proceedings 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'08), pp. 104-106, 2008.

• Fault-tolerant computing using a hybrid nano-CMOS architecture,
  M. Simsir, S. Cadambi, F. Ivancic, M. Rötteler, and N. Jha,
  Proceedings 21th Conference on VLSI Design (VLSI'08), pp. 435-440, 2008.

• Algebraic signal processing theory: 2-D spatial hexagonal lattice,
  M. Püschel and M. Rötteler,
  IEEE Transactions on Image Processing, vol. 16, no. 6, pp. 1506-1521, 2007.

• Fourier transform for the spatial quincunx lattice,
  M. Püschel and M. Rötteler,
  Proceedings ICIP, vol. 2, pp. 494-497, Genova, September 2005.

• Fourier transform for the directed quincunx lattice,
  M. Püschel and M. Rötteler,
  Proceedings ICASSP, vol. 4, pp. 401-404, Philadelphia, March 2005.

• Cooley-Tukey FFT like algorithm for the discrete triangle transform,
  M. Püschel and M. Rötteler,
  Proceedings IEEE DSP Workshop, Taos, August 2004.

• The discrete triangle transform,
  M. Püschel and M. Rötteler,
  Proceedings ICASSP, vol. 3, pp. 44-48, Montreal, May 2004.

Algebra

• On minimal length factorizations of finite groups,
  M.-I. Gonzalez Vasco, M. Rötteler, and R. Steinwandt,
  Experimental Mathematics, vol. 12, no. 1, pp. 1-12. A K Peters, 2003.

• Homogeneous bent functions, invariants, and designs,
  Ch. Charnes, M. Rötteler, and Th. Beth,
  Designs, Codes, and Cryptography, vol. 26, no. 1-3, pp. 139-154, 2002.

• On homogeneous bent functions,
  Ch. Charnes, M. Rötteler, and Th. Beth,
  Proceedings AAECC-14, LNCS, vol. 2227, pp. 249-259, Springer, 2001.

• Decomposing a matrix into circulant and diagonal factors,
  M. Schmid, R. Steinwandt, J. Müller-Quade, M. Rötteler, and Thomas Beth,
  Linear Algebra and its Applications, vol. 306, pp. 131-143. Elsevier, 2000.

• Separation of orbits under group actions with an application to quantum systems,
  M. Rötteler and J. Müller-Quade,
  Applicable Algebra in Engineering, Communication and Computing, vol. 10, Issue 4/5, pp. 279-303. Springer, 2000.

• Von N^2 nach log^2 N - Zur algebraischen Berechnungskomplexität allgemeiner Fouriertransformationen (in German),
  B. Grohmann and M. Rötteler,
  Proceedings GI Jahrestagung (Paderborn), 247-256, 1999.

• Deciding linear disjointness of finitely generated fields,
  J. Müller-Quade and M. Rötteler,
  Proceedings of ISSAC'98, pp. 153-160, ACM Press, 1998.

• Computing local invariants of quantum-bit systems,
  M. Grassl, M. Rötteler, and Th. Beth,
  Phys. Rev. A., vol. 58, no. 3, pp. 1833-1839, 1998.

Other publications

• In memoriam: Thomas Beth,
  M. Grassl, A. Klappenecker and M. Rötteler,
  Quantum Information Processing, vol. 5, no. 1, pp. 1-4, 2006.

• New tales of the Mean King,
  A. Klappenecker and M. Rötteler,
  ArXiv preprint quant-ph/0502138, 2005.

• Comment on "probabilistic quantum memories",
  T. Brun, H. Klauck, A. Nayak, M. Rötteler, and Ch. Zalka,
  Physical Review Letters, 91:209801, 2003.

• Fast signal transforms for quantum computers (in German)
  M. Rötteler,
  Ph.D. Thesis, Universität Karlsruhe (TH), July 2001.

• Invariant theory of finite and compact groups (in German)
  M. Rötteler,
  Diploma Thesis, Universität Karlsruhe (TH), September 1997.