default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Rötteler
Martin Roetteler
Person information
- affiliation: Microsoft Research, Redmond, WA USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c67]Tommy Nguyen, Yue Shi, Samuel Alexander Stein, Tim Stavenger, Marvin Warner, Martin Roetteler, Torsten Hoefler, Ang Li:
A Reference Implementation for a Quantum Message Passing Interface. QCE 2023: 292-293- [c66]Yue Shi
, Tommy Nguyen, Samuel Alexander Stein, Tim Stavenger, Marvin Warner, Martin Roetteler, Torsten Hoefler, Ang Li:
A Reference Implementation for a Quantum Message Passing Interface. SC Workshops 2023: 1420-1425 - [i75]Bo Peng, Yuan Su, Daniel Claudino, Karol Kowalski, Guang Hao Low, Martin Roetteler:
Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis. CoRR abs/2307.06580 (2023) - 2022
- [i74]Thomas Lubinski, Cassandra Granade, Amos Anderson, Alan Geller, Martin Roetteler, Andrei Petrenko, Bettina Heim:
Advancing Hybrid Quantum-Classical Computation with Real-Time Execution. CoRR abs/2206.12950 (2022) - [i73]Duo Song, Nicholas P. Bauman, Guen Prawiroatmodjo, Bo Peng, Cassandra Granade, Kevin M. Rosso, Guang Hao Low, Martin Roetteler, Karol Kowalski, Eric J. Bylaska:
Periodic Plane-Wave Electronic Structure Calculations on Quantum Computers. CoRR abs/2208.04444 (2022) - [i72]Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken, Alexander Vaschillo:
QParallel: Explicit Parallelism for Programming Quantum Computers. CoRR abs/2210.03680 (2022) - [i71]Rajiv Krishnakumar, Mathias Soeken, Martin Roetteler, William J. Zeng:
A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions. CoRR abs/2210.11786 (2022) - [i70]Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken:
Space-time optimized table lookup. CoRR abs/2211.01133 (2022) - 2021
- [c65]Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler:
Quantum algorithms for reinforcement learning with a generative model. ICML 2021: 10916-10926 - [c64]Ang Li, Bo Fang, Christopher E. Granade, Guen Prawiroatmodjo, Bettina Heim, Martin Roetteler, Sriram Krishnamoorthy:
SV-sim: scalable PGAS-based state vector simulation of quantum circuits. SC 2021: 97 - [i69]Daochen Wang, Aarthi Sundaram, Robin Kothari, Ashish Kapoor, Martin Roetteler:
Quantum Algorithms for Reinforcement Learning with a Generative Model. CoRR abs/2112.08451 (2021) - 2020
- [j36]Giulia Meuli, Mathias Soeken, Martin Roetteler, Thomas Häner:
Enabling accuracy-aware Quantum compilers using symbolic resource estimation. Proc. ACM Program. Lang. 4(OOPSLA): 130:1-130:26 (2020) - [c63]Samuel Jaques, Michael Naehrig, Martin Roetteler, Fernando Virdia:
Implementing Grover Oracles for Quantum Key Search on AES and LowMC. EUROCRYPT (2) 2020: 280-310 - [c62]Giulia Meuli, Mathias Soeken, Martin Roetteler, Giovanni De Micheli:
Enumerating Optimal Quantum Circuits using Spectral Classification. ISCAS 2020: 1-5 - [c61]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. PQCrypto 2020: 425-444 - [c60]Mathias Soeken, Martin Roetteler:
Quantum Circuits for Functionally Controlled NOT Gates. QCE 2020: 366-371 - [i68]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved quantum circuits for elliptic curve discrete logarithms. CoRR abs/2001.09580 (2020) - [i67]Giulia Meuli, Mathias Soeken, Martin Roetteler, Thomas Häner:
Automatic accuracy management of quantum programs via (near-)symbolic resource estimation. CoRR abs/2003.08408 (2020) - [i66]Alex Bocharov, Michael H. Freedman, Eshan Kemp, Martin Roetteler, Krysta M. Svore:
Predicting human-generated bitstreams using classical and quantum models. CoRR abs/2004.04671 (2020) - [i65]Mathias Soeken, Martin Roetteler:
Quantum Circuits for Functionally Controlled NOT Gates. CoRR abs/2005.12310 (2020) - [i64]Vera von Burg, Guang Hao Low, Thomas Häner, Damian S. Steiger, Markus Reiher, Martin Roetteler, Matthias Troyer:
Quantum computing enhanced computational catalysis. CoRR abs/2007.14460 (2020) - [i63]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. IACR Cryptol. ePrint Arch. 2020: 77 (2020)
2010 – 2019
- 2019
- [j35]Mathias Soeken, Martin Roetteler, Nathan Wiebe, Giovanni De Micheli:
LUT-Based Hierarchical Reversible Logic Synthesis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(9): 1675-1688 (2019) - [c59]Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj S. Bjørner, Giovanni De Micheli:
Reversible Pebbling Game for Quantum Memory Management. DATE 2019: 288-291 - [c58]Giulia Meuli, Mathias Soeken, Earl T. Campbell, Martin Roetteler, Giovanni De Micheli:
The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits. ICCAD 2019: 1-8 - [c57]Giulia Meuli, Mathias Soeken, Martin Roetteler, Giovanni De Micheli:
ROS: Resource-constrained Oracle Synthesis for Quantum Computers. QPL 2019: 119-130 - [i62]Margaret Martonosi, Martin Roetteler:
Next Steps in Quantum Computing: Computer Science's Role. CoRR abs/1903.10541 (2019) - [i61]Guang Hao Low, Nicholas P. Bauman, Christopher E. Granade, Bo Peng, Nathan Wiebe, Eric J. Bylaska, Dave Wecker, Sriram Krishnamoorthy, Martin Roetteler, Karol Kowalski, Matthias Troyer, Nathan A. Baker:
Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum Computers. CoRR abs/1904.01131 (2019) - [i60]Giulia Meuli, Mathias Soeken, Martin Roetteler, Nikolaj S. Bjørner, Giovanni De Micheli:
Reversible Pebbling Game for Quantum Memory Management. CoRR abs/1904.02121 (2019) - [i59]Giulia Meuli, Mathias Soeken, Earl T. Campbell, Martin Roetteler, Giovanni De Micheli:
The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits. CoRR abs/1908.01609 (2019) - [i58]Samuel Jaques, Michael Naehrig, Martin Roetteler, Fernando Virdia:
Implementing Grover oracles for quantum key search on AES and LowMC. CoRR abs/1910.01700 (2019) - [i57]Samuel Jaques, Michael Naehrig, Martin Roetteler, Fernando Virdia:
Implementing Grover oracles for quantum key search on AES and LowMC. IACR Cryptol. ePrint Arch. 2019: 1146 (2019) - 2018
- [j34]Martin Roetteler, Krysta M. Svore:
Quantum Computing: Codebreaking and Beyond. IEEE Secur. Priv. 16(5): 22-36 (2018) - [j33]Dmitri Maslov, Martin Roetteler:
Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations. IEEE Trans. Inf. Theory 64(7): 4729-4738 (2018) - [c56]Giulia Meuli, Mathias Soeken, Martin Roetteler, Nathan Wiebe, Giovanni De Micheli:
A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis. ASP-DAC 2018: 664-669 - [c55]Krysta M. Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher E. Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, Martin Roetteler:
Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. RWDSL@CGO 2018: 7:1-7:10 - [c54]Mathias Soeken, Thomas Häner, Martin Roetteler:
Programming quantum computers using design automation. DATE 2018: 137-146 - [c53]Thomas Häner, Mathias Soeken, Martin Roetteler, Krysta M. Svore:
Quantum Circuits for Floating-Point Arithmetic. RC 2018: 162-174 - [i56]Krysta M. Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher E. Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, Martin Roetteler:
Q#: Enabling scalable quantum computing and development with a high-level domain-specific language. CoRR abs/1803.00652 (2018) - [i55]Mathias Soeken, Thomas Häner, Martin Roetteler:
Programming Quantum Computers Using Design Automation. CoRR abs/1803.01022 (2018) - [i54]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Optimizing Quantum Circuits for Arithmetic. CoRR abs/1805.12445 (2018) - [i53]Thomas Häner, Mathias Soeken, Martin Roetteler, Krysta M. Svore:
Quantum circuits for floating-point arithmetic. CoRR abs/1807.02023 (2018) - [i52]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Managing approximation errors in quantum programs. CoRR abs/1807.02336 (2018) - [i51]Michele Mosca, Martin Roetteler, Peter Selinger:
Quantum Programming Languages (Dagstuhl Seminar 18381). Dagstuhl Reports 8(9): 112-132 (2018) - 2017
- [j32]Norbert Matthias Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A. Landsman, Kenneth Wright, Christopher R. Monroe:
Experimental comparison of two quantum computing architectures. Proc. Natl. Acad. Sci. USA 114(13): 3305-3310 (2017) - [j31]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Factoring using $2n+2$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7&8): 673-684 (2017) - [c52]Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. ASIACRYPT (2) 2017: 241-270 - [c51]Matthew Amy, Martin Roetteler, Krysta M. Svore:
Verified Compilation of Space-Efficient Reversible Circuits. CAV (2) 2017: 3-21 - [c50]Mathias Soeken, Martin Roetteler, Nathan Wiebe, Giovanni De Micheli:
Hierarchical Reversible Logic Synthesis Using LUTs. DAC 2017: 78:1-78:6 - [c49]Mathias Soeken, Martin Roetteler, Nathan Wiebe, Giovanni De Micheli:
Design automation and design space exploration for quantum computers. DATE 2017: 470-475 - [c48]Martin Rötteler, Krysta M. Svore, Dave Wecker, Nathan Wiebe:
Design automation for quantum architectures. DATE 2017: 1312-1317 - [c47]Martin Roetteler:
Tools for Quantum and Reversible Circuit Compilation. RC 2017: 3-16 - [c46]Alex Parent, Martin Roetteler, Krysta M. Svore:
REVS: A Tool for Space-Optimized Reversible Circuit Synthesis. RC 2017: 90-101 - [c45]Alex Parent, Martin Roetteler, Michele Mosca:
Improved reversible and quantum circuits for Karatsuba-based integer multiplication. TQC 2017: 7:1-7:15 - [i50]Norbert Matthias Linke, Dmitri Maslov, Martin Rötteler, Shantanu Debnath, Caroline Figgatt, K. A. Landsman, Kenneth Wright, Christopher R. Monroe:
Experimental Comparison of Two Quantum Computing Architectures. CoRR abs/1702.01852 (2017) - [i49]Dmitri Maslov, Martin Roetteler:
Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations. CoRR abs/1705.09176 (2017) - [i48]Mathias Soeken, Martin Roetteler, Nathan Wiebe, Giovanni De Micheli:
Logic Synthesis for Quantum Computing. CoRR abs/1706.02721 (2017) - [i47]Alex Parent, Martin Roetteler, Michele Mosca:
Improved reversible and quantum circuits for Karatsuba-based integer multiplication. CoRR abs/1706.03419 (2017) - [i46]Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum resource estimates for computing elliptic curve discrete logarithms. CoRR abs/1706.06752 (2017) - [i45]Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. IACR Cryptol. ePrint Arch. 2017: 598 (2017) - 2016
- [j30]Nathan Wiebe, Martin Roetteler:
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits. Quantum Inf. Comput. 16(1&2): 134-178 (2016) - [j29]Alex Bocharov, Shawn X. Cui, Martin Roetteler, Krysta M. Svore:
Improved quantum ternary arithmetic. Quantum Inf. Comput. 16(9&10): 862-884 (2016) - [j28]Adam D. Bookatz, Martin Roetteler, Pawel Wocjan:
Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians. IEEE Trans. Inf. Theory 62(5): 2881-2894 (2016) - [c44]Markus Grassl, Brandon Langenberg, Martin Roetteler, Rainer Steinwandt:
Applying Grover's Algorithm to AES: Quantum Resource Estimates. PQCrypto 2016: 29-43 - [c43]Martin Roetteler:
Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups. TQC 2016: 8:1-8:16 - [r3]Martin Roetteler:
Quantum Error Correction. Encyclopedia of Algorithms 2016: 1698-1703 - [i44]Matthew Amy, Martin Roetteler, Krysta M. Svore:
Verified compilation of space-efficient reversible circuits. CoRR abs/1603.01635 (2016) - [i43]Alex Bocharov, Martin Roetteler, Krysta M. Svore:
Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures. CoRR abs/1605.02756 (2016) - [i42]Martin Roetteler:
Quantum algorithms for abelian difference sets and applications to dihedral hidden subgroups. CoRR abs/1608.02005 (2016) - [i41]Thomas Häner, Martin Roetteler, Krysta M. Svore:
Factoring using 2n+2 qubits with Toffoli based modular multiplication. CoRR abs/1611.07995 (2016) - [i40]Mathias Soeken, Martin Rötteler, Nathan Wiebe, Giovanni De Micheli:
Design Automation and Design Space Exploration for Quantum Computers. CoRR abs/1612.00631 (2016) - 2015
- [j27]Martin Rötteler, Rainer Steinwandt:
A note on quantum related-key attacks. Inf. Process. Lett. 115(1): 40-44 (2015) - [c42]Markus Grassl, Martin Rötteler:
Quantum MDS codes over small fields. ISIT 2015: 1104-1108 - [i39]Markus Grassl, Martin Roetteler:
Quantum MDS Codes over Small Fields. CoRR abs/1502.05267 (2015) - [i38]Adam D. Bookatz, Martin Roetteler, Pawel Wocjan:
Improved bounded-strength decoupling schemes for local Hamiltonians. CoRR abs/1509.00408 (2015) - [i37]Alex Parent, Martin Roetteler, Krysta M. Svore:
Reversible circuit compilation with space constraints. CoRR abs/1510.00377 (2015) - [i36]Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler, Jon Yard:
A Framework for Approximating Qubit Unitaries. CoRR abs/1510.03888 (2015) - [i35]Alex Bocharov, Shawn X. Cui, Martin Roetteler, Krysta M. Svore:
Improved Quantum Ternary Arithmetics. CoRR abs/1512.03824 (2015) - [i34]Markus Grassl, Brandon Langenberg, Martin Roetteler, Rainer Steinwandt:
Applying Grover's algorithm to AES: quantum resource estimates. CoRR abs/1512.04965 (2015) - [i33]Michele Mosca, Martin Roetteler, Nicolas Sendrier, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 15371). Dagstuhl Reports 5(9): 1-17 (2015) - 2014
- [j26]Martin Rötteler, Rainer Steinwandt:
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n). Quantum Inf. Comput. 14(9-10): 888-900 (2014) - [c41]Niel de Beaudrap, Martin Roetteler:
Quantum Linear Network Coding as One-way Quantum Computation. TQC 2014: 217-233 - [e1]Dave Bacon, Miguel-Angel Martin-Delgado, Martin Roetteler:
Theory of Quantum Computation, Communication, and Cryptography - 6th Conference, TQC 2011, Madrid, Spain, May 24-26, 2011, Revised Selected Papers. Lecture Notes in Computer Science 6745, Springer 2014, ISBN 978-3-642-54428-6 [contents] - [i32]J. Niel de Beaudrap, Martin Roetteler:
Quantum linear network coding as one-way quantum computation. CoRR abs/1403.3533 (2014) - [i31]Alex Bocharov, Martin Roetteler, Krysta M. Svore:
Efficient synthesis of universal Repeat-Until-Success circuits. CoRR abs/1404.5320 (2014) - [i30]Nathan Wiebe, Martin Roetteler:
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits. CoRR abs/1406.2040 (2014) - [i29]Alex Bocharov, Martin Roetteler, Krysta M. Svore:
Efficient synthesis of probabilistic quantum circuits with fallback. CoRR abs/1409.3552 (2014) - 2013
- [j25]Brittanney Amento, Martin Rötteler, Rainer Steinwandt:
Quantum binary field inversion: improved circuit depth via choice of basis representation. Quantum Inf. Comput. 13(1-2): 116-134 (2013) - [j24]Brittanney Amento, Martin Rötteler, Rainer Steinwandt:
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity. Quantum Inf. Comput. 13(7-8): 631-644 (2013) - [j23]Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler:
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6): 818-830 (2013) - [j22]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. ACM Trans. Comput. Theory 5(3): 11:1-11:33 (2013) - [c40]Andrei Lapets, Marcus P. da Silva, Mike Thome, Aaron Adler, Jacob Beal, Martin Roetteler:
QuaFL: a typed DSL for quantum programming. FPCDSL@ICFP 2013: 19-26 - [c39]Andrei Lapets, Martin Roetteler:
Abstract resource cost derivation for logical quantum circuit descriptions. FPCDSL@ICFP 2013: 35-42 - [c38]Markus Grassl, Martin Roetteler:
Leveraging automorphisms of quantum codes for fault-tolerant quantum computation. ISIT 2013: 534-538 - [c37]Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and Hard Functions for the Boolean Hidden Shift Problem. TQC 2013: 50-79 - [c36]Giulio Chiribella, Giacomo Mauro D'Ariano, Martin Roetteler:
On the Query Complexity of Perfect Gate Discrimination. TQC 2013: 178-191 - [p1]Martin Roetteler, Arne Winterhof:
Finite fields in quantum information theory. Handbook of Finite Fields 2013: 834-840 - [i28]Markus Grassl, Martin Roetteler:
Leveraging Automorphisms of Quantum Codes for Fault-Tolerant Quantum Computation. CoRR abs/1302.1035 (2013) - [i27]Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and hard functions for the Boolean hidden shift problem. CoRR abs/1304.4642 (2013) - [i26]Martin Roetteler, Rainer Steinwandt:
A quantum circuit to find discrete logarithms on binary elliptic curves in depth O(log^2 n). CoRR abs/1306.1161 (2013) - [i25]Martin Roetteler, Rainer Steinwandt:
A note on quantum related-key attacks. CoRR abs/1306.2301 (2013) - [i24]Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 13371). Dagstuhl Reports 3(9): 59-73 (2013) - [i23]Martin Roetteler, Rainer Steinwandt:
A note on quantum related-key attacks. IACR Cryptol. ePrint Arch. 2013: 378 (2013) - 2012
- [c35]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. ITCS 2012: 290-308 - [i22]Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler:
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. CoRR abs/1206.0758 (2012) - [i21]Brittanney Amento, Martin Roetteler, Rainer Steinwandt:
Quantum binary field inversion: improved circuit depth via choice of basis representation. CoRR abs/1209.5491 (2012) - [i20]Brittanney Amento, Rainer Steinwandt, Martin Roetteler:
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity. CoRR abs/1209.6348 (2012) - 2011
- [c34]Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-Assisted Adversaries for Quantum State Generation. CCC 2011: 167-177 - [c33]Dmitry Gavinsky, Martin Roetteler, Jérémie Roland:
Quantum Algorithm for the Boolean Hidden Shift Problem. COCOON 2011: 158-167 - [c32]Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler:
Constructing quantum network coding schemes from classical nonlinear protocols. ISIT 2011: 109-113 - [i19]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. CoRR abs/1103.2774 (2011) - [i18]Dmitry Gavinsky, Martin Roetteler, Jérémie Roland:
Quantum algorithm for the Boolean hidden shift problem. CoRR abs/1103.3017 (2011) - [i17]Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 11381). Dagstuhl Reports 1(9): 58-75 (2011) - 2010
- [j21]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. J. ACM 57(6): 34:1-34:33 (2010) - [c31]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
Perfect quantum network communication protocol based on classical network coding. ISIT 2010: 2686-2690 - [c30]Markus Grassl, Martin Rötteler:
On encoders for quantum convolutional codes. ITW 2010: 1-5 - [c29]Martin Rötteler:
Quantum Algorithms for Highly Non-Linear Boolean Functions. SODA 2010: 448-457 - [i16]Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-assisted adversaries for quantum state generation. CoRR abs/1012.2112 (2010) - [i15]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Roetteler:
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols. CoRR abs/1012.4583 (2010) - [i14]Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland:
Symmetry-assisted adversaries for quantum state generation. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j20]Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen:
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Algorithmica 55(3): 490-516 (2009) - [j19]Muzaffer O. Simsir, Srihari Cadambi, Franjo Ivancic, Martin Rötteler, Niraj K. Jha:
A hybrid nano-CMOS architecture for defect and fault tolerance. ACM J. Emerg. Technol. Comput. Syst. 5(3): 14:1-14:26 (2009) - [c28]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. ICALP (1) 2009: 622-633 - [c27]Shantanu Gupta, Florin Sultan, Srihari Cadambi, Franjo Ivancic, Martin Rötteler:
Using hardware transactional memory for data race detection. IPDPS 2009: 1-11 - [c26]Pradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler:
New decoding algorithms for a class of subsystem codes and generalized shor codes. ISIT 2009: 804-808 - [c25]Martin Rötteler:
Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm. MFCS 2009: 663-674 - [r2]Markus Grassl, Martin Rötteler:
Quantum Error Correction and Fault Tolerant Quantum Computing. Encyclopedia of Complexity and Systems Science 2009: 7324-7342 - [i13]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
Perfect Quantum Network Communication Protocol Based on Classical Network Coding. CoRR abs/0902.1299 (2009) - [i12]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. CoRR abs/0908.1457 (2009) - [i11]Martin Roetteler:
Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm. CoRR abs/0911.4724 (2009) - 2008
- [j18]Martin Rötteler, Thomas Beth:
Representation-theoretical properties of the approximate quantum Fourier transform. Appl. Algebra Eng. Commun. Comput. 19(3): 177-193 (2008) - [j17]Markus Püschel, Martin Rötteler:
Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice. Appl. Algebra Eng. Commun. Comput. 19(3): 259-292 (2008) - [c24]Markus Grassl, Martin Rötteler:
Quantum Goethals-Preparata codes. ISIT 2008: 300-304 - [c23]Pradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler:
Asymmetric quantum LDPC codes. ISIT 2008: 305-309 - [c22]Markus Grassl, Martin Rötteler:
Non-additive quantum codes from Goethals and Preparata codes. ITW 2008: 396-400 - [c21]Hari Krovi, Martin Rötteler:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups. MMICS 2008: 70-88 - [c20]Shantanu Gupta, Florin Sultan, Srihari Cadambi, Franjo Ivancic, Martin Rötteler:
RaceTM: detecting data races using transactional memory. SPAA 2008: 104-106 - [c19]J. Niel de Beaudrap, Vincent Danos, Elham Kashefi, Martin Rötteler:
Quadratic Form Expansions for Unitaries. TQC 2008: 29-46 - [c18]Muzaffer O. Simsir, Srihari Cadambi, Franjo Ivancic, Martin Rötteler, Niraj K. Jha:
Fault-Tolerant Computing Using a Hybrid Nano-CMOS Architecture. VLSI Design 2008: 435-440 - [r1]Martin Rötteler:
Quantum Error Correction. Encyclopedia of Algorithms 2008 - [i10]Markus Grassl, Martin Rötteler:
Non-Additive Quantum Codes from Goethals and Preparata Codes. CoRR abs/0801.2144 (2008) - [i9]Markus Grassl, Martin Rötteler:
Quantum Goethals-Preparata Codes. CoRR abs/0801.2150 (2008) - [i8]Pradeep Kiran Sarvepalli, Martin Rötteler, Andreas Klappenecker:
Asymmetric Quantum LDPC Codes. CoRR abs/0804.4316 (2008) - [i7]Hari Krovi, Martin Rötteler:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups. CoRR abs/0810.3695 (2008) - [i6]Martin Rötteler:
Quantum algorithms for highly non-linear Boolean functions. CoRR abs/0811.3208 (2008) - 2007
- [j16]Markus Püschel, Martin Rötteler:
Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice. IEEE Trans. Image Process. 16(6): 1506-1521 (2007) - [c17]Markus Grassl, Martin Rötteler:
Constructions of Quantum Convolutional Codes. ISIT 2007: 816-820 - [i5]Markus Grassl, Andreas Klappenecker, Martin Rötteler:
Graphs, Quadratic Forms, and Quantum Codes. CoRR abs/quant-ph/0703112 (2007) - [i4]Salah A. Aly, Markus Grassl, Andreas Klappenecker, Martin Rötteler, Pradeep Kiran Sarvepalli:
Quantum Convolutional BCH Codes. CoRR abs/quant-ph/0703113 (2007) - [i3]Markus Grassl, Martin Rötteler:
Quantum Block and Convolutional Codes from Self-orthogonal Product Codes. CoRR abs/quant-ph/0703181 (2007) - [i2]Markus Grassl, Martin Rötteler:
Constructions of Quantum Convolutional Codes. CoRR abs/quant-ph/0703182 (2007) - 2006
- [j15]Martin Rötteler:
Quantum algorithms: A survey of some recent results. Inform. Forsch. Entwickl. 21(1-2): 3-20 (2006) - [j14]Andreas Klappenecker, Martin Rötteler:
Effiziente Quantenalgorithmen (Efficient Quantum Algorithms). it Inf. Technol. 48(6): 344- (2006) - [j13]Markus Grassl, Andreas Klappenecker, Martin Rötteler:
In Memoriam: Thomas Beth. Quantum Inf. Process. 5(1): 1-4 (2006) - [j12]Martin Rötteler, Pawel Wocjan:
Equivalence of Decoupling Schemes and Orthogonal Arrays. IEEE Trans. Inf. Theory 52(9): 4171-4181 (2006) - [c16]Markus Grassl, Martin Rötteler:
Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes. ISIT 2006: 1109-1113 - [c15]Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism. STOC 2006: 604-617 - [i1]Markus Grassl, Martin Rötteler:
Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes. CoRR abs/quant-ph/0602129 (2006) - 2005
- [j11]Andreas Klappenecker, Martin Rötteler:
Solution to the Mean King's Problem in Prime Power Dimensions Using Discrete Tomography. Electron. Notes Discret. Math. 20: 165-177 (2005) - [j10]Andreas Klappenecker, Martin Rötteler:
On the monomiality of nice error bases. IEEE Trans. Inf. Theory 51(3): 1084-1089 (2005) - [c14]Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen:
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. ICALP 2005: 1399-1411 - [c13]Markus Püschel, Martin Rötteler:
Fourier transform for the directed quincunx lattice. ICASSP (4) 2005: 401-404 - [c12]Markus Püschel, Martin Rötteler:
Fourier transform for the spatial quincunx lattice. ICIP (2) 2005: 494-497 - [c11]Markus Grassl, Martin Rötteler:
Quantum block and convolutional codes from self-orthogonal product codes. ISIT 2005: 1018-1022 - [c10]Andreas Klappenecker, Martin Rötteler:
Mutually unbiased bases are complex projective 2-designs. ISIT 2005: 1740-1744 - 2004
- [j9]Andreas Klappenecker, Martin Rötteler:
On the structure of nonstabilizer clifford codes. Quantum Inf. Comput. 4(2): 152-160 (2004) - [c9]Markus Püschel, Martin Rötteler:
The discrete triangle transform. ICASSP (3) 2004: 45-48 - [c8]Andreas Klappenecker, Martin Rötteler:
Remarks on Clifford codes. ISIT 2004: 354 - [c7]Martin Rötteler, Markus Grassl, Thomas Beth:
On quantum MDS codes. ISIT 2004: 355 - 2003
- [j8]María Isabel González Vasco, Martin Rötteler, Rainer Steinwandt:
On Minimal Length Factorizations of Finite Groups. Exp. Math. 12(1): 1-12 (2003) - [j7]Markus Grassl, Martin Rötteler, Thomas Beth:
Efficient Quantum Circuits For Non-Qubit Quantum Error-Correcting Codes. Int. J. Found. Comput. Sci. 14(5): 757-776 (2003) - [j6]Andreas Klappenecker, Martin Rötteler:
Quantum Software Reusability. Int. J. Found. Comput. Sci. 14(5): 777-796 (2003) - [c6]Andreas Klappenecker, Martin Rötteler:
Unitary Error Bases: Constructions, Equivalence, and Applications. AAECC 2003: 139-149 - [c5]Andreas Klappenecker, Martin Rötteler:
Constructions of Mutually Unbiased Bases. International Conference on Finite Fields and Applications 2003: 137-144 - 2002
- [b1]Martin Rötteler:
Schnelle Signaltransformationen für Quantenrechner. Karlsruhe Institute of Technology, Germany, Shaker 2002, ISBN 978-3-8322-0213-2, pp. 1-158 - [j5]Chris Charnes, Martin Rötteler, Thomas Beth:
Homogeneous Bent Functions, Invariants, and Designs. Des. Codes Cryptogr. 26(1-3): 139-154 (2002) - [j4]Pawel Wocjan, Martin Rötteler, Dominik Janzing, Thomas Beth:
Universal simulation of Hamiltonians using a finite set of control operations. Quantum Inf. Comput. 2(2): 133-150 (2002) - [j3]Andreas Klappenecker, Martin Rötteler:
Beyond stabilizer codes I: Nice error bases. IEEE Trans. Inf. Theory 48(8): 2392-2395 (2002) - [j2]Andreas Klappenecker, Martin Rötteler:
Beyond stabilizer codes II: Clifford codes. IEEE Trans. Inf. Theory 48(8): 2396-2399 (2002) - 2001
- [c4]Chris Charnes, Martin Rötteler, Thomas Beth:
On Homogeneous Bent Functions. AAECC 2001: 249-259 - 2000
- [j1]Martin Rötteler, Jörn Müller-Quade:
Separation of Orbits under Group Actions with an Application to Quantum Systems. Appl. Algebra Eng. Commun. Comput. 10(4/5): 279-303 (2000)
1990 – 1999
- 1999
- [c3]Markus Püschel, Martin Rötteler, Thomas Beth:
Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups. AAECC 1999: 148-159 - [c2]Björn Grohmann, Martin Rötteler:
Von N2 nach log2N - Zur algebraischen Berechnungskomplexität allgemeiner Fouriertransformationen. GI Jahrestagung 1999: 247-256 - 1998
- [c1]Jörn Müller-Quade, Martin Rötteler:
Deciding Linear Disjointness of Finitely Generated Fields. ISSAC 1998: 153-160
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
