arXiv subjects

Thomas Steckmann

Publications and source records attributed to Thomas Steckmann.

4 recordsLinked to original sources

arXiv2025

Efficient Quantum Implementation of Dynamical Mean Field Theory for Correlated Materials

The accurate theoretical description of materials with strongly correlated electrons is a formidable challenge in condensed matter physics and computational chemistry. Dynamical Mean Field Theory (DMFT) is a successful approach that predicts behaviors of such systems by incorporating some of the correlated behavior using an impurity model, but it is limited by the need to calculate the impurity Green's function. This work proposes a framework for DMFT calculations on quantum computers, focusing on near-term applications. It leverages the structure of the impurity problem, combining a low-rank Gaussian subspace representation of the ground state and a compressed, short-depth quantum circuit that joins state preparation with time evolution to compute Green's functions. We demonstrate the convergence of the DMFT algorithm using the Gaussian subspace in a noise-free setting, and show the hardware viability of circuit compression by extracting the impurity Green's function on IBM quantum processors for a single impurity coupled to three bath orbitals (8 qubits, 1 ancilla). We discuss potential paths toward realizing this quantum computing use case in materials science.

quant-ph↗

arXiv2025

Error mitigation of shot-to-shot fluctuations in analog quantum simulators

Analog quantum simulators have provided key insights into quantum many-body dynamics. However, in such systems, both coherent and incoherent errors limit their scalability, hindering simulations in regimes that challenge classical simulations. In this work, we introduce an error mitigation technique that addresses and effectively suppresses a key source of error in leading simulator platforms: shot-to-shot fluctuations in the parameters for the Hamiltonian governing the system dynamics. We rigorously prove that amplifying this shot-to-shot noise and extrapolating to the zero-noise limit recovers noiseless results for realistic noise distributions. Experimentally, we demonstrate this technique on a 27-ion trapped-ion quantum simulator, extending the two-qubit exchange oscillation lifetime threefold. Numerically, we predict a significant enhancement in the effective many-body coherence time for Rydberg atom arrays under realistic conditions. Our scheme provides a possible route towards extending the effective coherence time in analog quantum experiments, enabling deeper explorations of quantum many-body dynamics.

quant-ph↗

arXiv2021

Mapping the metal-insulator phase diagram by algebraically fast-forwarding dynamics on a cloud quantum computer

Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model and thus gives an approximate solution of the Hubbard model from the solution of simpler quantum impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models by preparing and evolving the ground state under the impurity Hamiltonian on a quantum computer that is assumed to have the scalability and accuracy far beyond the current state-of-the-art quantum hardware. As a proof of principle demonstration targeting the Anderson impurity model we close the DMFT loop with current noisy hardware. With a highly optimized fast-forwarding quantum circuit and a noise resilient spectral analysis we observe a Mott phase transition. Based on a Cartan decomposition, our algorithm gives a fixed depth, fast-forwarding, quantum circuit that can evolve the initial state over arbitrarily long times without time-discretization errors typical of other product decomposition formulas such as Trotter decomposition. By exploiting the structure of the fast-forwarding circuits we reduce the gate count (to 77 CNOTs after optimization), simulate the dynamics, and extract frequencies from the Anderson impurity model on noisy quantum hardware. We then demonstrate the Mott transition by mapping the full metal-insulator phase-diagram. Near the Mott phase transition, our method maintains accuracy where Trotter error would otherwise dominate due to the long-time evolution required to resolve quasiparticle resonance frequency extremely close to zero. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware, made viable by a highly optimized computation in terms of gate depth, simulation error, and runtime on quantum hardware.

quant-ph↗

arXiv2021

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. We tackle this problem presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, that generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model, where a O(n^2)-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

quant-ph↗