182 citations · 299 across the 10 of their papers we have counts for
10 papers
Measures of quantum computing speedup
Anargyros Papageorgiou, Joseph F. Traub
We introduce the concept of strong quantum speedup. We prove that approximating the ground state energy of an instance of the time-independent Schrödinger equation, with degree…
Quantum algorithm and circuit design solving the Poisson equation
Yudong Cao, Anargyros Papageorgiou, Iasonas Petras +2
The Poisson equation occurs in many areas of science and engineering. Here we focus on its numerical solution for an equation in d dimensions. In particular we present a quantum al…
A fast algorithm for approximating the ground state energy on a quantum computer
Anargyros Papageorgiou, Iasonas Petras, Joseph F. Traub +1
Estimating the ground state energy of a multiparticle system with relative error $\e$ using deterministic classical algorithms has cost that grows exponentially with the number of…
A brief history of information-based complexity
Joseph F. Traub
This paper was presented on the occasion of an honorary doctoral degree for Henryk Wozniakowski at Friedrich Schiller University in Jena, Germany on June 6, 2008. Information-based…
Quantum Algorithms and Complexity for Continuous Problems
A. Papageorgiou, J. F. Traub
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing w…
Qubit Complexity of Continuous Problems
A. Papageorgiou, J. F. Traub
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for conti…