arXiv subjects

Stefan Kühn

Publications and source records attributed to Stefan Kühn.

At least 19 recordsLinked to original sources

arXiv2026

Non-Abelian string melting and thermalization in an open lattice gauge theory

Open-system lattice gauge theory (LGT) has so far been developed predominantly in Abelian settings, leaving open how genuinely non-Abelian gauge structure reshapes dissipative real-time dynamics. Here, we study a $1+1$D SU(2) Yang--Mills LGT with dynamical matter coupled to a thermal scalar environment through a gauge-preserving Lindblad evolution, which we solve using tensor networks. Starting from a quark--antiquark pair connected by a chromoelectric flux string, we find that the thermal medium melts the string by delocalizing the color charges and screening the flux; on resonance, this dissipative melting competes with and delays coherent string breaking. The thermalization time is non-monotonic in the environment coupling, decreasing through environment-assisted transport at weak dissipation before increasing in a quantum-Zeno regime. In the strong-dephasing limit, a Schrieffer--Wolff expansion maps the dynamics to a classical exclusion process and yields the Liouvillian thermalization time analytically. Beyond these generic open-system effects, the non-Abelian matter structure produces a systematic mesonic bias in the steady state, while the thermalization time decreases with temperature, in contrast to the Abelian Schwinger model trend and in qualitative agreement with pNRQCD studies of the quark--gluon plasma. These results establish a gauge-preserving framework for thermalization and string dynamics in open non-Abelian lattice gauge theories.

hep-lat↗

arXiv2026

Prior-Informed Adaptive Shifts for Sequential Minimal Optimization in Variational Quantum Eigensolvers

Sequential minimal optimization methods, such as the Rotosolve and the Nakanishi-Fujii-Todo algorithm (NFT), are widely used for Variational Quantum Eigensolvers (VQEs). These methods optimize one parameter direction at a time, requiring measurements at only a few locations along that direction. In the presence of measurement shot noise, however, their performance depends critically on the choice of measurement locations, and recent studies suggest that equidistant measurements are optimal. However, we often observe that equidistant measurements are not always optimal in practice. We argue that this discrepancy between theory and practice arises from the fact that two assumptions underlying previous analyses do not generally hold: (1) the absence of prior knowledge about the energy minimizer, and (2) the use of the uncertainty of the estimated energy as a proxy for optimization performance. In this paper, we develop a new theory for determining optimal measurement locations. First, we show that incorporating prior information about the minimizer is beneficial. Early in optimization, when little is known about the pivot, i.e., the current minimizer, equidistant measurements are indeed near-optimal, but as the prior belief sharpens the optimal locations move away from equidistant. Second, rather than analyzing the uncertainty of the estimated minimum energy, we study the uncertainty of the estimator of the minimizer itself, which leads to substantially different strategies. Based on this analysis, we propose Prior-informed Adaptive Shifts (PAS), a method that automatically adjusts measurement locations during optimization. Numerical experiments across different shot counts and problems validate our theoretical findings and demonstrate that PAS adaptively recovers whichever fixed shift is best in each regime without it being specified in advance.

quant-ph↗

arXiv2026

Imaginarity as a necessary resource for trainability in QAOA

The quantum approximate optimization algorithm (QAOA) tackles combinatorial problems by tuning a quantum circuit in a classical loop, often guided by gradients. We show that the gradient used to tune the circuit's final parameter is bounded by imaginarity, which weights phase relationships between candidate solutions by how strongly the circuit connects them and how differently the problem scores them. Imaginarity is necessary but not sufficient for a nonzero gradient. We extend the bound to three common noise models and compare it numerically with the gradient in Max-Cut simulations.

quant-ph↗

arXiv2026

Barren-plateau free variational quantum simulation of Z2 lattice gauge theories

In this work, we design a variational quantum eigensolver (VQE) suitable for investigating ground states and static string breaking in a $\mathbb{Z}_2$ lattice gauge theory (LGT). We consider a two-leg ladder lattice coupled to Kogut-Susskind staggered fermions and verify the results of the VQE simulations using tensor network methods. We find that for varying Hamiltonian parameter regimes and in the presence of external charges, the VQE is able to arrive at the gauge-invariant ground state without explicitly enforcing gauge invariance through penalty terms. Additionally, experiments showing string breaking are performed on IBM's quantum platform. Thus, VQEs are seen to be a promising tool for $\mathbb{Z}_2$ LGTs, and could pave the way for studies of other gauge groups. We find that the scaling of gradients with the number of qubits is favorable for avoiding barren plateaus. At the same time, it is not clear how to efficiently simulate the LGT using classical methods. Furthermore, strategies that avoid barren plateaus arise naturally as features of LGTs, such as choosing the initialization by setting the Gauss law sector and restricting the Hilbert space to the gauge-invariant subspace.

quant-ph↗

arXiv2026

Bias Analysis and Regularization of Sequential Minimal Optimization in Variational Quantum Eigensolvers

The Nakanishi Fujii Todo (NFT) algorithm, also known as Rotosolve, implements Sequential Minimal Optimization for Variational Quantum Eigensolvers (SMO-VQE) by exploiting the trigonometric dependence of the energy on individual circuit parameters. This enables analytical one-dimensional minimization using only a few , typically two, energy evaluations, but introduces bias in the estimated energy. Although performing additional measurements every few tens of iterations can mitigate bias accumulation, we find that such corrections often degrade optimization performance. In this paper, we analyze the origin and accumulation of bias during the SMO-VQE process. Specifically, we show that the bias can be accurately estimated without additional measurements. Furthermore, we find that bias correction destabilizes optimization along directions with small curvature, whereas the original biased estimator implicitly acts as a regularizer. Based on these insights, we propose a simple regularization method that implements error accumulation while maintaining unbiased energy estimation. The resulting algorithm consistently improves performance across different system sizes, circuit depths, target Hamiltonians, and measurement shots, with minimal hyperparameter tuning.

quant-ph↗

arXiv2025

Warm Start of Variational Quantum Algorithms for Quadratic Unconstrained Binary Optimization Problems

Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random parameter initialization. In this work, we propose a warm start method inspired by imaginary time evolution, allowing for determining initial parameters that prioritize lower energy states in a resource-efficient way. Using classical simulations, we demonstrate that this warm start method significantly improves the success rate and reduces the number of iterations required for the convergence of VQE. The numerical results also indicate that the warm start approach effectively mitigates statistical errors arising from a finite number of measurements, and to a certain extent alleviates the effect of barren plateaus.

quant-ph↗

arXiv2025

Computing quantum entanglement with machine learning

Entanglement calculations in quantum field theories are extremely challenging and typically rely on the replica trick, where the problem is rephrased in a study of defects. We demonstrate that the use of deep generative models drastically outperforms standard Monte Carlo algorithms. Remarkably, such a machine-learning method enables high-precision estimates of Rényi entropies in three dimensions for very large lattices. Moreover, we propose a new paradigm for studying lattice defects with flow-based sampling.

hep-lat↗

arXiv2025

Fermion Discretization Effects in the Two-Flavor Lattice Schwinger Model: A Study with Matrix Product States

We present a comprehensive tensor network study of staggered, Wilson, and twisted mass fermions in the Hamiltonian formulation, using the massive two-flavor Schwinger model as a benchmark. Particular emphasis is placed on twisted mass fermions, whose properties in this context have not been systematically explored before. We confirm the expected O(a) improvement in the free theory and observe that this improvement persists in the interacting case. By leveraging an electric-field-based method for mass renormalization, we reliably tune to maximal twist and establish the method's applicability in the two-flavor model. Once mass renormalization is included, the pion mass exhibits rapid convergence to the continuum limit. Finite-volume effects are addressed using two complementary approaches: dispersion relation fits and finite-volume scaling. Our results show excellent agreement with semiclassical predictions and reveal a milder volume dependence for twisted mass fermions compared to staggered and Wilson discretizations. In addition, we observe clear isospin-breaking effects, suggesting intriguing parallels with lattice QCD. These findings highlight the advantages of twisted mass fermions for Hamiltonian simulations and motivate their further exploration, particularly in view of future applications to higher-dimensional lattice gauge theories.

hep-lat↗

arXiv2025

Resource-Efficient Simulations of Particle Scattering on a Digital Quantum Computer

We develop and demonstrate methods for simulating the scattering of particle wave packets in the interacting Thirring model on digital quantum computers, with hardware implementations on up to 80 qubits. We identify low-entanglement time slices of the scattering dynamics and exploit their efficient representation by tensor networks. Circuit compression based on matrix product state techniques yields on average a reduction by a factor of 3.2 in circuit depth compared to conventional approaches, allowing longer evolution times to be evaluated with higher fidelity on contemporary quantum processors. Utilizing zero-noise extrapolation in combination with Pauli twirling, on quantum hardware we accurately simulate the full scattering dynamics on 40 qubits, and further demonstrate the wave packet state-preparation on 80 qubits.

quant-ph↗

arXiv2025

Scalable Quantum Algorithm for Meson Scattering in a Lattice Gauge Theory

