Carl A. Miller
Assistant Research Scientist
Electrical Engineering & Computer Science
Department
University of Michigan, Ann Arbor
Email: carlmi @ umich.edu
Office: 2709 Beyster Bldg.
Phone: 7346477127
Curriculum vitae


Research:
I work on quantum information processing, a field
where a number of different disciplines and styles
of thinking converge. My
particular
focus is on quantum cryptography, where proving the security
of new protocols often involves some creative and interesting
mathematics. I am interested more generally in applications of
higher mathematics to theoretical computer science.
My recent work on quantum random number generation
is described in these lecture slides.
Activities:
Program Committee Member for QIP
2016.
Organizer (2016) and Local Organizer (2015) for the first two
Workshops on Trustworthy Quantum
Information.
CoLeader of the University of Michigan seminar on
quantum information processing.
Selected work:
 Universal security
for randomness expansion from the spotchecking protocol.
Carl A. Miller,
Yaoyun Shi.
 Robust
protocols for securely expanding randomness and distributing
keys using untrusted quantum devices.
Carl A. Miller,
Yaoyun Shi.
Proceedings of the 46th Annual ACM Symposium on Theory of Computing
(STOC '14), pp. 417426 (2014).
 Optimal robust quantum
selftesting by binary nonlocal XOR games.
Carl A. Miller, Yaoyun
Shi.
8th Conference on the Theory of Quantum Computation, Communication
and Cryptography, vol. 22, 254262 (2013).
 Optimal entanglementassisted
oneshot classical communication.
Brett Hemenway, Carl A. Miller,
Yaoyun Shi, Mary Wootters.
Physical Review A 87, 062301 (2013).
 Evasiveness of graph properties
and topological fixedpoint theorems. (Expository.)
Foundations and Trends in Theoretical Computer Science 7
(2011),
No. 4, pp. 337415.
Published May 2013.
 An EulerPoincare bound for
equicharacteristic etale sheaves.
(A condensed version of my dissertation.)
Algebra & Number Theory 4 (2010), No. 1, 2145.
Teaching: