Search Results for author: Martin Roetteler

Found 7 papers, 2 papers with code

Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum Computers

no code implementations1 Apr 2019 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

Fault-tolerant quantum computation promises to solve outstanding problems in quantum chemistry within the next decade.

Quantum Physics Emerging Technologies Chemical Physics Computational Physics

Next Steps in Quantum Computing: Computer Science's Role

no code implementations25 Mar 2019 Margaret Martonosi, Martin Roetteler

The goal of the QC research community is to close the gap such that useful algorithms can be run in practical amounts of time on reliable real-world QC hardware.

Emerging Technologies Quantum Physics

Quantum circuits for floating-point arithmetic

1 code implementation5 Jul 2018 Thomas Häner, Mathias Soeken, Martin Roetteler, Krysta M. Svore

Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs.

Quantum Physics Emerging Technologies

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

no code implementations23 Nov 2016 Thomas Häner, Martin Roetteler, Krysta M. Svore

We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits.

Quantum Physics Emerging Technologies

Easy and hard functions for the Boolean hidden shift problem

no code implementations16 Apr 2013 Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler

We study the quantum query complexity of the Boolean hidden shift problem.

Quantum algorithms for highly non-linear Boolean functions

1 code implementation19 Nov 2008 Martin Roetteler

We present new quantum algorithms that solve the hidden shift problems for several well-known classes of bent functions in polynomial time and with a constant number of queries, while the classical query complexity is shown to be exponential.

Quantum Physics Computational Complexity

Cannot find the paper you are looking for? You can Submit a new open access paper.