Scattering processes are fundamental for understanding the structure of matter, yet simulating their real-time dynamics remains challenging for classical computers. Quantum computing and quantum-inspired methods offer a promising avenue for efficiently simulating such phenomena. In this work, we investigate meson scattering in a (1+1)-dimensional Z2 lattice gauge theory with staggered fermions. We develop a quantum subspace expansion technique to construct high-fidelity meson creation operators across a broad range of masses and momenta. Using Tensor Networks simulations, we study both elastic and inelastic scattering and provide a detailed analysis of energy transfer, entanglement entropy, and new particle production during the dynamics. In addition, we design an efficient quantum circuit for meson wave packet preparation using Givens rotations, significantly reducing the circuit depth compared to existing methods. Our work provides a non-variational and scalable framework for simulating meson scattering on near-term quantum devices, and provides a concrete strategy for quantum simulation to analyze non-perturbative dynamical processes in confining gauge theories.

quant-ph↗

arXiv2025

Hamiltonian Lattice Formulation of Compact Maxwell-Chern-Simons Theory

In this paper, a Hamiltonian lattice formulation for 2+1D compact Maxwell-Chern-Simons theory is derived. We analytically solve this theory and demonstrate that the mass gap in the continuum limit matches the well-known continuum formula. Our formulation preserves topological features such as the quantization of the Chern-Simons level, the degeneracy of energy eigenstates, the non-trivial properties of Wilson loops, and the mutual and self statistics of anyons. This work lays the groundwork for future Hamiltonian-based simulations of Maxwell-Chern-Simons theory on classical and quantum computers.

hep-th↗

arXiv2025

Meson thermalization with a hot medium in the open Schwinger model

Quantum field theories treated as open quantum systems provide a crucial framework for studying realistic experimental scenarios, such as quarkonia traversing the quark-gluon plasma produced at the Large Hadron Collider. In such cases, capturing the complex thermalization process requires a detailed understanding of how particles evolve and interact with a hot medium. Considering the open lattice Schwinger model and using tensor network algorithms, we investigate the thermalization dynamics of mesonic particles in a hot medium, such as the Schwinger boson or the electric flux string. We simulate systems with up to 100 lattice sites, achieving accurate preservation of the electric field parity symmetry, demonstrating the algorithm's robustness and scalability. Our results reveal that the thermalization time increases with stronger dissipation from the environment, increasing environment temperature, higher background electric field and heavier fermion masses. Further, we study the quantum mutual information between the two halves of the flux string connecting a meson's constituent particles and analyze its relation to relevant dynamical observables.

hep-lat↗

arXiv2025

Realizing string breaking dynamics in a $Z_2$ lattice gauge theory on quantum hardware

We investigate static and dynamical aspects of string breaking in a $Z_2$ lattice gauge theory coupled to Kogut-Susskind staggered fermions. Using Tensor Network simulations, we demonstrate that the static potential as well as the site-resolved configuration of the matter sites and gauge links allows us to identify the regimes in which string breaking occurs. Furthermore, we develop a variational quantum eigensolver that allows for reliably preparing the ground state of the theory in both the absence and presence of static charges and to capture the static aspects of the phenomenon. Carrying out state preparation on real quantum hardware for up to 19 qubits, we demonstrate its suitability for current quantum devices. In addition, we study the real-time dynamics of a flux tube between two static charges using both Tensor Networks and quantum hardware. Using a trotterization for the time-evolution operator, we are able to show that the breaking process starts with the creation of charges inside the string. These eventually redistribute towards the static charges and screen them, which leads to the breaking of the flux tube.

hep-lat↗

arXiv2025

Flow-Based Sampling for Entanglement Entropy and the Machine Learning of Defects

We introduce a novel technique to numerically calculate Rényi entanglement entropies in lattice quantum field theory using generative models. We describe how flow-based approaches can be combined with the replica trick using a custom neural-network architecture around a lattice defect connecting two replicas. Numerical tests for the $ϕ^4$ scalar field theory in two and three dimensions demonstrate that our technique outperforms state-of-the-art Monte Carlo calculations, and exhibit a promising scaling with the defect size.

quant-ph↗

arXiv2025

Multilevel Generative Samplers for Investigating Critical Phenomena

