arXiv subjects

Yongtao Zhan

Publications and source records attributed to Yongtao Zhan.

9 recordsLinked to original sources

arXiv2026

Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions

We propose a randomized algorithm to compute the log-partition function of weakly interacting fermions with polynomial runtime in both the system size and precision. Although weakly interacting fermionic systems are considered tractable for many computational methods such as the diagrammatic quantum Monte Carlo, a mathematically rigorous proof of polynomial runtime has been lacking. In this work we first extend the proof techniques developed in previous works for proving the convergence of the cumulant expansion in periodic systems to the non-periodic case. A key equation used to analyze the sum of connected Feynman diagrams, which we call the tree-determinant expansion, reveals an underlying tree structure in the summation. This enables us to design a new randomized algorithm to compute the log-partition function through importance sampling augmented by belief propagation. This approach differs from the traditional method based on Markov chain Monte Carlo, whose efficiency is hard to guarantee, and enables us to obtain a algorithm with provable polynomial runtime.

quant-ph↗

arXiv2026

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↗

arXiv2026

Preparing thermal states of frustrated quantum spin systems using 139 qubits

Finite-temperature properties of strongly correlated quantum matter are central to condensed matter, chemistry, and high-energy physics, yet are often inaccessible to classical methods such as quantum Monte Carlo (QMC). Here, we investigate dissipative thermal state preparation of frustrated spin systems using digital quantum computers. We focus on two paradigmatic models on the kagome lattice: the antiferromagnetic Heisenberg model (AFHM), whose finite-temperature properties are inaccessible to QMC due to a severe sign problem, and the antiferromagnetic Ising model (AFIM), which serves as a sign-problem-free benchmark. Using IBM quantum processors, we prepare approximate thermal states of the AFIM on kagome lattices with up to 79 spins coupled to 60 environment qubits. We observe the emergence of a robust steady state with an adjustable effective temperature that persists in circuits with over 1000 layers of two-qubit gates. We further study the scalability of the dissipative protocol through classical statevector simulations of the AFIM and AFHM. On lattices with up to 27 sites, we find that the circuit depth to reach thermal equilibrium is independent of system size and grows at most linearly with inverse temperature. These results establish engineered dissipation as a promising approach to finite-temperature quantum simulation of frustrated matter, and point toward regimes where quantum devices may outperform classical methods.

quant-ph↗

arXiv2026

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↗

arXiv2025

Dissipative ground state preparation in ab initio electronic structure theory

Dissipative engineering is a powerful tool for quantum state preparation, and has drawn significant attention in quantum algorithms and quantum many-body physics in recent years. In this work, we introduce a novel approach using the Lindblad dynamics to efficiently prepare the ground state for general ab initio electronic structure problems on quantum computers, without variational parameters. These problems often involve Hamiltonians that lack geometric locality or sparsity structures, which we address by proposing two generic types of jump operators for the Lindblad dynamics. Type-I jump operators break the particle number symmetry and should be simulated in the Fock space. Type-II jump operators preserves the particle number symmetry and can be simulated more efficiently in the full configuration interaction space. For both types of jump operators, we prove that in a simplified Hartree-Fock framework, the spectral gap of our Lindbladian is lower bounded by a universal constant. For physical observables such as energy and reduced density matrices, the convergence rate of our Lindblad dynamics with Type-I jump operators remains universal, while the convergence rate with Type-II jump operators only depends on coarse grained information such as the number of orbitals and the number of electrons. To validate our approach, we employ a Monte Carlo trajectory-based algorithm for simulating the Lindblad dynamics for full ab initio Hamiltonians, demonstrating its effectiveness on molecular systems amenable to exact wavefunction treatment.

quant-ph↗

arXiv2025

Fast mixing of weakly interacting fermionic systems at any temperature

We study the mixing time of a recently proposed efficiently implementable Lindbladian designed to prepare the Gibbs states in the setting of weakly interacting fermionic systems. We show that at any temperature, the Lindbladian spectral gap for even parity observables is lower bounded by a constant that is independent of the system size, when the interaction strength (e.g., the on-site interaction strength for the Fermi-Hubbard model) is below a constant threshold, which is also independent of the system size. This leads to a mixing time estimate that is at most linear in the system size, thus showing that the corresponding Gibbs states can be prepared efficiently on quantum computers.

quant-ph↗

arXiv2023

Learning conservation laws in unknown quantum dynamics

We present a learning algorithm for discovering conservation laws given as sums of geometrically local observables in quantum dynamics. This includes conserved quantities that arise from local and global symmetries in closed and open quantum many-body systems. The algorithm combines the classical shadow formalism for estimating expectation values of observable and data analysis techniques based on singular value decompositions and robust polynomial interpolation to discover all such conservation laws in unknown quantum dynamics with rigorous performance guarantees. Our method can be directly realized in quantum experiments, which we illustrate with numerical simulations, using closed and open quantum system dynamics in a $\mathbb{Z}_2$-gauge theory and in many-body localized spin-chains.

quant-ph↗

arXiv2021

Detecting Entanglement in Unfaithful States

Entanglement witness is an effective method to detect entanglement in unknown states without doing full tomography. One of the most widespread schemes of witnessing entanglement is measuring its fidelity with respect to a pure entangled state. Recently, a large class of states whose entanglement can not be detected with the fidelity witness has been discovered in Phys.Rev.Lett \textbf{124},200502(2020). They are called unfaithful states. In this paper we propose a new way to detect entanglement by calculating the lower bound of entanglement using measurement results. Numerical simulation shows our method can detect entanglement in unfaithful states with a small number of measurements. Moreover, we generalize our scheme to multipartite states and show that it can tolerate higher noise than previous entanglement witness operators with same number of measurement settings.

quant-ph↗

arXiv2020

Tomography-based Quantum Key Distribution

It has previously been shown that quantum state tomography can be used to increase the key rate of quantum key distribution (QKD) for the special case of qubits (i.e.,d=2). Here, we consider the case of higher dimensions, i.e., qudits, and show that, for a prime number d>2, quantum state tomography can also improve the key rate of d-dimensional qudit-based QKD schemes, compared to the standard (d+1)-basis protocol. We apply our results to previous QKD experiments based on OAM (orbital angular momentum) encoding and demonstrate the advantage of tomography-based QKD protocols. Moreover, we compare the key rate of tomography-based QKD protocol with reference-frame-independent QKD protocol. We show that, for a rotation channel, the two protocols give the same key rate. However, for any other channels, tomography-based QKD protocol always gives a higher key rate than reference-frame-independent QKD protocol.

quant-ph↗