182 citations · 383 across the 17 of their papers we have counts for
17 papers
Quantum Algorithms and Circuits for Scientific Computing
Mihir K. Bhaskar, Stuart Hadfield, Anargyros Papageorgiou +1
Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have…
Approximating Ground and Excited State Energies on a Quantum Computer
Stuart Hadfield, Anargyros Papageorgiou
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, t…
Estimating the ground state energy of the Schrödinger equation for convex potentials
Anargyros Papageorgiou, Iasonas Petras
In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with…
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…
Average Case Tractability of Non-homogeneous Tensor Product Problems
M. A. Lifshits, A. Papageorgiou, H. Woźniakowski
We study d-variate approximation problems in the average case setting with respect to a zero-mean Gaussian measure. Our interest is focused on measures having a structure of non-ho…