### Quantum Computation

### Information-based complexity

### Princeton University

### Publications

- 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 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

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

Last updated: 11/29/2015

### Teaching

*As Lecturer at Princeton University*

- COS 217: Introduction to Programming Systems [Fall 2013, Spring 2014, Fall 2014, Spring 2015, Fall 2015, Spring 2016, Fall 2016]
- COS 340: Reasoning about Computation [Fall 2016]
- Princeton University Matlab short course, 2nd Lecture [Fall 2014, Fall 2015, Fall 2016]. Princeton students should follow this Blackboard link to access the course material.
- Computational linear algebra (Fall 2008, 2009, 2010)
- Numerical algorithms and complexity (Spring 2008, 2010)

*As Teaching Assistant at Columbia University*

### Contact Information

- Email: ipetras (at) cs (dot) princeton (dot) edu
- Address: CS 209, Department of Computer Science, Princeton University, 35 Olden Street, Princeton, NJ 08540