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 Chair for QCRYPT 2021;
Program Committee Member for TQC 2022, QCRYPT
2018, QIP 2016, TQC 2016, and QCRYPT 2016.
Local or Scientific Organizing Committee Member for TQC 2019, TYQI 2016, and TYQI 2015.
Team Member for the NIST
Postquantum Cryptography Project.
Coorganizer of the IQCQuICS Math and Computer Science
Seminar.
Committee
Member for the UMD High School
Mathematics Competition.
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.
 The
membership problem for constantsized quantum correlations is undecidable.
Honghao Fu, Carl A. Miller, William Slofstra.
 Experimental
lowlatency deviceindependent quantum randomness.
Yanbao Zhang, et al.
Physical Review Letters 124,
010505 (2020).
 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).
 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:
Honghao Fu (computer
science, graduated in 2021, now a postdoc at MIT)
Yusuf Alnawakhtha
(computer science)
Daochen Wang (applied math,
coadvised with Andrew Childs)
Miscellaneous:
o Math 312 (Applied Modern Algebra)
o Math 567 (Introduction to Coding Theory)
o Math 425 (Introduction to Probability)
o Math 217 (Linear Algebra)