Carl A. Miller Co-Director, Joint Center for Quantum Information and Computer Science (QuICS) Mathematician, NIST Computer Security Division UMD phone: (301) 405-7367 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 QCRYPT 2023, QIP 2023, TQC 2022, QCRYPT 2018, QIP 2016, TQC 2016, QCRYPT 2016.

Local or Scientific Organizing Committee Member for TQC 2019, TYQI 2016, and TYQI 2015.

Scientific Lead for the MathQuantum RTG at UMD.

Team Member for the NIST Postquantum Cryptography Project.

Committee Member for the UMD High School Mathematics Competition.

Selected work:

• Hidden-state proofs of quantumness.
• Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model.
  Kelsey A. Jackson, Carl A. Miller, Daochen Wang.
  Advances in CRYPTOLOGY - EUROCRYPT 2024, pp. 418-446. (2024)
• Perfect cheating is impossible for single-qubit position verification.
  Carl A. Miller, Yusuf Alnawakhtha.
• Lattice-based quantum advantage from rotated measurements.
  Yusuf Alnawakhtha, Atul Mantri, Carl A. Miller, Daochen Wang.
  Quantum 8, pp. 1399 (2024).
• The mathematics of quantum coin-flipping.
  Notices of the American Mathematical Society 69, no. 11, pp. 1908-1917 (2022).
• The membership problem for constant-sized quantum correlations is undecidable.
  Honghao Fu, Carl A. Miller, William Slofstra.
• Experimental low-latency device-independent quantum randomness.
  Yanbao Zhang, et al.
  Physical Review Letters 124, 010505 (2020).
• Universal 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, No. 4, pp. 337-415 (2013).
• An Euler-Poincare bound for equicharacteristic etale sheaves.
  (A condensed version of my dissertation.)
  Algebra & Number Theory 4, No. 1, 21-45 (2010). 

Graduate students:

Honghao Fu (computer science, graduated in 2021, now an assistant professor at Concordia University)

Daochen Wang (applied math, graduated in 2023, now an assistant professor at the University of British Columbia)

Yusuf Alnawakhtha (computer science)

Kelsey Jackson (physics)

Khalil Guy (applied math)

 

Miscellaneous:

• Recreational math problems from a long time ago.
• My NIST blog essay, "Quantum Information: Changing the Rules of the Game.”
• Webpages for old seminars:
• Seminar on Quantum Cryptography with Classical Communication
• IQC-QuICS Math and Computer Science Seminar
• Quantum Information Math RIT
• Reading Group on Quantum Cryptography
• Reading Group on Quantum Interactive Proofs
• Old teaching files from the University of Michigan:

o   Math 312 (Applied Modern Algebra)

o   Math 567 (Introduction to Coding Theory) 

o   Math 425 (Introduction to Probability)

o   Math 217 (Linear Algebra)

• Hi from South Detroit.