Roetteler, Martin

A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 549

Experimental comparison of two quantum computing architectures

Linke, N. M., Maslov, D., Roetteler, M., Debnath, S., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2017) · Proceedings of the National Academy of Sciences

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 508

Applying Grover’s Algorithm to AES: Quantum Resource Estimates

Grassl, M., Langenberg, B., Roetteler, M., & Steinwandt, R. (2016) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureCryptographic Implementations and Security

Cited by 299

Quantum computing enhanced computational catalysis

von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2020) · arXiv

Quantum Computing Algorithms and ArchitectureAdvanced Chemical Physics Studies

Cited by 258

Implementing Grover oracles for quantum key search on AES and LowMC

Jaques, S., Naehrig, M., Roetteler, M., & Virdia, F. (2019) · arXiv

Cryptographic Implementations and SecurityQuantum Computing Algorithms and Architecture

Cited by 236

Implementing Grover Oracles for Quantum Key Search on AES and LowMC

Jaques, S., Naehrig, M., Roetteler, M., & Virdia, F. (2020) · Lecture Notes in Computer Science

Cryptographic Implementations and SecurityQuantum Computing Algorithms and Architecture

Cited by 234

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms

Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 212

Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits

Bocharov, A., Roetteler, M., & Svore, K. M. (2015) · Physical Review Letters

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 142

Factoring using $2n+2$ qubits with Toffoli based modular multiplication

Haner, T., Roetteler, M., & Svore, K. M. (2017) · Quantum Information and Computation

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 90

Improved Quantum Circuits for Elliptic Curve Discrete Logarithms

Häner, T., Jaques, S., Naehrig, M., Roetteler, M., & Soeken, M. (2020) · Lecture Notes in Computer Science

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 76

Improved reversible and quantum circuits for Karatsuba-based integer multiplication

Parent, A., Roetteler, M., & Mosca, M. (2018) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 24

Advances in compilation for quantum hardware -- A demonstration of magic state distillation and repeat-until-success protocols

Brown, N. C., Campora, J. P., Granade, C., Heim, B., Wernli, S., Ryan-Anderson, C., Lucchetti, D., Paetznick, A., Roetteler, M., Svore, K., et al. (2023) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 4

Quantum Circuits for Functionally Controlled NOT Gates

Soeken, M., & Roetteler, M. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 4