Martin Roetteler
Martin Roetteler
Verified email at - Homepage
Cited by
Cited by
Quantum information: An introduction to basic theoretical concepts and experiments
G Alber, T Beth, M Horodecki, P Horodecki, R Horodecki, M Rötteler, ...
Springer, 2003
Constructions of mutually unbiased bases
A Klappenecker, M Rötteler
International Conference on Finite Fields and Applications, 137-144, 2003
Experimental comparison of two quantum computing architectures
NM Linke, D Maslov, M Roetteler, S Debnath, C Figgatt, KA Landsman, ...
Proceedings of the National Academy of Sciences 114 (13), 3305-3310, 2017
Computing local invariants of quantum-bit systems
M Grassl, M Rötteler, T Beth
Physical Review A 58 (3), 1833, 1998
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
M Amy, D Maslov, M Mosca, M Roetteler
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2013
Efficient quantum circuits for non-qubit quantum error-correcting codes
M Grassl, M Rötteler, T Beth
International Journal of Foundations of Computer Science 14 (05), 757-775, 2003
Mutually unbiased bases are complex projective 2-designs
A Klappenecker, M Rotteler
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005
On optimal quantum codes
M Grassl, T Beth, M Roetteler
International Journal of Quantum Information 2 (01), 55-64, 2004
Limitations of quantum coset states for graph isomorphism
S Hallgren, C Moore, M Rötteler, A Russell, P Sen
Journal of the ACM (JACM) 57 (6), 1-33, 2010
Asymmetric quantum codes: constructions, bounds and performance
PK Sarvepalli, A Klappenecker, M Rötteler
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2009
Graphs, quadratic forms, and quantum codes
M Grassl, A Klappenecker, M Rotteler
Proceedings IEEE International Symposium on Information Theory,, 45, 2002
Beyond stabilizer codes. I. Nice error bases
AA Klappenecker, M Rotteler
IEEE Transactions on Information Theory 48 (8), 2392-2395, 2002
Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups
M Roetteler, T Beth
arXiv preprint quant-ph/9812070, 1998
Applying Grover’s algorithm to AES: quantum resource estimates
M Grassl, B Langenberg, M Roetteler, R Steinwandt
Post-Quantum Cryptography, 29-43, 2016
Q# Enabling Scalable Quantum Computing and Development with a High-level DSL
K Svore, A Geller, M Troyer, J Azariah, C Granade, B Heim, V Kliuchnikov, ...
Proceedings of the Real World Domain Specific Languages Workshop 2018, 1-10, 2018
Discrete cosine transforms on quantum computers
A Klappenecker, M Rotteler
ISPA 2001. Proceedings of the 2nd International Symposium on Image and …, 2001
Efficient synthesis of universal repeat-until-success quantum circuits
A Bocharov, M Roetteler, KM Svore
Physical review letters 114 (8), 080502, 2015
Universal simulation of Hamiltonians using a finite set of control operations
P Wocjan, M Rötteler, D Janzing, T Beth
arXiv preprint quant-ph/0109063, 2001
Simulating Hamiltonians in quantum networks: Efficient schemes and complexity bounds
P Wocjan, M Rötteler, D Janzing, T Beth
Physical Review A 65 (4), 042309, 2002
General scheme for perfect quantum network coding with free classical communication
H Kobayashi, F Le Gall, H Nishimura, M Rötteler
International Colloquium on Automata, Languages, and Programming, 622-633, 2009
The system can't perform the operation now. Try again later.
Articles 1–20