Sean
Hallgren
Contact:
Department of Computer Science and
Engineering
The Pennsylvania State University
348A IST
Building
University Park, PA 16802
(814) 863-1265 (o)
(814) 865-3176 (f)
Penn State Theory Group
Papers:
Algorithms for ray class
groups and Hilbert class fields, with Kirsten Eisenträger,
Superpolynomial speedups
based on almost any quantum circuit, with Aram Harrow,
Making classical honest
verifier zero knowledge protocols secure against quantum attacks, with Alexandra Kolla, Pranab Sen,
and Shengyu Zhang,
Limitations of Quantum
Coset States for Graph Isomorphism, with
Cristopher Moore, Martin Roetteler, Alexander Russell, and Pranab Sen,
Fast Quantum Algorithms for
Computing the Unit Group and Class
Group of a Number Field,
Quantum Noisy Rational
Function Reconstruction , with Alexander
Russell and Igor Shparlinski,
Quantum Algorithms
for
some Hidden Shift Problems , with Wim van Dam and Lawrence Ip,
SIAM Journal on
Computing, 36(3):763-778, 2006. pdf
Polynomial-Time
Quantum
Algorithms for Pell's Equation and the Principal Ideal
Problem ,
STOC 2002. ps pdf
Journal of the ACM,
54(1):1-19, 2007.
Quantum
Fourier Sampling, the
Hidden Subgroup
Problem, and Beyond,
Ph.D. Thesis,
University of California, Berkeley, 2000. ps
pdf ( Chapters )
An
Improved Quantum
Fourier Transform Algorithm and Applications , with Lisa Hales,
Normal Subgroup
Reconstruction and Quantum Computation Using Group Representations
, with Alexander
Russell and Amnon Ta-Shma,
SIAM
Journal on Computing, 32(4):916-934, 2003. pdf
Quantum
Fourier
Sampling
Simplified , with Lisa Hales,
Teaching:
Quantum Computation, Spring 2010
Algorithm Design and
Analysis, Fall 2009
Discrete Mathematics,
Spring/Fall 2008
Quantum Computation, Fall
2007
Theory
of Computation , Princeton University, Fall 2006
My old team