Carl A. Miller
Fellow,
Joint Center for Quantum Information and Computer Science (QuICS)
Mathematician, NIST Computer Security Division
UMD phone: (301) 4057367
UMD office: 3100K Atlantic Building
Curriculum vitae
QuICS Profile




I am also an affiliate
faculty in Mathematics and AMSC and an adjunct in Computer Science and UMIACS.
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.
Activities:
Program Committee Member for QCRYPT 2018,
QIP 2016, TQC 2016, QCRYPT 2016.
Local/Scientific Organizing Committee for TQC 2019,
TYQI 2016, TYQI 2015.
Coorganizer
of the reading groups on Quantum
Cryptography and Quantum
Interactive Proofs at the University of Maryland.
Committee Member for the UMD High School Mathematics
Competition.
Team Member for the NIST
Postquantum Cryptography Project.
Selected work:
 The impossibility
of efficient quantum weak coinflipping.
Proceedings of the 52^{nd} Annual ACM SIGACT Symposium on
Theory of Computing (STOC 2020), pp. 916929.
 Experimental
lowlatency deviceindependent quantum randomness.
Yanbao Zhang, et al.
Physical Review Letters 124,
010505 (2020).
 Parallel
deviceindependent quantum key distribution.
Rahul Jain, Carl A. Miller, Yaoyun Shi.
 Parallel
selftesting 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,
pp. 4366.
 Universal
security for randomness expansion from the spotchecking protocol.
Carl A. Miller, Yaoyun Shi.
SIAM Journal on Computing 46, No. 4, pp. 13041335 (2017).
 Robust
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. 417426 (2014).
 Evasiveness of graph
properties and topological fixedpoint theorems. (Expository.)
Foundations and Trends in Theoretical Computer Science 7 (2013),
No. 4, pp. 337415.
 An EulerPoincare bound for equicharacteristic etale
sheaves.
(A condensed version of my dissertation.)
Algebra & Number Theory 4 (2010), No. 1, 2145.
Graduate students:
Yusuf Alnawakhtha (computer science)
Honghao
Fu (computer science)
Daochen Wang
(applied math, coadvised with Andrew Childs)
Teaching Files
(University of Michigan):
Miscellaneous: