Iasonas Petras homepage

I am interested in algorithmic and complexity analysis of multivariate mathematical problems. More specifically, I conduct research on quantum computation and information-based complexity.
The quantum computer is potentially a powerful computational tool. My research focuses on 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 researching ways to eliminate the "curse of dimensionality", namely the exponential dependence of the cost of algorithms on the dimension.

Quantum Computation

Information-based complexity

Publications

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, Mathematics of Computation, AMS, (to appear).
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 new concept on a quantum computer based on recombination processes in microelectronic devices, American Institute of Physics Conference Proceedings, Vol. 772, Issue 1, pages 1463-1464, June 2005.

Conferences

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.
University of Patras. Iasonas Petras, Ntalaperas Dimitrios and Konstantinos Theodoropoulos, Computer Science in the Land of Quanta, 17 June 2003.

Last updated: 09 February 2013 . 02:00

Teaching

Hobbies:

Soccer
Basketball
Chess

Computational linear algebra (Fall 2008, 2009, 2010)
Numerical algorithms and complexity (Spring 2008, 2010)

Contact Information

Email: ipetras (at) cs (dot) columbia (dot) edu
Address: 516 CSB, 116 St & Broadway, New York, New York 10027

Iasonas Petras

Ph.D. student, Columbia University, Computer Science Department

ABOUT ME