MIT Center for Theoretical Physics – a Leinweber Institute

Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision $varepsilon$ using $O(1/varepsilon)$ total evolution time. However, in Hamiltonian property testing, the best known algorithms have $O(1/varepsilon^2)$ total evolution time, unless it is possible to $textit{reverse}$ the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.

Relativistic heavy quarks equilibrate even when their microscopic drag and momentum diffusion violate the Einstein relation. We investigate how equilibration proceeds as a function of the coupling and compared to simplified Fokker-Planck models. To do this, we present a detailed calculation of the momentum-transfer kernel in weakly coupled non-Abelian plasmas through strict $mathcal{O}(g^4)$, and study the resulting dynamics at leading order in the inverse heavy-quark mass. Beyond leading logarithm, its non-Gaussian structure plays a crucial role in equilibration. We examine closely the analytic structure of the evolution kernel, determine the large-order asymptotics of the momentum-transfer cumulants, and show how the kernel's bounded analytic domain fixes asymmetric exponential tails at the level of the momentum transfer probability. Strongly coupled $mathcal{N}=4$ SYM also features an approximately Gaussian core and exponential tails, but differs in the nature of the kernel's singularities and the velocity dependence of the transport coefficients and tail exponents. These differences have distinct dynamical consequences: for the parameters studied, the persistence of the relativistic population in steeply falling spectra is largely explained by drag alone at very weak coupling, whereas fluctuation-induced survivor bias produces a large relative enhancement at strong coupling. Nevertheless, the shared qualitative structure between weak and strong coupling points the way towards a practical phenomenological description of heavy quarks anchored in first-principles field theory.

We present a technique for computing Drell-Yan lepton pair production at particle-level that achieves N$^3$LO and approximate N$^4$LL$'$ accuracy at small to moderate transverse momentum, tree-level precision for $Z+4$, $5$, and $6$ jets, and approximate NLO EW precision at high transverse momentum. A crucial non-perturbative input, the Collins-Soper kernel, is obtained from continuum-limit lattice QCD results. High-precision theory results are recast into strictly positive event weights using an information-theoretic approach based on the maximum entropy principle.

Discretizing electronic degrees of freedom into atomic orbitals is the default choice to accurately model electrons in molecules in a compact and flexible way. We consider the task of simulating such electronic structure models on a quantum computer for $N$ orbitals, keeping the number of orbitals per atom constant. Atomic orbitals give rise to Hamiltonians with potentially up to $mathcal{O}(N^4)$ terms and little structure, which made it challenging to match the complexity of methods based on plane waves and real-space grids. In this work, we show that a Trotter step for atomic orbitals can be implemented in depth $mathcal{O}(mathrm{polylog}(N))$ without ancillas by combining a rigorous treatment of orbital localization, a hierarchical Hamiltonian decomposition based on the Fast Multipole Method, and shallow quantum Fourier arithmetic circuits. By bounding the Trotter error, we obtain sublinear simulation depth, and our total gate count $N^{5/3 + o(1)}$ matches the best scaling known for any basis.