Martin Rötteler

According to our database1, Martin Rötteler authored at least 116 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Improved quantum circuits for elliptic curve discrete logarithms.
CoRR, 2020

2019
LUT-Based Hierarchical Reversible Logic Synthesis.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2019

Implementing Grover oracles for quantum key search on AES and LowMC.
IACR Cryptology ePrint Archive, 2019

Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum Computers.
CoRR, 2019

Next Steps in Quantum Computing: Computer Science's Role.
CoRR, 2019

The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits.
Proceedings of the International Conference on Computer-Aided Design, 2019

Reversible Pebbling Game for Quantum Memory Management.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

2018
Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations.
IEEE Trans. Information Theory, 2018

Quantum Computing: Codebreaking and Beyond.
IEEE Security & Privacy, 2018

Quantum Programming Languages (Dagstuhl Seminar 18381).
Dagstuhl Reports, 2018

Managing approximation errors in quantum programs.
CoRR, 2018

Optimizing Quantum Circuits for Arithmetic.
CoRR, 2018

Q#: Enabling scalable quantum computing and development with a high-level domain-specific language.
CoRR, 2018

Quantum Circuits for Floating-Point Arithmetic.
Proceedings of the Reversible Computation - 10th International Conference, 2018

Programming quantum computers using design automation.
Proceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition, 2018

Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL.
Proceedings of the Real World Domain Specific Languages Workshop, 2018

A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis.
Proceedings of the 23rd Asia and South Pacific Design Automation Conference, 2018

2017
Factoring using $2n+2$ qubits with Toffoli based modular multiplication.
Quantum Information & Computation, 2017

Experimental comparison of two quantum computing architectures.
Proc. Natl. Acad. Sci. U.S.A., 2017

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms.
IACR Cryptology ePrint Archive, 2017

Logic Synthesis for Quantum Computing.
CoRR, 2017

Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

Tools for Quantum and Reversible Circuit Compilation.
Proceedings of the Reversible Computation - 9th International Conference, 2017

REVS: A Tool for Space-Optimized Reversible Circuit Synthesis.
Proceedings of the Reversible Computation - 9th International Conference, 2017

Design automation and design space exploration for quantum computers.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2017

Design automation for quantum architectures.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2017

Hierarchical Reversible Logic Synthesis Using LUTs.
Proceedings of the 54th Annual Design Automation Conference, 2017

Verified Compilation of Space-Efficient Reversible Circuits.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Quantum Error Correction.
Encyclopedia of Algorithms, 2016

Improved Bounded-Strength Decoupling Schemes for Local Hamiltonians.
IEEE Trans. Information Theory, 2016

Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits.
Quantum Information & Computation, 2016

Improved quantum ternary arithmetic.
Quantum Information & Computation, 2016

Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures.
CoRR, 2016

Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups.
Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

Applying Grover's Algorithm to AES: Quantum Resource Estimates.
Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

2015
A note on quantum related-key attacks.
Inf. Process. Lett., 2015

Quantum Cryptanalysis (Dagstuhl Seminar 15371).
Dagstuhl Reports, 2015

Reversible circuit compilation with space constraints.
CoRR, 2015

A Framework for Approximating Qubit Unitaries.
CoRR, 2015

Improved Quantum Ternary Arithmetics.
CoRR, 2015

Quantum MDS codes over small fields.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n).
Quantum Information & Computation, 2014

Efficient synthesis of universal Repeat-Until-Success circuits.
CoRR, 2014

Efficient synthesis of probabilistic quantum circuits with fallback.
CoRR, 2014

Quantum Linear Network Coding as One-way Quantum Computation.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013
Quantum rejection sampling.
TOCT, 2013

A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2013

Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity.
Quantum Information & Computation, 2013

Quantum binary field inversion: improved circuit depth via choice of basis representation.
Quantum Information & Computation, 2013

Quantum Cryptanalysis (Dagstuhl Seminar 13371).
Dagstuhl Reports, 2013

A quantum circuit to find discrete logarithms on binary elliptic curves in depth O(log^2 n).
CoRR, 2013

On the Query Complexity of Perfect Gate Discrimination.
Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

Easy and Hard Functions for the Boolean Hidden Shift Problem.
Proceedings of the 8th Conference on the Theory of Quantum Computation, 2013

Leveraging automorphisms of quantum codes for fault-tolerant quantum computation.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

QuaFL: a typed DSL for quantum programming.
Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages, 2013

Abstract resource cost derivation for logical quantum circuit descriptions.
Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages, 2013

2011
Quantum Cryptanalysis (Dagstuhl Seminar 11381).
Dagstuhl Reports, 2011

