Iasonas Petras homepage

In terms of research, I am interested in the algorithmic and complexity analysis of multivariate mathematical problems.
The quantum computer is potentially a powerful computational tool. I am looking into quantum algorithms for continuous mathematical and physical problems, that demonstrate a significant speedup compared to their classical counterparts.
Information-based complexity refers to the complexity of continuous mathematical problems, such as integration or approximation of continuous functions. The most interesting cases are problems which refer to multivariate functions, where the number of variables (dimension of the problem) is considered "huge". I am interested in studying ways to eliminate the "curse of dimensionality", namely the exponential dependence of the cost of algorithms on the dimension.

Quantum Computation

Information-based complexity

Information-based complexity @ wikipedia

Princeton University

Publications

Anargyros Papageorgiou, Iasonas Petras, Guiqiao Xu and Dong Yanqi, EC-(s, t)-weak tractability of multivariate linear problems in the average case setting , Journal of Complexity, Vol 55, December 2019, 101425
Anargyros Papageorgiou, Iasonas Petras and Henryk Wo\'zniakowski, (s,ln k)-weak tractability of linear problems, Journal of Complexity, Vol 40, June 2017, pg. 1-16
Mihir K. Bhaskar, Stuart Hadfield, Anargyros Papageorgiou and Iasonas Petras, Quantum Algorithms and Circuits for Scientific Computing, Quantum Information and Computation, 16, no. 3&4, March 2016: pg. 197-236
Anargyros Papageorgiou and Iasonas Petras, A new criterion for tractability of multivariate problems, Journal of Complexity, Vol 30, Issue 5, pg. 605-619, October 2014
Anargyros Papageorgiou and Iasonas Petras Estimating the ground state energy of the Schrödinger equation for convex potentials, Journal of Complexity, Vol 30, Issue 4, pg. 469-494, August 2014
Yudong Cao, Anargyros Papageorgiou, Iasonas Petras, Joseph F. Traub and Sabre Kais, Quantum algorithm and circuit design solving the Poisson equation, New J. Phys. 15 (2013) 013021
Anargyros Papageorgiou, Iasonas Petras, Joseph F. Traub and Chi Zhang, A fast algorithm for approximating the ground state energy on a quantum computer, Math Comp. 82 (2013), 2294-2304
Anargyros Papageorgiou and Iasonas Petras, Tractability of tensor product problems in the average case settin, Journal of Complexity, Vol 27, Issue 3-4, June, 2011.
Anargyros Papageorgiou and Iasonas Petras, On the tractability of linear tensor product problems in the worst case, Journal of Complexity, Vol 25, Issue 5, October 2009
K. Theodoropoulos, D. Ntalaperas, I. Petras and N. Konofaos, A quantum computer based on recombination processes in microelectronic devices, 2005 J. Phys.: Conf. Ser. 10, 85-88

Talks

Dagstuhl Seminar Proceedings 12391: Algorithms and Complexity for Continuous Problems, Iasonas Petras, Repeated Phase Estimation: Approximating the ground state of the Schroedinger equation, 23-28 September, 2012.
Winter School 2012: QIQC. Iasonas Petras, A fast algorithm for the ground state energy on a quantum computer, 05-07 January, 2012.
Dagstuhl Seminar Proceedings 09391: Algorithms and Complexity for Continuous Problems, Iasonas Petras, On the Tractability of Linear Tensor Product Problems in the Worst Case, 20-25 September, 2009.

Last updated: 2020

Teaching

As Lecturer at Princeton University

COS 340: Reasoning about Computation [current semester]
COS 217: Introduction to Programming Systems
Princeton University Matlab short course, 2nd Lecture.

As Teaching Assistant at Columbia University

Computational linear algebra
Numerical algorithms and complexity

Teaching Awards

Excellence in Teaching Award, from Princeton University’s Engineering Council and Graduate Engineering Council

Contact Information

Email: ipetras (at) cs (dot) princeton (dot) edu
Office: 033 Corwin Hall, Princeton University

Iasonas Petras, Lecturer, CS department@Princeton University