Quantum Emergence and Quantum Computing

Our group works at the intersection of quantum information, condensed matter, machine learning, and computing. The simple rules of quantum mechanics are responsible both for the rich behavior seen in quantum materials and devices; as well as the advantages of quantum computers over classical ones. We develop and use computational tools to better understand many-body physics and move forward quantum computing.
Quantum Computing: Our interest in quantum computing is broad but we are primarily focused on building the quantum algorithms and error correction/mitigation necessary for using quantum computers as well as collaborating closely with (currently superconducting qubit) experimentalists to develop the components (e.g. robust qubits, better readout, error detection) needed for quantum computation. Our approach to quantum algorithms spans not only core algorithms (e.g. VQE, qubitization) but also the critical aspects of state preparation and tomography with pioneering work in both fields. Another key interest of ours is better delineating the quantum-classical boundary which not only constrains where quantum advantage lies but also tells us from where the true power of quantum computing comes.
Quantum Many Body Physics: In the area of quantum materials, our goal is to be able to understand and predict material properties. We are most often motivated by universal qualitative physics arising from model Hamiltonians and are particularly inspired by the emergent behavior (complicated phenomena arising from simple rules) of strongly correlated systems which are hard to predict from simple mean-field arguments. Our approach and perspective on these problems are computational and we apply the full computational toolbox of classical techniques from quantum Monte Carlo (VMC,PIMC,AFQMC,DMC), tensor networks (MPS,PEPS,MERA), and machine learning to tackle them.
Algorithms for the quantum many-body problem (machine-learning and otherwise): We are also heavily invested in and excited about the development of new computational methods often working to overcome the exponential wall in simulating quantum many-body physics and developing new algorithms to broaden the horizon of what's possible. Amongst our most impactful work has been the development of the Neural Network Backflow (NNBF) variational approach and we are rapidly improving and applying the technique. NNBF's unique integration of mean-field physics combined with its machine learning architecture allows it to focus on capturing crucial correlations rather than re-learning basic physics and it is currently the most accurate method for simulating a wide class of fermion and frustrated magnetism systems. Beyond NNBF, we've made important methodological improvements in various areas of quantum Monte Carlo (machine-learning wave-functions, sign problems, etc.) and tensor networks (Gutzwiller projected TN, stochastic approaches) as well as developed some novel inverse approaches which allow you to learn Hamiltonians from wave-functions or symmetries - a useful tool both for Hamiltonian learning on quantum computers as well as finding model systems with interesting behavior.
Machine Learning for Experiment : Beyond simulations, we also have a goal of using and developing machine learning techniques to better analyze experimental results and control experimental apparati. A good example of this work here has been using ML to identify atomic positions in scanning transmission electron microscopy data.
You can get a good sense for what we are working on by looking at our papers by topic or chronologically.
Pedagogy
tl;dr: Check out illinois-comphys
I am heavily involved in developing the computational physics curriculum at Illinois. Much of that work has been consolidated at the illinois-comphys site.
I developed from scratch our Junior/Senior computational
physics course, Physics 446. Here students,
among other things,
develop their own quantum computing simulator (and factor 55 on it!), do numerical RG on the Ising model, and build their own
diffusion model from scratch (all the while learning the underlying physics of how it works). I also re-developed a significant portion
of our Sophomore computational physics course, Physics 246
including developing a number of new modules on areas such as Predator-Prey simulations (differential-equations, continuous time markov-chains, and agent-based),
lattice Boltzmann methods, climate dynamics, machine learning, quantum computing, and more. I also restructured the logistics of the course around Jupyter notebooks.
Most recently, I've been developing new computational modules
to incorporate into our core curriculum including in
Classical Mechanics, E&M,
and Quantum Mechanics. Students write simulations to compute the equation of motion for coupled springs, the electric field lines of an oscillating electric dipole, diagonalize a Hydrogen atom on a grid, and compute perturbation theory to 30'th order.
I also developed from scratch a graduate computational physics courses, An Algorithmic Perspective on Strongly Correlated Systems although haven't gotten a chance to teach it much and so it is unpolished.
I've also taught other courses and
summer schools.
You might also be interested in learning about:
Variational Monte Carlo: See my notes
and video from the Boulder Summer School; the
videos [part 1, part 2] from
the Cornell Summer School on Emergent Phenomena; or my tutorials.
Diffusion Monte Carlo: See my notes
and video from the Boulder Summer School.
Path Integral Monte Carlo: See my tutorials (with Ken Esler and Paul Yubo).
Density Matrix Renormalization Group: Work through problem set 3 and problem set 4 from my graduate course to build a simple DMRG code in Julia.
News
Aug 2025
I am teaching
Physics 446 this semester.
Congratulations to Faisal Alam on passing his thesis defense!
May 2025
Congratulations to Matt Thibodeau on passing his thesis defense!
March 2025
Come see my invited talk on "Variational Wavefunctions for Fermions." We've made a lot of progress in pushing forward neural-network backflow approaches for simulating Fermions (and frustrated magnetism) and this talk will summarize much of that work.
Also come see the Clark Research Group give a variety of MM talks including:
- Non-equilibrium Quantum Monte Carlo for Stabilier Renyi Entropy in Spin Systems (Zejun)
- Optimizing Neural Network Backflow for Scalable Ab-Initio Quantum Chemistry (Andrew)
- Improved bounds on spectral gaps of random brickwork circuits (Daniel)
- Modeling fluxonium readout with Floqeut dynamics and two-level systems (Matt)
- Readout-induced leakage of fluxonium qubit
- Bipartite entanglement properties of squeezed bosons fermions and beyond
February 2025
Our paper,
Non-equilibrium Quantum Monte Carlo Algorithm for Stabilizer Renyi Entropy in Spin Systems has been published in
Physical Review B.
Surely mixing together two paints will increase the amount of mixedness. And this is true locally. But actually it might decrease
the amount of mixing globally. This turns out to be true for quantum circuits as well. Added uniform Haar gates can actually decrease
the time to reach a unitary t-design. See our newly
posted paper
Absence of censoring inequalities in random quantum circuits to see how.
We've posted our paper,
Efficient optimization of neural network backflow for ab-initio quantum chemistry to the
arxiv. In it we improve the optimization of NNBF wave-functions for molecular
Hamiltonians. We both significantly speed up such simulations as well as make them more accurate. Our energies are consistently
better then CCSD(T) as well as other methods.
Zejun will be giving a poster on our work on simulation of Clifford circuit at the Aspen AI+Quantum winter conference.
Come see Daniel's poster at QIP 2025 on our results for the unitary t-designs of random architectures
January 2025
Our paper
Readout-induced leakage of the fluxonium qubit has been posted on the
arxiv. We model a fluxonium-resonator
system coupled to additional TLS and find strong agreement between theory and experiment.
I'll be teaching Physics 446 this semester. Come learn some exciting computational physics.
December 2024
Our work on
Approximate t-designs in generic circuit architectures has been accepted to PRX-Quantum. While much has been
known about the scrambling time for 1d brickwork circuits, very little is know about the rate of scrambling for general architectures. We show
that a general architecture reaches an approximate unitary t-design in linear depth as long as the circuit is well-connected.
We've posted a paper on
Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states on the
arxiv.
A deep question in quantum computing is to determine the dividing line between what quantum circuits can be simulated classical and which ones can't.
We identify a large class of quantum circuits (many Clifford circuits with N number of T gates) which can be simulated efficiently classically.
Our paper,
Classical postprocessing for the unitary block-optimization scheme to reduce the effect of noise on the optimization of variational quantum eigensolvers has been accepted in Physical Review A. I am optimistic about the general philosophy in this (and other recent) papers that we should be heavily post-processing our output from quantum computers.
November 2024
Our work on
Conditional t-independent spectral gap for random quantum circuits and implications for t-design depths has been posted on the
arxiv. There has been a lot of recent interest in the scrambling time
for various quantum circuits. Here we focus on the brickwork circuit and improve both a number of constant factors on various
known results but also say something new about the dependence on the t-design depth at small epsilon (as opposed to a
function of system size N which has been more recently explored in other works).
The IBM white paper,
Transforming the Hybrid Cloud for Emerging AI Workloads has been posted on the
arxiv
October 2024
Measurement plus adaptive feedback is a powerful new model of state preparation which allows a loophole in
the standard "no-go theorems" which restrict the speed of unitary state-preparation. Unfortunately, to date, only a small
number of examples where this is possible have been found. Part of the difficulty is that each example requires new analytic
insight. We have
posted a new paper on the arxiv which develops a classical
algorithm to find effecient measure+adapative feedback preparation for states. Interestingly, we find that often even with
a small number of ancilla you can build many states with MAPF more efficiently then with unitary state preparation.
Our paper,
The Floquet Fluxonium Molecule: Driving Down Dephasing in Coupled Superconducting has been published in
PRX-Quantum.
We believe that this is a new promising qubit for building quantum computers.
Congratulations Chad Germany on passing his thesis defense!
September 2024
Our paper,
Constant-depth preparation of matrix product states with adaptive quantum circuits has been accepted into
PRX and featured in
Physics. Congrats to my student Abid and (co-first author) Kevin Smith for this nice work.
Our paper,
A Unifying View of Fermionic Neural Network Quantum States: From Neural Network Backflow to Hidden Fermion Determinant States has been published in
Physical Review B. We do two important things in this paper (which in retrospect was a mistake - never do two things in one paper). First, we showed that hidden fermion approaches are (essentially - read the paper for details!) just a type of NNBF. Secondly, we explored what properties made neural networks powerful showing that highly oscillatory amplitudes and sign-structures were signatures of highly accurate wave-functions. This was our first NNBF where we used a full-determinant approach to NNBF (previously done in the continuum). This full-determinant approach is somewhat more general then the continuum including full "spinor wave-functions" as well.
Our paper,
Neural network backflow for ab-initio quantum chemistry has been published in
Physical Review B
I'll be teaching Physics 246 this semester.
We're excited (thanks NSF!) to have funding to use machine learning to improve manufacturing of nano-photonics using machine learning techniques as well as funding (thanks IBM!) as part of the IIDAI institute to use shadow tomography to improve error mitigation.
August 2024
Congratulations to James Allen on passing his thesis defense. James is moving to a postdoc at University of Montreal with William Krempa
June 2024
Our new paper,
Quantum Hardware-Enabled Molecular Dynamics via Transfer Learning is now on the
arxiv . In it, we tackled a problem of how to efficaciously use the output of a quantum computer.. Here we show that if you just have a little bit of energies from molecules on a quantum computer you can combine that with a large amount of DFT data and learn the potential energy landscape induced by the quantum computer's energies even if you didn't have enough data to perform this learning from scratch. This is a new step in more intelligently using the rare resources of quantum computing output.
May 2024
Our new paper,
Non-equilibrium Quantum Monte Carlo Algorithm for Stabilizer Renyi Entropy in Spin Systems , is now on the
arxiv. Stabilizer renyi entropy is a way to measure quantum magic. We demonstrate a way to measure SRE on ground states of large sign-free Hamiltonians using quantum Monte Carlo. This is significantly more efficient then previous approaches using matrix product states.
Congratulations Abid on this thesis defense! Good luck Abid at his next step at JP Morgan Quantum.
Come see my talk on
From State Preparation to Process Shadow Tomography at the NQI Joint Algorithms Workshop
in New Mexico.
April 2024
We've posted our paper,
Constant-depth preparation of matrix product states with adaptive quantum circuits, the
arxiv. Here we characterize an interesting class of matrix product states that can be generated on a quantum computer in constant depth using measurement plus adaptive feedback.
We've posted our paper,
Classical postprocessing for the unitary block-optimization scheme to reduce the effect of noise on the optimization of variational quantum eigensolvers, on the
arxiv. We find that by classically post-processing the output of UBOS (the best method for variational quantum eigensolvers) we can use significantly fewer quantum measurements while still robustly optimizing the energy of quantum circuits.
Come see my IIIAI talk on how Quantum Computing may (or may not) help machine learning.
March 2024
We've posted our paper on Neural network backflow for ab-initio quantum chemistry on the
arxiv. NNBF is known to be a powerful method for lattice models. Here we show that it can also produce state-of-the-art energies for molecular systems. To reach this point, though, we needed to develop new algorithms for optimization in these systems overcoming issues with peaked molecular wave-functions and a quartic number of Hamiltonian terms.
Come see our work at the March Meeting:
- F46.00012 Approximate t-design in general architectures (James)
- F52.00002 Learning dynamic quantum circuits for state preparation (Faisal)
- K48.00006 The effects of readout photons on the fluxonium qubit
- M48.00010 A composite Floquet flux qubit with long coherence (Matt)
- Q60.00012 Comparing variants of Neural Network Backflow and Hidden Fermion Determinant States (Zejun)
- T60.00002 Neural Network Backflow for ab initio quantum chemistry in second quantization (Andrew)
- Y50.00006 Quantum Hardware-Enabled Molecular Dynamics via Transfer Learning (Abid)
Jan 2024
Our paper on developing classical shadows for quantum process or channels has now been
published in Physical Review Research. Check it out if you're looking to measure your quantum computer on scrambled input and output and then later on (noisily) query what result it would have given you on a particular input and output.
We've posted to the
arxiv our paper on the Floquet Fluxonium Molecule. In it we propose a protected composite qubit which is robust to bit flip errors as well as phase flip errors at second order.
I'll be teaching Physics 446 this semester. Come discover how to be a computational physicsist.