Searcharxiv⌕ Search

arXiv subjects

Zhiyan Ding

Publications and source records attributed to Zhiyan Ding.

At least 19 recordsLinked to original sources

Efficient thermalization of one-dimensional noncommuting Hamiltonians via system-bath interactions with $Θ(n)$ ancilla qubits

We prove rapid convergence of a system-bath interaction algorithm for preparing Gibbs states of one-dimensional noncommuting Hamiltonians at every fixed positive temperature. For a chain of $n$ qudits of local dimension $2^q$ with bounded nearest-neighbor interactions, the algorithm prepares the Gibbs state from any initial state to trace-norm error $0<\varepsilon\le1/2$ in expected total Hamiltonian evolution time $\widetilde{O}(n/\varepsilon)$. This improves the previously proved $\widetilde{O}(n^6/\varepsilon)$ bound for single-ancilla system-bath Gibbs samplers, up to logarithmic factors. The proposed algorithm couples $4^q-1$ resettable bath qubits to each site in parallel and randomizes the interaction time. Our analysis bounds both the one-round approximation error and the stationarity defect of an approximate stationary state in Gibbs-weighted $L^2$ norms, with only linear dependence on the system size. It also uses the dephasing induced by randomized evolution to control the extensive Lamb shift without treating it as a small perturbation of the dissipative dynamics.

quant-ph↗

Sublinear thermal state and ground state preparation for free fermions via system-bath interaction

Dissipative algorithms for preparing thermal and ground states typically require a total Hamiltonian simulation time that grows at least linearly with system size $N$, even when their mixing time grows only polylogarithmically. We achieve sublinear simulation time for free fermions by engineering local interactions with a bath whose size grows in proportion to the system size. Starting from arbitrary initial states, our thermal state preparation algorithm achieves trace-norm error $ε$ in total simulation time $\widetilde{O}(\sqrt{N}/ε)$ at fixed inverse temperature and bounded single-particle bandwidth, while ground state preparation of gapped systems requires only $\mathrm{polylog}(N/ε)$ time. We further establish lower bounds for thermal state preparation within the bath protocols considered, identifying two obstacles to faster preparation, namely fourth-order deviations from the target thermal state and fluctuations induced by a random frequency shared by all bath qubits. Our results demonstrate that the linear simulation time barrier in dissipative state preparation can be overcome and clarify the bath and filter-design constraints that govern further complexity improvements.

quant-ph↗

Quantum Spectral Estimation with Multiple Initial States: Improved Error and Cost Scaling

We study quantum spectrum and eigenstate property estimation using multiple initial states and generalized Hadamard tests. Building on the QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra) framework, we introduce a new method that samples evolution times independently for each initial-state pair. Under the stated assumptions, when statistical error determines the sampling cost, the total Hamiltonian simulation cost required for fixed-accuracy eigenvalue and observable estimation is independent of the number of initial states, up to logarithmic factors. This improves scalability when many initial states are needed to explore the target eigenspaces. The method also reduces the cost of multiplicity recovery and retains Heisenberg-limited scaling for eigenvalue estimation. Numerical experiments support the predicted statistical error scalings.

quant-ph↗

Size-independent Logarithmic Sobolev Inequalities for Quantum Gibbs Samplers

We propose a new method for proving $L^2$ and modified logarithmic Sobolev inequalities with constants independent of system size for quantum Gibbs samplers whose Lindblad generators satisfy Kubo-Martin-Schwinger (KMS) detailed balance. We first establish the $L^2$ logarithmic Sobolev inequality by transporting it along a temperature-dependent path from the infinite-temperature product state to the target Gibbs state while maintaining a size-independent decay rate for the sandwiched Rényi-2 divergence. A tensor-power argument, combined with the quantum asymptotic equipartition property, then transfers this decay bound to relative entropy, yielding the modified logarithmic Sobolev inequality. This approach provides a general framework for proving size-independent logarithmic Sobolev inequalities for quantum Gibbs samplers. We apply it to two regimes: one-dimensional quantum spin chains at every finite temperature, and finite-range quantum spin systems at sufficiently high temperature in any fixed dimension.

quant-ph↗

Spectral Analysis Beyond the Spectral Gap: Rapid Mixing of Quantum Gibbs Samplers in One Dimension

We prove rapid mixing of a quantum Gibbs sampler for general one-dimensional non-commuting local spin systems at every fixed positive temperature. In particular, for a system of $n$ sites, we show that the Kubo--Martin--Schwinger (KMS) detailed-balanced Gibbs sampler of~\cite{CKG2023} converges from any initial state to trace-norm error $ε$ in time $O(\log^4(n)+\log(1/ε))$. This improves the previous $O(n+\log(1/ε))$ bound and establishes rapid mixing beyond high-temperature and weak-interaction regimes. Our proof explains why the slowest decay rate, captured by the spectral gap, can substantially underestimate the speed of equilibration. The key insight is that a state far from equilibrium must have a substantial component outside the span of low-weight Pauli operators, where stronger dissipation estimates apply. This yields two stages of relaxation: a double-exponential convergence from a bad initial state, followed by exponential convergence near equilibrium. We turn this mechanism into a framework for proving rapid mixing through spectral analysis beyond the gap. Our decay estimate is equivalent to exponential convergence in sandwiched Rényi-2 divergence. Together with the spectral gap, it also implies a modified logarithmic Sobolev inequality with rate $Ω(\log^{-4}(n))$.

quant-ph↗

Kinetic Mean-Field Planning via Schrödinger Bridges: Existence, Penalization, and Consistency Bounds

We study a mean-field planning problem for a swarm of interacting, non-cooperative agents whose dynamics are stochastic and kinetic. The noise acts on the velocity only, and the interaction (of Cucker-Smale type for instance) enters through the drift. For a fixed flow, the problem reduces to a Schrödinger bridge problem, and we first prove the existence of an equilibrium by a Schauder fixed-point argument. Then we replace the hard terminal constraint by a penalty function and show that equilibria of the penalized problems converge, along subsequences, to an equilibrium of the original problem. Since equilibria are not unique in general, we instead quantify the consistency error, which measures how far an equilibrium of the penalized problem is from being an equilibrium of the original one. The rate is of order $n^{-1/2}$ for the relative-entropy penalty. The proof relies on the quantitative stability of entropic optimal transport and on a pointwise linear growth bound on the score of the degenerate reference dynamics, which is of independent interest.

math.PR↗

Quantum Replica Exchange

The presence of energy barriers in the state space of a physical system can lead to exponentially slow convergence for sampling algorithms like Markov chain Monte Carlo (MCMC). In the classical setting, replica exchange (or parallel tempering) is a powerful heuristic to accelerate mixing in these scenarios. In the quantum realm, preparing Gibbs states of Hamiltonians faces a similar challenge, where bottlenecks can dramatically increase the mixing time of quantum dynamical semigroups. In this work, we introduce a quantum analogue of the replica exchange method. We define a Lindbladian on a joint system of two replicas and prove that it can accelerate mixing for a class of Hamiltonians with local energy barriers. We provide a rigorous lower bound on the spectral gap of the combined system's Lindbladian, which leads to an exponential improvement in spectral gap with respect to the barrier height. We showcase the applicability of our method with several proof-of-concept examples that satisfy a commuting-cut assumption, including the defected 1D Ising model at arbitrary constant temperature, and defected non-commuting local Hamiltonians at high temperature.

quant-ph↗

Beyond Lindblad Approximation: Rigorous Guarantees for Thermal and Ground State Preservation under System-Bath Interactions

