Searcharxiv⌕ Search

arXiv subjects

Alexander F. Kemper

Publications and source records attributed to Alexander F. Kemper.

At least 19 recordsLinked to original sources
arXiv2026

Large-scale quantum simulations of dissipative spin-1/2 Heisenberg chains

A quantum many-body system coupled to an environment relaxes to a nonequilibrium steady state that can sustain order with no equilibrium counterpart. Computing such steady states is harder than closed-system dynamics as the density matrix problem squares the Hilbert-space dimension, and no free energy selects the steady state. The dissipative spin-1/2 Heisenberg chain is a benchmark example for nonequilibrium steady state physics; various methods have each calculated its phase diagram but do not agree, and a controlled determination at large system size has remained out of reach. Here we simulate the Lindblad dynamics of chains of up to 50 sites on the superconducting processor ibm_kingston -- 100 simultaneously active qubits at up to 1700 entangling-gate depths -- realizing the dissipation via Stinespring dilation. The system's dissipative evolution is a self-correcting mechanism that effectively erases errors, so hardware noise enters only as a weak competing dissipator. We measure static structure factors and resolve ferromagnetic, antiferromagnetic, spin-density-wave, and paramagnetic steady states, mapping the phase diagram with 117 quantum hardware data points across the $J_x$--$J_y$ plane. We uncover a rich non-equilibrium phase diagram of ordered phases with only remnants of the mean-field order, and where sharp transitions give way to the crossovers expected in one dimension. We also find the existence of an incipient (Trotter-induced) spin density wave phase, highlighting the potential of controlled Trotterization as a tool to engineer various magnetic phases in dissipative spin systems. Our quantum simulations largely settle the lingering uncertainty regarding the correct phase diagram of this benchmark system. Moreover, they show that quantum computers are now a feasible tool for addressing scientific questions involving dissipative quantum systems.

quant-ph↗
arXiv2026

Efficient computation of real-time correlators using Pauli Propagation

Pauli propagation has shown promise for classically simulating quantum dynamics by evolving observables directly in the Heisenberg picture. In this work, we investigate its use for computing real-time two-point time-ordered correlators in one- and two-dimensional quantum systems. One major limitation of Pauli propagation is the rapid growth in the number of Pauli strings beyond short times. We overcome this limitation by combining accurate short-time Pauli-propagation data with time extension methods based on a positivity condition and the observation that the dynamics are often dominated by a small number of characteristic frequencies. This combined approach extends correlation functions far beyond the directly accessible time window while avoiding the exponential proliferation of Pauli operators. We demonstrate that the resulting correlators retain the relevant dynamical and spectral information. Our results broaden the regime in which classical methods can reliably probe the real-time dynamics of interacting quantum many-body systems.

quant-ph↗
arXiv2026

Fast Scrambling in the Hyperbolic Ising Model

We investigate many-body chaos and scrambling in the Hyperbolic Ising model, a mixed-field Ising model living in the background of AdS2. The effect of the curvature is captured by site-dependent couplings obtained from the AdS2 metric applied to a flat nearest-neighbor spin chain. Using a combination of out-of-time-ordered correlators (OTOCs), Krylov complexity, and spectral statistics, we present consistent evidence that this model exhibits faster scrambling behavior relative to its flat counterpart. In particular, we observe signatures consistent with fast scrambling dynamics emerging from purely local interactions. At the system sizes accessible to tensor network simulations, the OTOCs display short-lived exponential growth regimes, from which we extract effective Lyapunov exponents. These effective finite-size exponents exhibit a temperature dependence broadly compatible with the Maldacena-Shenker-Stanford (MSS) bound within numerical uncertainty. Our results indicate that increasing spatial curvature can significantly decrease scrambling time in systems with only nearest-neighbor interactions, providing a minimal and computationally accessible platform for studying quantum chaos. This makes the model a promising test-bed for exploring scrambling and operator growth in near-term quantum simulation architectures.

quant-ph↗
arXiv2026

Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE

