Assistant Professor in the Center for Quantum Computing, Science, and Engineering @michiganstateu. Previously @NASA, @IBM, @UnitaryFdn, @TheTeamAtX, @Google.
Joined April 2018
- Tweets487
- Following692
- Followers2.7K
- Likes1.9K
Pinned Tweet
Cheers to the first graduating class of the LANL Quantum Computing Summer School. Very fun and productive summer with many algorithms and friendships developed. Can easily see this as one of the best places to be for quantum algorithms.
We reached the canonical algorithms! Shor's algorithm and Grover's algorithm explained simply, each in seven parts, on the quantum computing playlist.
Plot: Interference pattern generated by Shor's algorithm on an integer, enabling its factors to be determined.
QC Playlist ⬇️
3. In arxiv.org/abs/2601.19059, we computed the cost of quantum algorithms for metaphosphate hydrolysis on current, near-term, and fault-tolerant quantum computers. This stems from our work as finalists in the Q4Bio $50M challenge and the NIH Quantum Computing Grand Challenge
Our group’s research collaborators include Stanford, Brown, University of Michigan, University of Oslo, Virginia Tech, Los Alamos National Lab, Johns Hopkins Applied Physics Lab, NASA, Unitary Foundation, Azulene, QuEra, HPE, SandboxAQ, and more.
I’m hiring PhD students and postdocs!
With recent funding from NSF, DOE, ARPA-E, and NIH, my research group is expanding. (1/10)
2. In arxiv.org/abs/2608.23460, we developed the theory & practice of algorithmic quantum code design, proving the problem is NP-complete in the worst case, finding a phase transition in average-case hardness, & using SAT solvers with relevant cases to find new and improved codes
1. In arxiv.org/abs/2607.21337, we showed how to classically simulate all recent large-scale SQD experiments with unitary cluster Jastrow circuits. These comprise some of the largest quantum computations to date
Prospective PhD students can apply directly to CMSE, ECE, or Physics at MSU, but all candidates are strongly encouraged to contact me by email with CV/prior experience for next steps.
A few recent research highlights:
If you’re interested in quantum information science, quantum algorithms, quantum error correction, machine learning, tensor networks, and/or quantum-inspired algorithms, we could have opportunities for you.
Although {H, T} is discrete, it's universal! The core reason is that HTHT is a rotation about an angle that's an 𝘪𝘳𝘳𝘢𝘵𝘪𝘰𝘯𝘢𝘭 multiple of 2π. This means that as you wrap around the unit circle, you'll always hit new points: Irrationality ⇒ Universality.
QC Playlist ⬇️
One of the most useful results in quantum computing to experimentalists is that a small number of quantum gates can generate any unitary. Famously, a general single-qubit unitary U and CNOT are universal. We prove this in the latest QC Playlist videos!
QC Playlist ⬇️
In today's Quantum Computing Playlist video, a famous decomposition of a multi-controlled unitary. When applied to U = X, this gives a decomposition of the Toffoli gate with 6 CNOTs and 7 T gates.
Quantum Computing Playlist ⬇️
