Ph.D. in Computer Science (November 2003), Karlsruhe Institute of Technology

M.S. in Computer Science (January 1999), Karlsruhe Institute of Technology

**Associate Professor** (August 2011 - present)

Department of Electrical Engineering and Computer Science

University of Central Florida

**Visiting Associate Professor** (June 2012 - June 2013)

Center for Theoretical Physics and
Department of Mathematics

Massachusetts Institute of Technology

**Assistant Professor** (August 2006 - August 2011)

Department of Electrical Engineering and Computer Science

University of Central Florida

**Postdoctoral Scholar** (September 2004 to August 2006)

Institute for Quantum Information

California Institute of Technology

**Research Assistant** (February 1999 to August 2004)

Institute for Algorithms and Cognitive Systems

Karlsruhe Institute of Technology

**On the Probability of Generating a Lattice**

Felix Fontein and Pawel Wocjan

Journal of Symbolic Computation, Vol. 64, pp. 3-15, 2014

preprint version arXiv.org quant-ph/1211.6246

**Hidden Symmetry Subgroup Problems in Quantum Computing**

Thomas Decker, Gabor Ivanyos, Miklos Santha, and Pawel Wocjan

SIAM Journal on Computing 42(5), pp. 1987-2007, 2013

preprint version arXiv.org math/1211.6246

**New Spectral Bounds on the Chromatic Number Encompassing All Eigenvalues of the Adjacency Matrix**

Pawel Wocjan and Clive Elphick

The Electronic Journal of Combinatorics, Volume 20, Issue 3, #P39, 2013

preprint version arXiv.org math/1209.3190

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

**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),
January 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

I conduct research on Quantum Algorithms, Quantum Information, Cryptography, and Graph Theory.

NSF Career Award

UCF Research Incentive Award

**NSF CAREER Award: Algebraic Approach to the Design of Novel Quantum Algorithms **

National Science Foundation, Program: Emerging Models and Technologies, Award No.: CCF-0746600

**Novel Quantum Algorithms for Problems in Linear Algebra, Topology, and Group Theory**

National Science Foundation, Program: Emerging Models and Technologies, Award No.: CCF-0726771

- Algorithms (Design & Analysis of Algorithms, Randomized Algorithms, Approximation Algorithms)
- Artificial Intelligence
- Complexity Theory
- Cryptography
- Introduction to Discrete Structures
- Natural Language Processing
- Programming (C, Java, and Python)
- Quantum Computing and Quantum Information Theory

- CAP 6640 Natural Language Processing
- COT6600 Quantum Computing

- COT 6600: Quantum Computing
- COT 3100: Introduction to Discrete Structures

- COT 5405: Design and Analysis of Algorithms

- COT 5405: Design and Analysis of Algorithms
- COT 6410: Computational Complexity

- COT 3100: Introduction to Discrete Structures
- COT 6602: Quantum Information Theory