Constructing quantum network coding schemes from classical nonlinear protocols.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Quantum Algorithm for the Boolean Hidden Shift Problem.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Limitations of quantum coset states for graph isomorphism.
J. ACM, 2010

Symmetry-assisted adversaries for quantum state generation.
Electronic Colloquium on Computational Complexity (ECCC), 2010

Quantum Algorithms for Highly Non-Linear Boolean Functions.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

On encoders for quantum convolutional codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Perfect quantum network communication protocol based on classical network coding.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Quantum Error Correction and Fault Tolerant Quantum Computing.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

A hybrid nano-CMOS architecture for defect and fault tolerance.
JETC, 2009

Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.
Algorithmica, 2009

Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

New decoding algorithms for a class of subsystem codes and generalized shor codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Using hardware transactional memory for data race detection.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

General Scheme for Perfect Quantum Network Coding with Free Classical Communication.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Quantum Error Correction.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Representation-theoretical properties of the approximate quantum Fourier transform.
Appl. Algebra Eng. Commun. Comput., 2008

Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice.
Appl. Algebra Eng. Commun. Comput., 2008

Fault-Tolerant Computing Using a Hybrid Nano-CMOS Architecture.
Proceedings of the 21st International Conference on VLSI Design (VLSI Design 2008), 2008

Quadratic Form Expansions for Unitaries.
Proceedings of the Theory of Quantum Computation, 2008

RaceTM: detecting data races using transactional memory.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups.
Proceedings of the Mathematical Methods in Computer Science, 2008

Non-additive quantum codes from Goethals and Preparata codes.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Asymmetric quantum LDPC codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Quantum Goethals-Preparata codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice.
IEEE Trans. Image Processing, 2007

Quantum Convolutional BCH Codes
CoRR, 2007

Graphs, Quadratic Forms, and Quantum Codes
CoRR, 2007

Constructions of Quantum Convolutional Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Equivalence of Decoupling Schemes and Orthogonal Arrays.
IEEE Trans. Information Theory, 2006

In Memoriam: Thomas Beth.
Quantum Information Processing, 2006

Effiziente Quantenalgorithmen (Efficient Quantum Algorithms).
it - Information Technology, 2006

Quantum algorithms: A survey of some recent results.
Inform., Forsch. Entwickl., 2006

Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
On the monomiality of nice error bases.
IEEE Trans. Information Theory, 2005

Solution to the Mean King's Problem in Prime Power Dimensions Using Discrete Tomography.
Electronic Notes in Discrete Mathematics, 2005

Mutually unbiased bases are complex projective 2-designs.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Quantum block and convolutional codes from self-orthogonal product codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Fourier transform for the spatial quincunx lattice.
Proceedings of the 2005 International Conference on Image Processing, 2005

Fourier transform for the directed quincunx lattice.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
On the structure of nonstabilizer clifford codes.
Quantum Information & Computation, 2004

On quantum MDS codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Remarks on Clifford codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

The discrete triangle transform.
Proceedings of the 2004 IEEE International Conference on Acoustics, 2004

2003
Quantum Software Reusability.
Int. J. Found. Comput. Sci., 2003

Efficient Quantum Circuits For Non-Qubit Quantum Error-Correcting Codes.
Int. J. Found. Comput. Sci., 2003

On Minimal Length Factorizations of Finite Groups.
Experimental Mathematics, 2003

Constructions of Mutually Unbiased Bases.
Proceedings of the Finite Fields and Applications, 2003

Unitary Error Bases: Constructions, Equivalence, and Applications.
Proceedings of the Applied Algebra, 2003

2002
Schnelle Signaltransformationen für Quantenrechner.
PhD thesis, 2002

Beyond stabilizer codes II: Clifford codes.
IEEE Trans. Information Theory, 2002

Beyond stabilizer codes I: Nice error bases.
IEEE Trans. Information Theory, 2002

Universal simulation of Hamiltonians using a finite set of control operations.
Quantum Information & Computation, 2002

Homogeneous Bent Functions, Invariants, and Designs.
Des. Codes Cryptogr., 2002

2001
On Homogeneous Bent Functions.
Proceedings of the Applied Algebra, 2001

2000
Separation of Orbits under Group Actions with an Application to Quantum Systems.
Appl. Algebra Eng. Commun. Comput., 2000

1999
Von N2 nach log2N - Zur algebraischen Berechnungskomplexität allgemeiner Fouriertransformationen.
Proceedings of the Informatik '99, 1999

Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups.
Proceedings of the Applied Algebra, 1999

1998
Deciding Linear Disjointness of Finitely Generated Fields.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998


  Loading...