You need to log in to edit.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

You can create a new account if you don't have one.

Or, discuss a change on Slack.

no code implementations • 9 Apr 2020 • Alex Bocharov, Michael Freedman, Eshan Kemp, Martin Roetteler, Krysta M. Svore

A school of thought contends that human decision making exhibits quantum-like logic.

no code implementations • 1 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

no code implementations • 25 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

1 code implementation • 5 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

no code implementations • 23 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

no code implementations • 16 Apr 2013 • Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler

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

1 code implementation • 19 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.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.