Carl A. Miller
Assistant Research Scientist
Electrical Engineering & Computer Science
University of Michigan, Ann Arbor
E-mail: carlmi @ umich.edu
Office: 2709 Beyster Bldg.
I work on quantum information processing, a field
where a number of different disciplines and styles
of thinking converge. My
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.
Program Committee Member for QIP
Organizer (2016) and Local Organizer (2015) for the first two
Workshops on Trustworthy Quantum
Co-Leader of the University of Michigan seminar on
quantum information processing.
- Universal security
for randomness expansion from the spot-checking protocol.
Carl A. Miller,
protocols for securely expanding randomness and distributing
keys using untrusted quantum devices.
Carl A. Miller,
Proceedings of the 46th Annual ACM Symposium on Theory of Computing
(STOC '14), pp. 417-426 (2014).
- Optimal robust quantum
self-testing by binary nonlocal XOR games.
Carl A. Miller, Yaoyun
8th Conference on the Theory of Quantum Computation, Communication
and Cryptography, vol. 22, 254-262 (2013).
- Optimal entanglement-assisted
one-shot classical communication.
Brett Hemenway, Carl A. Miller,
Yaoyun Shi, Mary Wootters.
Physical Review A 87, 062301 (2013).
- Evasiveness of graph properties
and topological fixed-point theorems. (Expository.)
Foundations and Trends in Theoretical Computer Science 7
No. 4, pp. 337-415.
Published May 2013.
- An Euler-Poincare bound for
equicharacteristic etale sheaves.
(A condensed version of my dissertation.)
Algebra & Number Theory 4 (2010), No. 1, 21-45.