Carl A. Miller
NIST Computer Security Division
Joint Center for Quantum Information and Computer Science (QuICS)
UMD phone: (301) 405-7367
UMD office: 3100K Atlantic Building
I am an affiliate faculty of the Mathematics
Department and an adjunct in the Computer
Science Department and UMIACS.
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.
Program Committee Member for QCRYPT 2018,
QIP 2016, TQC 2016, QCRYPT 2016.
Local/Scientific Organizing Committee for TQC 2019,
TYQI 2016, TYQI 2015.
of the Math RIT
on Quantum Information at the University of Maryland.
Committee Member for the UMD High School Mathematics
Team Member for the NIST
Postquantum Cryptography Project.
low-latency device-independent quantum randomness.
Yanbao Zhang, et al.
device-independent quantum key distribution.
Rahul Jain, Carl A. Miller, Yaoyun Shi.
self-testing of the GHZ state with a proof by diagrams.
Spencer Breiner, Amir Kalev,
Carl A. Miller.
Proceedings of the 15th International Conference on Quantum Physics and
Logic (QPL 2018), EPTCS 287,
models: an approach to steerability.
Carl A. Miller, Roger Colbeck, Yaoyun Shi.
Journal of Mathematical Physics 59, 022103 (2018).
- Rigidity of
the magic pentagram game.
Amir Kalev, Carl A. Miller.
Quantum Science and Technology 3, No. 1, 015002 (2018).
randomness: examples and application.
Honghao Fu, Carl A. Miller.
Physical Review A 97, 032324 (2018).
security for randomness expansion from the spot-checking protocol.
Carl A. Miller, Yaoyun Shi.
SIAM Journal on Computing 46, No. 4, pp. 1304-1335 (2017).
protocols for securely expanding randomness and distributing keys using
untrusted quantum devices.
Carl A. Miller, Yaoyun Shi.
Journal of the ACM 63, Issue 4, Article 33 (2016).
Proceedings of the 46th Annual ACM Symposium on Theory of Computing
(STOC), pp. 417-426 (2014).
- Evasiveness of graph
properties and topological fixed-point theorems. (Expository.)
Foundations and Trends in Theoretical Computer Science 7 (2013),
No. 4, pp. 337-415.
Euler-Poincare bound for equicharacteristic etale sheaves.
(A condensed version of my dissertation.)
Algebra & Number Theory 4 (2010), No. 1, 21-45.
- NSF STARSS: TTP. A Quantum Approach to Hardware
Security: from Theory to Optical Implementation. Co-PI. September 1, 2015
- August 31, 2018. $388,333.
- NSF PFI: AIR-TT. Prototyping Untrusted-Device Quantum
Cryptography. Co-PI. April 1, 2015 - March 31, 2016. $211,924.
- NSF I-Corps Program. Practical and Provably Secure
Random Number Generator. Entreprenurial Lead.
Dec. 1, 2014 - May 31, 2015. $50,000.
(University of Michigan):