We establish rigorous guarantees for quantum thermal and ground state preparation via system-bath interactions beyond the Lindblad approximation regime. In contrast to existing analyses, we show that the system-bath coupling strength need not vanish with the target accuracy: even when the coupling strength is chosen independently of the desired precision, the induced quantum channel admits the target thermal and ground states as approximate fixed points with arbitrarily small error. Our analysis develops new techniques to control all orders of the Dyson expansion and the associated multidimensional operator Fourier transforms, thereby going beyond the leading-order Lindbladian description. Building on these estimates, we derive an improved end-to-end complexity analysis and provide rigorous guarantees for thermalization and cooling outside the conventional Lindblad approximation regime. Numerical simulations further demonstrate the robustness of the system-bath interaction framework over a broad range of coupling strengths, including regimes where the Lindblad approximation is no longer accurate.

quant-ph↗

Simple and efficient end-to-end quantum thermal and ground state preparation

Quantum computing algorithms for many-body physics, chemistry and materials science typically require the preparation of thermal or ground states for a given Hamiltonian. We propose quantum algorithms based on system-bath interactions to prepare thermal and ground states for a range of physically relevant Hamiltonians. These algorithms require only forward evolution under a system-bath Hamiltonian in which the bath is a single reusable ancilla qubit, making them especially well-suited for early fault-tolerant quantum devices. By carefully designing the bath and interaction Hamiltonians, we prove that the fixed point of the dynamics accurately approximates the desired quantum state. Furthermore, we establish theoretical guarantees on the mixing time, and thereby provide a rigorous justification for the end-to-end efficiency of system-bath interaction models in thermal and ground state preparation for the physically relevant models we consider.

quant-ph↗

Quantitative homogenization of convex Hamilton-Jacobi equations in the Wasserstein space

We study a homogenization problem for first-order Hamilton-Jacobi equations in the Wasserstein space with a convex Hamiltonian. We show that the solution $U^\varepsilon$, which is the value function of a mean field control problem, converges uniformly as $\varepsilon \to 0$ to the solution of a limiting Hamilton-Jacobi equation whose Hamiltonian is obtained through a suitable cell problem. Furthermore, we establish quantitative rates of convergence. Under general assumptions with multiscale dependence, we prove that the rate of convergence is $O(\sqrt{\varepsilon})$. When the Hamiltonian depends only on the fast variable and the momentum, we establish the sharp convergence rate $O(\varepsilon)$. To the best of our knowledge, this is the first quantitative convergence result extending the optimal rate for first-order Hamilton-Jacobi equations in finite dimensions to the Wasserstein space. Finally, we show that our analysis extends to dynamic optimal transport problems, where the terminal condition imposes a constraint on the final distribution.

math.AP↗

Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization

We develop a pivot-shifted Carleman linearization framework for quantum algorithms solving quadratic nonlinear ordinary differential equations. By shifting the dynamics by a pivot state prior to Carleman lifting, and combining this with a Lyapunov transform and rescaling, we enlarge the class of nonlinear systems that can be efficiently simulated on quantum computers. For systems that exhibit stability in the shifted coordinates, we establish long time convergence of the truncated Carleman embedding. We prove that the truncation order scales only logarithmically with the simulation time and target precision, and we derive end-to-end quantum query complexity bounds for preparing a state proportional to the final solution. By introducing a modified nonlinearity condition, this framework entirely removes the conventional lower bound requirement on the initial condition. For more general systems that remain unstable after shifting, we provide short time convergence guarantees that are similarly free from the initial condition constraints. Numerical experiments on the logistic and the Lotka-Volterra equations demonstrate that an appropriate pivot choice improves stability and accuracy, and yields exponential error decay with truncation order. These results show that pivot shifting provides a practical and theoretically justified route for extending Carleman-based quantum algorithms to a broader class of nonlinear dynamical systems.

quant-ph↗

Overcoming the Lamb Shift in System-Bath Interaction Models via KMS Detailed Balance: High-Accuracy Thermalization with Time-Bounded Interactions

We investigate quantum thermal state preparation algorithms based on system-bath interactions and uncover a surprising phenomenon in the weak-coupling regime. We rigorously prove that, if the system-bath interaction is engineered so that the transition part of the approximate Lindbladian generator satisfies the Kubo--Martin--Schwinger (KMS) detailed balance condition, then the unique fixed point of the dynamics can be made arbitrarily close to the Gibbs state in the weak-coupling limit, regardless of the structure of the Lamb shift term. Importantly, this remains true even when the approximate Lindbladian differs substantially from the ideal Davies generator and the Lamb shift term does not commute with the thermal state. Our result shows that the role of the KMS detailed balance condition extends well beyond standard Lindbladian dynamics, serving as a general principle for a broader class of dissipative systems. Furthermore, by combining this with a general perturbation framework, we bound the mixing time of the dynamics and establish an end-to-end complexity of $\mathcal{O}(\varepsilon^{-1})$ for Gibbs state preparation. These guarantees apply to any Hamiltonian whose associated KMS-detailed-balance Lindbladian is known to be fast mixing.

quant-ph↗

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra

Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is $\#\textsf{BQP}$-complete in the worst case. In this work, we introduce QFAMES (Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.

quant-ph↗

Provably Efficient Long-Time Exponential Decompositions of Non-Markovian Gaussian Baths

Gaussian baths are widely used to model non-Markovian environments, yet the cost of accurate simulation at long times remains poorly understood, especially when spectral densities exhibit nonanalytic behavior as in a range of realistic models. We rigorously bound the complexity of representing bath correlation functions on a time interval $[0,T]$ by sums of complex exponentials, as employed in recent variants of pseudomode and hierarchical equations of motion methods. These bounds make explicit the dependence on the maximal simulation time $T$, inverse temperature $β$, and the type and strength of singularities in an effective spectral density. For a broad class of spectral densities, the required number of exponentials is bounded independently of $T$, achieving time-uniform complexity. The $T$-dependence emerges only as polylogarithmic factors for spectral densities with strong singularities, such as step discontinuities and inverse power-law divergences. The temperature dependence is mild for bosonic environments and disappears entirely for fermionic environments. Thus, the true bottleneck for long-time simulation is not the simulation duration itself, but rather the presence of sharp nonanalytic features in the bath spectrum. Our results are instructive both for long-time simulation of non-Markovian open quantum systems, as well as for Markovian embeddings of classical generalized Langevin equations with memory kernels.

quant-ph↗

Rapid quantum ground state preparation via dissipative dynamics

Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.

quant-ph↗

Uniform-in-time propagation of chaos for consensus-based minimax algorithm

We study the large-population convergence of a consensus-based algorithm for the saddle point problem proposed by ArXiv: 2212.12334, establishing the uniform-in-time propagation of chaos using a coupling method. Our work shows that the $L^2$-deviation has order $O(N_1^{-1} + N_2^{-1})$ uniformly in time, where $N_1$ and $N_2$ denote the numbers of particles corresponding to the two competing players. It demonstrates the convergence of the particles to some location near a saddle point of the given objective function, which confirms the computational feasibility of the algorithm. The main idea behind the proofs is the exponential decay and the concentration of the variances of the particle system.

math.PR↗

Operator-Level Quantum Acceleration of Non-Logconcave Sampling

Sampling from probability distributions of the form $σ\propto e^{-βV}$, where $V$ is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However, when $V$ is non-convex, the resulting distribution becomes non-logconcave, and classical methods such as Langevin dynamics often exhibit poor performance. We introduce the first quantum algorithm that provably accelerates a broad class of continuous-time sampling dynamics. For Langevin dynamics, our method encodes the target Gibbs measure into the amplitudes of a quantum state, identified as the kernel of a block matrix derived from a factorization of the Witten Laplacian operator. This connection enables Gibbs sampling via singular value thresholding and yields up to a quartic quantum speedup over best-known classical Langevin-based methods in the non-logconcave setting. Building on this framework, we further develop the first quantum algorithm that accelerates replica exchange Langevin diffusion, a widely used method for sampling from complex, rugged energy landscapes.

quant-ph↗

Polynomial-Time Preparation of Low-Temperature Gibbs States for 2D Toric Code

We propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial condition, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. Our approach combines the Lindblad dynamics using a local Davies generator with simple global jump operators to enable efficient transitions between logical sectors. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state towards the ground state manifold.

quant-ph↗