與「Iasonas Petras」相符的使用者個人學術檔案

Iasonas Petras

Lecturer, Computer Science Department, Princeton University
在 cs.princeton.edu 的電子郵件地址已通過驗證
被引用 392 次

Quantum algorithm and circuit design solving the Poisson equation

Y Cao, A Papageorgiou, I Petras, J Traub… - New Journal of …, 2013 - iopscience.iop.org
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 …

Quantum algorithms and circuits for scientific computing

…, S Hadfield, A Papageorgiou, I Petras - arXiv preprint arXiv …, 2015 - arxiv.org
Quantum algorithms for scientific computing require modules implementing fundamental
functions, such as the square root, the logarithm, and others. We require algorithms that have a …

[HTML][HTML] A new criterion for tractability of multivariate problems

A Papageorgiou, I Petras - Journal of Complexity, 2014 - Elsevier
Tractability of multivariate problems studies their complexity with respect to the number of
variables, d , and the accuracy of the solution ε . Different types of tractability have been used, …

[HTML][HTML] Tractability of tensor product problems in the average case setting

A Papageorgiou, I Petras - Journal of Complexity, 2011 - Elsevier
It has been an open problem to derive a necessary and sufficient condition for a linear
tensor product problem S={S d } in the average case setting to be weakly tractable but not …

A fast algorithm for approximating the ground state energy on a quantum computer

A Papageorgiou, I Petras, J Traub, C Zhang - Mathematics of Computation, 2013 - ams.org
Estimating the ground state energy of a multiparticle system with relative error $\varepsilon
$ using deterministic classical algorithms has cost that grows exponentially with the number …

[HTML][HTML] On the tractability of linear tensor product problems in the worst case

A Papageorgiou, I Petras - Journal of Complexity, 2009 - Elsevier
It has been an open problem to derive a necessary and sufficient condition for a linear tensor
product problem to be weakly tractable in the worst case. The complexity of linear tensor …

[HTML][HTML] EC-(s, t)-weak tractability of multivariate linear problems in the average case setting

A Papageorgiou, I Petras, G Xu, D Yanqi - Journal of Complexity, 2019 - Elsevier
We study EC- ( s , t ) -weak tractability of multivariate linear problems in the average case
setting. This paper extends earlier work in the worst case setting. The parameters s ≥ 0 and t …

[HTML][HTML] Estimating the ground state energy of the Schrödinger equation for convex potentials

A Papageorgiou, I Petras - Journal of Complexity, 2014 - Elsevier
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 …

[HTML][HTML] (s, lnκ)-weak tractability of linear problems

A Papageorgiou, I Petras, H Woźniakowski - Journal of Complexity, 2017 - Elsevier
We introduce a new notion of tractability for multivariate problems, namely ( s , ln κ ) -weak
tractability for positive s and κ . This allows us to study the information complexity of a d -…

[書籍][B] Contributions to Information-Based Complexity and to Quantum Computing

I Petras - 2013 - search.proquest.com
Multivariate continuous problems are widely encountered in physics, chemistry, finance and
in computational sciences. Unfortunately, interesting real world multivariate continuous …