The ground state of random Hamiltonians with all-to-all interactions such as the quantum Sherrington-Kirkpatrick (SK) model and the Sachdev-Ye-Kitaev (SYK) model follow volume-law entanglement and are expected to be hard to model using tensor networks. In recent years, some progress has been made to push the limit of classical methods using neural quantum states. However, it remains an open question whether there exist quantum algorithms that could offer a quantum advantage over the state-of-the-art classical methods in simulating random Hamiltonians. In this work, we show that one such algorithm, TETRIS-ADAPT-VQE, can construct accurate ground states for dense and sparse SYK models containing up to $N=20$ Majorana fermions achieving fidelities $\geq 99.3\%$ and for the quantum SK model with up to $L=18$ sites achieving fidelities $\geq 99.9998\%$. We find that while the preparation of ground states is efficient (in terms of operator pool size and circuit depth) for the SK model, it is not efficient for either dense or moderately sparse SYK models.

quant-ph↗
arXiv2026

Magic and entanglement in 1+1-dimensional SU(2) lattice gauge theory

Entanglement and non-stabilizerness (magic) quantify two distinct departures of quantum systems from classical description: the former measures non-local correlations, while the latter measures the deviation from stabilizer states that can be efficiently simulated classically. Understanding magic in physically relevant quantum field theories is essential for identifying where quantum advantage may be realized in the early fault-tolerant quantum computing era. We calculate the gauge-invariant entanglement entropy and stabilizer Rényi entropy of the ground state of the (1+1)-dimensional SU(2) lattice gauge theory formulated in a dressed-site basis that enforces Gauss's law exactly. Using tensor networks, we obtain results for system sizes up to $L=100$ (300 qubits). We find a crossover denoted by $g_{\star}$ where the ground state passes from a more magic-rich regime into a regime with less magic; this is also tracked by the sharpest change of both the entanglement entropy and lattice particle density. Our large-scale study of non-stabilizerness and entanglement entropy in a non-Abelian lattice gauge theory with matter provides new insight into the interplay of magic and entanglement in gauge theories, both of which are relevant for classical and early fault-tolerant quantum simulations.

quant-ph↗
arXiv2026

Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$ in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large $N_f$ and $L$. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$ using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.

quant-ph↗
arXiv2026

Quantum Ising Model on $(2+1)-$Dimensional Anti$-$de Sitter Space using Tensor Networks

We study the quantum Ising model on (2+1)-dimensional anti-de Sitter space using Matrix Product States (MPS) and Matrix Product Operators (MPOs). We explore the bulk phase diagram of the theory on regular tessellations of hyperbolic space with coordination number seven and find disordered and ordered phases separated by a phase transition. We find that the boundary-boundary spin correlation function exhibits power law scaling deep in the disordered phase of the Ising model consistent with holography. At the critical point, we find the boundary entanglement entropy scales logarithmically with subsystem size but away from this, we see a linear scaling. In comparison, the full system exhibits a volume law scaling, which is expected in chaotic and/or highly connected systems. We also measure Out of time Ordered Correlators (OTOCs) to explore the scrambling behavior of the theory.

hep-lat↗
arXiv2026

Information Propagation in Rydberg Arrays via Analog OTOC Calculations

Out-of-time-order correlators (OTOCs) are the main tool for probing quantum chaos and scrambling, and have become crucial probes in many areas of quantum computing. However, the measurement of OTOCs is difficult to implement on analog quantum computers due to the requirement of backward time evolution. In this paper, we develop and implement a randomized measurement protocol to compute OTOCs on Aquila by QuEra Computing. Unlike traditional methods that require backward time evolution, our approach utilizes a sequence of global randomized quenches that approximates the unitary 2-design properties necessary for extracting infinite-temperature OTOCs from statistical correlations. We demonstrate the protocol's success by explicitly observing the lightcone of information propagation in 1D Rydberg chains, and compare hardware results to both state-vector simulations and matrix product state (MPS) tensor network calculations. This work establishes the first demonstration of fully analog randomized OTOC measurements in neutral-atom simulators, providing a scalable pathway to probe quantum chaos in complex many-body systems.

quant-ph↗
arXiv2026

Hybrid Analog-Digital Simulation of the Abelian Higgs model

To investigate gauge theories with near-term quantum computers warrants exploration of nontraditional quantum simulators to find resource-efficient simulation protocols and ultimately access exotic features of different field theories, including unexplored regimes of the QCD phase diagram. In this work, using superconducting transmon qutrit processors, we formulate and implement a pulse-based, three-level, hybrid analog-digital simulation protocol of the (1+1) dimensional Abelian Higgs model (AHM) on two sites. Alongside this approach, we experimentally realize a gate-based implementation of the same model. Using the natural mapping of the three-level truncation of the transmon Hilbert space to the spin-1 truncated AHM, we observe real time dynamics of AHM field observables, which are analogous to electric field operators, with both protocols. For the analog-digital protocol, we engineer a Floquet simulation with a combination of local analog drives, driven modification of the natural interaction Hamiltonian of the two transmons, and dynamical decoupling pulses. For the digital protocol, we use a state-of-the-art qutrit processor to implement a Trotterized simulation of the model incorporating advanced error mitigation techniques. We further discuss the scalability of the two approaches, and their potential to be extended to the simulation of other model Hamiltonians. Our experiments demonstrate a viable platform for future studies of spin-1 and SU(3) based gauge theory models on current and near-term transmon qutrit processors.

quant-ph↗
arXiv2026

JIMWLK on a quantum computer

We propose a method for solving the Jalilian-Marian-Iancu-McLerran-Weigert-Leonidov-Kovner (JIMWLK) evolution equation on quantum computers. Our approach exploits the reformulation of the JIMWLK equation as a Lindblad master equation governing the rapidity evolution of the hadronic density matrix, as established in prior work. To render the problem tractable for quantum simulation, we introduce several approximations: the two-dimensional transverse plane is reduced to a one-dimensional radial lattice by assuming azimuthal symmetry of the jump operators; the gauge group is restricted to $\mathrm{SU}(2)$; and the infinite Wilson lines of the JIMWLK equation are replaced by finite Wilson links along the light-cone direction. The resulting bosonic Hilbert space is truncated using the electric field basis familiar from Hamiltonian lattice gauge theory, with states restricted to angular momenta $j\leq j_{\mathrm{max}}$. We derive the matrix elements of the JIMWLK Lindblad jump operators in this basis. As a benchmark, we demonstrate rapid convergence of the fundamental dipole expectation value with $j_{\mathrm{max}}$ for both pure and mixed Gaussian initial density matrices. For the simplest truncation, $j_{\mathrm{max}} = 1/2$, we implement the Lindblad evolution using a quantum simulation algorithm verified with the Qiskit statevector simulator by decomposing the non-unitary evolution operator into a linear combination of unitaries. This work establishes a concrete pathway toward quantum simulation of high-energy QCD evolution equations, with direct relevance to the physics program of the Electron-Ion Collider.

hep-ph↗
arXiv2025

Intermediate band analysis in Green's functions calculations of quasiparticle interference

The measurement of quasiparticle scattering patterns on material surfaces using scanning tunneling microscopy (STM) is now an established technique for accessing the momentum-resolved electronic band structure of solids. However, since these quasiparticle interference (QPI) patterns reflect spatial variations related to differences in the band momenta rather than the momenta themselves, their interpretation often relies on comparisons with simple geometrical models such as the joint density of states (JDOS) or with the convolution of Green's functions. In this paper, we highlight non-intuitive differences between Green's function and JDOS results. To understand the origin of these discrepancies, we analyze the convolution of Green's functions using the Feynman parametrization technique and introduce a framework that we call the intermediate band analysis. This approach allows us to derive simple selection rules for interband QPI, based on electron group velocities. Connecting the intermediate band analysis with the experiment, we consider experimental Bogoliubov QPI patterns measured for FeSe1-xSx, which were recently used to demonstrate a highly anisotropic superconducting gap, indicating superconductivity mediated by nematic fluctuations [1]. The calculated Green's functions convolutions reproduce the particle-hole asymmetry in the intensity of QPI patterns across the Fermi level observed in experiments. Finally, we demonstrate the utility of intermediate band analysis in tracing the origin of this asymmetry to a coherence factor effect of the superconducting state.

cond-mat.str-el↗
arXiv2024

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

We provide a classification of all dynamical Lie algebras generated by 2-local spin interactions on undirected graphs. Building on our previous work where we provided such a classification for spin chains, here we consider the more general case of undirected graphs. As it turns out, the one-dimensional case is special; for any other graph, the dynamical Lie algebra solely depends on whether the graph is bipartite or not. An important consequence of this result is that the cases where the dynamical Lie algebra is polynomial in size are special and restricted to one dimension.

