Carl Miller

carl-miller's picture
Adjunct Assistant Professor
3102 Atlantic Building
(301) 405-7367

Carl Miller is an Adjunct Assistant Professor in the University of Maryland Institute for Advanced Computer Studies and a Mathematician in the Cryptographic Technologies group at NIST.


Miller studies new security proofs for quantum cryptography.  His particular focus is on developing mathematical techniques for untrusted-device cryptography, where initial assumptions for the security proof are minimal.  Specific topics of interest include random number generation, rigidity properties of nonlocal games, and parallel repetition. 


Miller received a Ph. D. in Mathematics from Berkeley in 2007.



C. Miller and Shi, Y., Randomness in nonlocal games between mistrustful players, Quantum Information and Computation, vol. 17, no. 7&8, pp. 0595-0610, 2017.



C. Miller, Evasiveness of Graph Properties and Topological Fixed-Point Theorems, Foundations and Trends in Theoretical Computer Science, vol. 7, pp. 337-415, 2013.
C. Miller and Shi, Y., Optimal robust self-testing by binary nonlocal XOR games, in 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, vol. 22, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2013, pp. 254–262.


E. Chitambar, Miller, C., and Shi, Y., Deciding Unitary Equivalence Between Matrix Polynomials and Sets of Bipartite Quantum States, Quantum Information and Computation, vol. 11, no. 9-10, pp. 813–819, 2011.


C. Miller, An Euler–Poincaré bound for equicharacteristic étale sheaves, Algebra & Number Theory, vol. 4, no. 1, pp. 21 - 45, 2010.
E. Chitambar, Miller, C., and Shi, Y., Matrix pencils and entanglement classification, Journal of Mathematical Physics, vol. 51, no. 7, p. 072205, 2010.