Research
My research interests are quantum computing and its comparison to classical computing. I am especially interested in quantum algorithms for combinatorial and numerical problems and the complexity of these problems on quantum and classical computers. I would like to explore the limitations of quantum computing both in noise free and noisy settings and the possibilities and limitations of fault-tolerant quantum computing.
Another area of interest of mine is the simulation of quantum systems on quantum and classical computers, especially through Monte Carlo simulation. Here I am also interested in algorithms and their complexity analysis.
Publications
- Sergey Bravyi, Arvid J. Bessen, Barbara M. Terhal, "Merlin-Arthur Games and Stoquastic Complexity", Nov 2006.
- Arvid Bessen, A Lower Bound for the Sturm-Liouville Eigenvalue Problem on a Quantum Computer, Journal of Complexity, Vol. 22(5), pp. 660-675, Oct 2006. quant-ph/04512109.
- Arvid J. Bessen, "Distributions of continuous-time quantum walks", Sep 2006.
- Arvid J. Bessen, Lower bound for quantum phase estimation, Physical Review A, Vol. 71(4), pp. 042313-, Apr 2005, quant-ph/0412008.
- Arvid J. Bessen, The Power of Various Real-Valued Quantum Queries, Journal of Complexity, Vol. 20(4), pp. 699-712, Oct 2004, quant-ph/0308140
- Diploma thesis "Quantum Computing in Various Black Box Models", University of Kaiserslautern, 2002
- Project thesis "A Spatial Caching Data Structure for Visualisation", University of Kaiserslautern, 2001
Teaching
TA for "Introduction to Quantum Computing" (COMS W4281) in Summer 2005, CVN, Columbia UniversityTA for "Introduction to Computational Complexity" (COMS W4236) in Spring 2005, Columbia University
TA for "Introduction to Quantum Computing" (COMS W4995) in Spring 2004, Columbia University
TA for various course at the University of Kaiserslautern
Personal
Email: arvid at bessen {dot} de .Website: www.bessen.de.
Some holiday pictures.
You can also find me on friendster.
My current resume.