quant-ph↗
arXiv2024

A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits

Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit's generators.

quant-ph↗
arXiv2024

Denoising of Imaginary Time Response Functions with Hankel projections

Imaginary-time response functions of finite-temperature quantum systems are often obtained with methods that exhibit stochastic or systematic errors. Reducing these errors comes at a large computational cost -- in quantum Monte Carlo simulations, the reduction of noise by a factor of two incurs a simulation cost of a factor of four. In this paper, we relate certain imaginary-time response functions to an inner product on the space of linear operators on Fock space. We then show that data with noise typically does not respect the positive definiteness of its associated Gramian. The Gramian has the structure of a Hankel matrix. As a method for denoising noisy data, we introduce an alternating projection algorithm that finds the closest positive definite Hankel matrix consistent with noisy data. We test our methodology at the example of fermion Green's functions for continuous-time quantum Monte Carlo data and show remarkable improvements of the error, reducing noise by a factor of up to 20 in practical examples. We argue that Hankel projections should be used whenever finite-temperature imaginary-time data of response functions with errors is analyzed, be it in the context of quantum Monte Carlo, quantum computing, or in approximate semianalytic methodologies.

cond-mat.str-el↗
arXiv2024

Quantifying fault tolerant simulation of strongly correlated systems using the Fermi-Hubbard model

Understanding the physics of strongly correlated materials is one of the grand challenge problems for physics today. A large class of scientifically interesting materials, from high-$T_c$ superconductors to spin liquids, involve medium to strong correlations, and building a holistic understanding of these materials is critical. Doing so is hindered by the competition between the kinetic energy and Coulomb repulsion, which renders both analytic and numerical methods unsatisfactory for describing interacting materials. Fault-tolerant quantum computers have been proposed as a path forward to overcome these difficulties, but this potential capability has not yet been fully assessed. Here, using the multi-orbital Fermi-Hubbard model as a representative model and a source of scalable problem specifications, we estimate the resource costs needed to use fault-tolerant quantum computers for obtaining experimentally relevant quantities such as correlation function estimation. We find that advances in quantum algorithms and hardware will be needed in order to reduce quantum resources and feasibly address utility-scale problem instances.

quant-ph↗
arXiv2024

Geometric Quantum Machine Learning with Horizontal Quantum Gates

In the current framework of Geometric Quantum Machine Learning, the canonical method for constructing a variational ansatz that respects the symmetry of some group action is by forcing the circuit to be equivariant, i.e., to commute with the action of the group. This can, however, be an overzealous constraint that greatly limits the expressivity of the circuit, especially in the case of continuous symmetries. We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits, based on homogeneous spaces, relaxing the overly stringent requirement of equivariance. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions orthogonal to those of the symmetry. We show that horizontal quantum gates are much more expressive than equivariant gates, and thus can solve problems that equivariant circuits cannot. For instance, a circuit comprised of horizontal gates can find the ground state of an $\mathrm{SU}(2)$-symmetric model where the ground state spin sector is unknown--a task where equivariant circuits fall short. Moreover, for a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem. Finally, we highlight a particular class of horizontal quantum gates that behave similarly to general $\mathrm{SU}(4)$ gates, while achieving a quadratic reduction in the number of parameters for a generic problem.

quant-ph↗
arXiv2024

Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers

We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. These problems are solved using IBM quantum computers, showing no signs of decreasing fidelity at long times. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware. Our two examples show promise that the driven-dissipative quantum many-body problem can eventually be solved on quantum computers.

quant-ph↗
arXiv2024

Denoising and Extension of Response Functions in the Time Domain

Response functions of quantum systems, such as electron Green's functions, magnetic, or charge susceptibilities, describe the response of a system to an external perturbation. They are the central objects of interest in field theories and quantum computing and measured directly in experiment. Response functions are intrinsically causal. In equilibrium and steady-state systems, they correspond to a positive spectral function in the frequency domain. Since response functions define an inner product on a Hilbert space and thereby induce a positive definite function, the properties of this function can be used to reduce noise in measured data and, in equilibrium and steady state, to construct positive definite extensions for data known on finite time intervals, which are then guaranteed to correspond to positive spectra.

quant-ph↗