Quantum Computation
Information-based complexity
Publications
- Anargyros Papageorgiou, Iasonas Petras, Joseph F. Traub and Chi Zhang, A fast algorithm for approximating the ground state energy on a quantum computer, arXiv:1008.4294v2 [quant-ph], 2010.
- 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.
Last updated: 26 October 2011 . 02:00
Teaching
Hobbies:
- Soccer
- Basketball
- Chess
- Computational linear algebra (Fall 2008, 2009, 2010)
- Numerical algorithms and complexity (Spring 2008, 2010)
Last updated: 26 October 2011 . 02:00
Contact Information
- Email: ipetras (at) cs (dot) columbia (dot) edu
- Address: 516 CSB, 116 St & Broadway, New York, New York 10027