Sean
Hallgren Contact: Department of Computer Science and
Engineering 863-1265 (o) Penn State Theory Group PECASE
Award
Papers:
Classical Cryptographic
Protocols in a Quantum World , with Adam Smith and Fang Song, 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,
STOC 2006. Journal of the
ACM, 57(6), article 34, 2010. pdf
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:
Theory of Computation,
Spring/Fall 2011 Computational Complexity,
Fall 2010 Algorithm Design and
Analysis, Fall 2009 Discrete Mathematics,
Spring/Fall 2008 Quantum Computation, Fall
2007, Spring 2010, Spring 2012 Theory
of
Computation , Princeton University, Fall 2006
My old team