Investigating critical phenomena or phase transitions is of high interest in physics and chemistry, for which Monte Carlo (MC) simulations, a crucial tool for numerically analyzing macroscopic properties of given systems, are often hindered by an emerging divergence of correlation length -- known as scale invariance at criticality (SIC) in the renormalization group theory. SIC causes the system to behave the same at any length scale, from which many existing sampling methods suffer: long-range correlations cause critical slowing down in Markov chain Monte Carlo (MCMC), and require intractably large receptive fields for generative samplers. In this paper, we propose a Renormalization-informed Generative Critical Sampler (RiGCS) -- a novel sampler specialized for near-critical systems, where SIC is leveraged as an advantage rather than a nuisance. Specifically, RiGCS builds on MultiLevel Monte Carlo (MLMC) with Heat Bath (HB) algorithms, which perform ancestral sampling from low-resolution to high-resolution lattice configurations with site-wise-independent conditional HB sampling. Although MLMC-HB is highly efficient under exact SIC, it suffers from a low acceptance rate under slight SIC violation. Notably, SIC violation always occurs in finite-size systems, and may induce long-range and higher-order interactions in the renormalized distributions, which are not considered by independent HB samplers. RiGCS enhances MLMC-HB by replacing a part of the conditional HB sampler with generative models that capture those residual interactions and improve the sampling efficiency. Our experiments show that the effective sample size of RiGCS is a few orders of magnitude higher than state-of-the-art generative model baselines in sampling configurations for 128x128 two-dimensional Ising systems.

cs.LG↗

arXiv2025

Constrained many-body phases in a $\mathbb{Z}_2$-Higgs lattice gauge theory

We study the ground-state phase diagram of a one-dimensional $\mathbb{Z}_2$ lattice gauge theory coupled to soft-core bosonic matter at unit filling, inspired by the Higgs sector of the standard model. Through a combination of analytical perturbative approaches, exact diagonalization, and density-matrix-renormalization-group simulations, we uncover a rich phase diagram driven by gauge-field-mediated resonant pair hopping and the confinement of single particles. The pair hopping results in a bunching state with superextensive energy and macroscopic particle number fluctuations at strong electric field strengths and weak on-site interactions. The bunching state crosses over into a pair superfluid phase as the on-site interaction increases, characterized by a finite superfluid density and powerlaw-decaying pair correlations. At large on-site interaction strengths and driven by effective interactions induced by the gauge constraint, the superfluid transitions into an incompressible pair Mott insulator phase. At weak field strengths and on-site interactions, we find a plasma-like region, where single bosons exhibit large short-range correlations and the ground state is composed almost equally of states with even and odd local boson occupation. The presence of a bunching state with large number fluctuations, which is difficult to study using classical numerics, motivates experimental realizations in hybrid boson-qubit quantum simulation platforms such as circuit QED, neutral atoms, and trapped ions. Our findings highlight the rich interplay between gauge fields and soft-core bosonic matter.

cond-mat.quant-gas↗

arXiv2025

Adaptive Observation Cost Control for Variational Quantum Eigensolvers

The objective to be minimized in the variational quantum eigensolver (VQE) has a restricted form, which allows a specialized sequential minimal optimization (SMO) that requires only a few observations in each iteration. However, the SMO iteration is still costly due to the observation noise -- one observation at a point typically requires averaging over hundreds to thousands of repeated quantum measurement shots for achieving a reasonable noise level. In this paper, we propose an adaptive cost control method, named subspace in confident region (SubsCoRe), for SMO. SubsCoRe uses the Gaussian process (GP) surrogate, and requires it to have low uncertainty over the subspace being updated, so that optimization in each iteration is performed with guaranteed accuracy. The adaptive cost control is performed by first setting the required accuracy according to the progress of the optimization, and then choosing the minimum number of measurement shots and their distribution such that the required accuracy is satisfied. We demonstrate that SubsCoRe significantly improves the efficiency of SMO, and outperforms the state-of-the-art methods.

quant-ph↗

arXiv2025

Fermionic wave packet scattering: a quantum computing approach

Quantum computing provides a novel avenue towards simulating dynamical phenomena, and, in particular, scattering processes relevant for exploring the structure of matter. However, preparing and evolving particle wave packets on a quantum device is a nontrivial task. In this work, we propose a method to prepare Gaussian wave packets with momentum on top of the interacting ground state of a fermionic Hamiltonian. Using Givens rotation, we show how to efficiently obtain expectation values of observables throughout the evolution of the wave packets on digital quantum computers. We demonstrate our technique by applying it to the staggered lattice formulation of the Thirring model and studying the scattering of two wave packets. Monitoring the particle density and the entropy produced during the scattering process, we characterize the phenomenon and provide a first step towards studying more complicated collision processes on digital quantum computers. In addition, we perform a small-scale demonstration on IBM's quantum hardware, showing that our method is suitable for current and near-term quantum devices.

quant-ph↗