I am spending my sabbatical at the Center for Theoretical Physics at the
Massachusetts Institute of Technology from June 2012 till July 2013.
Before I joined UCF in August 2006, I conducted research in quantum information science as a postdoctoral scholar
in computer science at the Institute for Quantum Information
at the California Institute of Technology from September 2004 to August 2006.
Contact Info
Department of Electrical Engineering and Computer Science
University of Central Florida
Orlando, FL 32816-2362
Phone: +1 (407) 823-2844
Email: (my lastname) AT eecs.ucf.edu
Quantum Algorithms for One-Dimensional Infrastructures
Pradeep Sarvepalli and Pawel Wocjan
preprint version arXiv.org quant-ph/1106.6347
Hidden Symmetry Subgroup Problems in Quantum Computing
Thomas Decker, Gabor Ivanyos, Miklos Santha, and Pawel Wocjan
preprint version arXiv.org quant-ph/1107.2189
Quantum Speed-Up for Approximating Partition Functions
Pawel Wocjan, Chen-Fu Chiang, Anura Abeyesinghe, and Daniel Nagaj
Phys. Rev. A, Vol. 80, 022340, 2009
preprint version quant-ph/0811.0596
Preparing Ground States of Quantum Many-Body Systems on a Quantum Computer
David Poulin and Pawel Wocjan
Phys. Rev. Lett., Vol. 102, 130503, 2009
preprint version quant-ph/0809.2705
Efficient Quantum Algorithm for Identifying Hidden Polynomials
Thomas Decker, Jan Draisma, and Pawel Wocjan
Quantum Information and Computation, vol. 9, no. 3&4, pp. 215-254, 2009
preprint version arXiv.org quant-ph/0706.1219
A Simple PromiseBQP-complete Matrix Problem
Dominik Janzing and Pawel Wocjan
Theory of Computing, Volume 3, pp. 61-79, 2007
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem
Andrew M. Childs, Aram W. Harrow, and Pawel Wocjan
Lecture Notes in Computer Science 4393, Proc. of 24th International Symposium on Theoretical Aspects of Computer Science, 2007, pp. 598-609
preprint version arXiv.org quant-ph/0609110
The Jones Polynomial: Quantum Algorithms and Applications in Quantum Complexity Theory
Pawel Wocjan and Jon Yard
Quantum Information and Computation, Vol. 8, No. 1&2, pp. 147-180, 2008
preprint version arXiv.org quant-ph/0603069
Computational Power of Hamiltonians in Quantum Computing
Ph.D. thesis (Dissertation), University of Karlsruhe (Germany),
November 2003
Ph.D. thesis (in English with additional introduction in German)
ps format
pdf format
The Brill-Noether Algorithm: Construction of Geometric Goppa Codes
and Absolute Factorization
Master Thesis (Diplomarbeit), University of Karlsruhe (Germany),
February 1999
Master thesis (in English)
ps format
pdf format
Design of Diffractive Elements with the Finite Element Method
Undergraduate Thesis (Studienarbeit), University of Karlsruhe (Germany),
1997
Undergraduate Thesis (in German)
ps format
pdf format