Carl A. Miller
Joint Center for Quantum Information and Computer Science (QuICS)
Mathematician, NIST Computer Security Division
UMD phone: (301) 405-7367
UMD office: 3100K Atlantic Building
I am also an affiliate
faculty in Mathematics and AMSC and an adjunct in Computer Science 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 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.
Co-organizer of the IQC-QuICS Math and Computer Science
Member for the UMD High School
impossibility of efficient quantum weak coin-flipping.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory
of Computing (STOC 2020), pp. 916-929.
membership problem for constant-sized quantum correlations is undecidable.
Honghao Fu, Carl A. Miller, William Slofstra.
low-latency device-independent quantum randomness.
Yanbao Zhang, et al.
Physical Review Letters 124,
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,
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).
- 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.
Honghao Fu (computer
science, graduated in 2021, now a postdoc at MIT)
Daochen Wang (applied math,
co-advised with Andrew Childs)
o Math 312 (Applied Modern Algebra)
o Math 567 (Introduction to Coding Theory)
o Math 425 (Introduction to Probability)
o Math 217 (Linear Algebra)