--- title: Dequantized Particle Algorithm url: https://www.emergentmind.com/topics/dequantized-particle-algorithm type: topic --- # Dequantized Particle Algorithm Searching arXiv for the specified papers and closely related dequantization work on guided local Hamiltonians and dequantized particle methods. The expression **dequantized particle algorithm** has been used in arXiv literature for several closely related classical surrogates of quantum procedures. In one usage, it denotes a classical algorithm for the Guided Local Hamiltonian (GLH) problem that replaces quantum imaginary-time filtering by combinatorial evaluation of partition functions over product-state components and connected interaction clusters [2411.16163]. In a second usage, it denotes a tensor-network reformulation of dequantized ground-state energy estimation in which Monte Carlo sampling over local-term “paths” is replaced by deterministic propagation of Chebyshev vectors represented as MPS or more general tensor networks [2512.13548]. In a third, explicit usage, Qin, May, and Molina use the name for a finite-dimensional dequantization of the many-body quantum theory underlying the Vlasov–Poisson system, yielding a structure-preserving discretization of the Schrödinger–Poisson equations in configuration space [2507.05151]. An earlier swarm-based formulation of quantum dynamics by classical point samples, symplexes, and corteges is conceptually adjacent to this terminology, although it arises from a different physical program [1011.1819]. ## 1. Terminological scope and major formulations Across these works, the common feature is not a single canonical algorithmic template but a recurring operation: a quantum evolution, filter, or many-body Hamiltonian is replaced by a classical representation whose elementary objects are configurations, trajectories, tensor-network states, or mode amplitudes. The phrase therefore identifies a family resemblance rather than a unique formalism. | Context | Classical objects | Quantum object being replaced | |---|---|---| | GLH / GSEE dequantization | Product configurations and connected interaction clusters | Randomized Quantum Imaginary-Time Evolution | | Tensor-network GSEE dequantization | Chebyshev vectors as MPS / tensor networks | QSVT / QEVT polynomial filtering | | Vlasov–Poisson dequantization | Fourier amplitudes \(a_l\) as finite-dimensional canonical variables | Second-quantized bosonic Hamiltonian | | Dynamic diffusion | Swarm samples, symplexes, corteges, bonds | Schrödinger evolution in Hilbert space | In the GLH setting, the term is partly interpretive: the algorithm is expressed as a deterministic cluster expansion, but it can be viewed as a **particle-like classical simulation of imaginary-time evolution**, where basis configurations play the role of particles and connected clusters encode their interaction histories [2411.16163]. In the tensor-network setting, the analogy is explicit but contrastive: the “overhead arising from sampling is replaced by the growth of the bond dimension required to represent Chebyshev vectors as tensor network states,” so a stochastic particle picture is traded for deterministic compression by entanglement structure [2512.13548]. In the Vlasov–Poisson setting, the phrase is literal and names the algorithm introduced in the paper title itself [2507.05151]. ## 2. Guided local Hamiltonians and the imaginary-time filtering problem The most technically developed use of the term in recent complexity-theoretic work arises from the **guided** Ground State Energy Estimation (GSEE) problem. The starting point is an \(n\)-qubit \(k\)-local Hamiltonian \[ H=\sum_{X\in S}\lambda_X h_X, \] where each \(h_X\) acts on at most \(k=O(1)\) qubits, \(\|h_X\|=1\), \(|\lambda_X|\le 1\), and the interaction graph has maximum degree \(\mathfrak d\). With eigen-decomposition \[ H\ket{\psi_j}=E_j\ket{\psi_j},\qquad E_00\) and a guiding state \(\ket{\psi_I}\) with overlap \(|\langle\psi_I|\psi_0\rangle|\ge \gamma\) [2411.16163]. This is the GLH problem studied by Cade–Lucia and Gharibian et al. The problem is known to be **BQP-complete**: any BQP computation can be encoded into a clock Hamiltonian plus a guiding state, and near-optimal quantum algorithms solve GLH efficiently when such overlap is available [2411.16163]. The dequantized algorithm of interest targets a specific imaginary-time quantum algorithm called **Randomized Quantum Imaginary-Time Evolution (RQITE)**. RQITE is built from the partition function \[ D_\beta(H-x)=\braket{\psi_I|e^{-\beta(H-x)}|\psi_I} =\sum_j p_j e^{-\beta(E_j-x)}, \qquad p_j=|\braket{\psi_j|\psi_I}|^2, \] and from the residual \[ R(x)=D_\beta(H-x)-D_{2\beta}(H-x). \] The algorithm evaluates \(R(x)\) on a grid in an interval \([E_a,E_b]\) containing \(E_0\), and stops when \(R(x)\) falls below a threshold \(\Xi\), outputting that \(x\) as \(E_0'\). A key condition is \[ \frac{\Delta}{\varepsilon}\ge \ln(\gamma^{-2}\varepsilon^{-1}), \] under which one chooses \[ \beta=\frac{\ln(\gamma^{-2}\varepsilon^{-1})}{\Delta},\qquad T=\frac{4}{\pi\gamma^2\varepsilon},\qquad \Xi=\left(\frac{\beta}{2}+1\right)\gamma^2\varepsilon. \] The imaginary-time operator is represented by the Fourier identity \[ e^{-\beta(H-x)}=\int_{-\infty}^{\infty}\hat g(t)\,e^{-it(H-x)}\,dt, \qquad \hat g(t)=\frac{\beta}{\pi(\beta^2+t^2)}, \] so the quantum algorithm reduces partition-function estimation to real-time evolutions and Hadamard tests [2411.16163]. The same paper proves that the quantum RQITE scheme achieves additive error \(\varepsilon\) with maximal evolution time \(t_{\max}=O(\varepsilon^{-1}\gamma^{-2})\) and total evolution time \(\widetilde O(\varepsilon^{-3}\Delta^2\gamma^{-6})\). It is not query-optimal, but it is designed to admit dequantization [2411.16163]. ## 3. Cluster expansion, semi-classical guiding states, and the particle interpretation In the GLH dequantization, *dequantization* means constructing a **classical** algorithm that, given classical access to the guiding state and the local structure of \(H\), simulates the quantum RQITE outcomes sufficiently well to solve GSEE under specified parameter regimes. The paper emphasizes that this is neither tensor networks nor naive brute-force simulation; it is a classical **cluster expansion** algorithm for expectations of \(e^{-\beta H}\), combined with **analytic continuation** when necessary [2411.16163]. The required guiding state is **semi-classical**: \[ \ket{\psi_c}=\sum_{j=1}^R a_j\ket{x_j}, \] where \(R=\mathrm{poly}(n)\) and each \(\ket{x_j}\) is a product state. Then \[ D_\beta(H-x)=\bra{\psi_c}e^{-\beta(H-x)}\ket{\psi_c} =\sum_{x,y}a_x a_y^*\, d_{x,y,\beta}(H-x), \] with matrix-element partition functions \[ d_{x,y,\beta}(H-x)=\braket{y|e^{-\beta(H-x)}|x}. \] For sufficiently small \(\beta\), the algorithm approximates \(\log d_{x,y,\beta}(H-x)\) by a cluster expansion over connected clusters of local interaction terms. The expansion is organized by connected clusters \(\bm W\), connected partitions \(P\in\mathcal P_c(\bm W)\), coupling monomials \(\bm\lambda^{\bm V}\), and local matrix elements \[ \mathcal D_{\bm V}(d_{x,y,\beta}(H)) = (-\beta)^{|\bm V|}\braket{y|h^{\bm V}|x}. \] The central bound is \[ \left|\sum_{P\in\mathcal P_c(\bm W)} C(P)\prod_{\bm V} \frac{\bm\lambda^{\bm V}{\bm V}!}{}\mathcal D_{\bm V}\right| \le \bigl[2e(\mathfrak d+1)\beta\bigr]^m. \] Consequently, if \[ \beta<\beta^*=\frac{1}{2e^2\mathfrak d(\mathfrak d+1)}, \] the truncated cluster expansion has exponentially small tail, and \(\log d_{x,y,\beta}\), hence \(D_\beta(H-x)\), can be approximated in polynomial time [2411.16163]. The “particle” reading arises from how this expansion can be reinterpreted. Each product configuration \(\ket{x}\) in \(\ket{\psi_c}\) acts like a classical particle or walker with initial weight \(|a_x|^2\). Imaginary-time evolution propagates these configurations through local terms, and each connected cluster \(\bm V\) is an interaction history by which \(\ket{x}\) scatters into \(\ket{y}\). The full matrix element \(d_{x,y,\beta}\) is then a sum over connected histories, analogous in structure to a sum over trajectories or branching histories. The authors explicitly note that they do **not** formulate the method as a Monte Carlo particle filter; they use deterministic enumeration rather than stochastic branching. A common misconception is therefore to equate the method with a sampling-based particle simulation. In the paper’s actual construction, the particle language is structural rather than literal [2411.16163]. ## 4. Accuracy regimes, analytic continuation, and the classical–quantum boundary A central contribution of the GLH dequantization is the removal of two earlier restrictions in dequantized GLH algorithms: **constant accuracy** and the unrealistic uniform norm bound \(\|H\|\le 1\). Earlier QSVT-based dequantizations became inefficient when \(\|H\|=\mathrm{poly}(n)\), because the polynomial degree scales as \(\widetilde O(\|H\|/\varepsilon)\). The new approach works directly with local terms \(\|h_X\|=1\) and interaction degree \(\mathfrak d=O(1)\), so the cluster-expansion bounds depend on \(\mathfrak d\) rather than directly on \(\|H\|\) [2411.16163]. In the **limited-accuracy regime**, when \(\beta<\beta^*\), the classical algorithm solves GSEE in runtime \[ \mathrm{poly}\left( \frac{R^2S}{\varepsilon} \right)\cdot \mathrm{poly}\!\left[ \left( \frac{S}{\gamma^2\beta\varepsilon (1-\beta/\beta^*)} \right)^{\log(\beta^*/\beta)} \right]. \] The paper characterizes this as polynomial in system parameters \(S\), \(R\), and \(\gamma^{-1}\), and super-polynomial but still sub-exponential in \(\Delta^{-1}\). A normalization corollary states that if \(\tilde H=H/\|H\|\), then the same algorithm is efficient down to accuracy \(\varepsilon>\varepsilon^*/\|H\|\), so for \(\|H\|=O(n^2)\), accuracy \(O(1/n^2)\) remains allowed [2411.16163]. For **arbitrary constant accuracy**, real-\(\beta\) cluster expansion ceases to converge, so the paper imposes a stronger overlap condition, \(\gamma\ge 1/\sqrt{2}\), and proves a zero-free region. If \[ p_0=|\langle\psi_I|\psi_0\rangle|^2\ge \frac12, \] then \[ D_\beta(H)=\sum_j p_j e^{-\beta E_j} \] is nonzero for all \(\beta\) with \(\mathrm{Re}(\beta)>0\). This makes \(\log D_\beta(H)\) analytic in the right half-plane and permits analytic continuation using the protocol of Wild. The resulting runtime is **not efficient** in general; the paper states that it is doubly exponential in \(\beta/\beta^*\), hence exponential in \(\varepsilon^{-1}\) and super-exponential in \(\Delta^{-1}\). Even so, the result refines the placement of classical and quantum hardness: GLH with **large overlap** and **constant accuracy** is classically solvable with an explicit, although huge, complexity bound [2411.16163]. The broader complexity implication is sharply stated. The work does **not** alter worst-case BQP-completeness. Rather, it indicates that quantum advantage for GLH must come from at least one of the following: a genuinely quantum guiding state rather than a semi-classical one, inverse-polynomial rather than constant accuracy, small overlaps, or Hamiltonian structure outside the reach of cluster expansion. Conversely, for sparse physical Hamiltonians with constant-degree interaction graphs, semi-classical guiding states, and constant accuracy, no exponential quantum speedup is expected [2411.16163]. ## 5. Tensor-network reformulation as a deterministic analogue The tensor-network formulation of dequantized GSEE provides a second major interpretation of dequantized particle methods. It begins from the same QSVT/QEVT eigenvalue filtering framework but removes Monte Carlo sampling entirely. Instead of sampling products of local terms \(H_{x_1}\cdots H_{x_r}\), it represents the Chebyshev vectors \[ |t_k\rangle=T_k(H)|\psi\rangle \] as tensor-network states and computes \[ \mu_k=\langle\psi|T_k(H)|\psi\rangle \] deterministically by contraction [2512.13548]. The Chebyshev recursion is \[ |t_0\rangle=|\psi\rangle,\qquad |t_1\rangle=H|\psi\rangle,\qquad |t_k\rangle=2H|t_{k-1}\rangle-|t_{k-2}\rangle. \] Moments satisfy \[ \mu_{2k}=2\langle t_k|t_k\rangle-\mu_0,\qquad \mu_{2k+1}=2\langle t_{k+1}|t_k\rangle-\mu_1, \] so all moments up to order \(2d\) are generated from Chebyshev vectors up to degree \(d\). The choice of Chebyshev basis rather than monomials is crucial because \(|T_k(\lambda_i)|\le 1\) for \(\lambda_i\in[-1,1]\), and the coefficients remain \(O(1)\), unlike monomial coefficients, which can grow like \(4^r\) [2512.13548]. This paper explicitly frames tensor-network dequantization as the deterministic, compressed-representation counterpart of dequantized particle approaches. In sampling-based dequantization, the expectation value is approximated by Monte Carlo over an exponentially large path space; in tensor-network dequantization, the same expectation is evaluated by representing the entire propagated state and allowing complexity to be controlled by bond-dimension growth. Under exact contraction assumptions, the paper proves a classical runtime \[ \mathrm{poly}\!\big((D_H)^{1/(2\epsilon)},D,n\big), \] where \(D_H\) is the bond-dimension growth factor for one application of \(H\). For MPS guiding states and Pauli Hamiltonians with \(m\) Pauli strings, the cost becomes \(O^*(D^3m^{1.5/\epsilon})\) [2512.13548]. The approximate algorithm truncates MPS bond dimension to \(\chi_{\rm mps}\), introducing local truncation error \(\Delta_t^{(k)}\), cosine error \(\Delta_c^{(k)}\), and global vector error \(\Delta^{(k)}\). If the cumulative error satisfies \[ \sum_{k=1}^d \Delta^{(k)}\le \frac{\pi}{32}\chi^2, \] then the filter expectation is accurate enough to run the GSEE binary search. If bounded-bond approximants exist with bond dimension \(D_1\), the cost becomes \(\mathrm{poly}(1/\epsilon,D_1,n)\), which is linear rather than exponential in \(1/\epsilon\) [2512.13548]. Numerically, the tensor-network method constructs high-degree polynomials up to \(d=10^4\) for Hamiltonians with up to \(100\) qubits. For the 1D transverse-field Ising model, up to \(L=100\) sites, the method yields accurate energy estimates and shows that for this setting ground-state energy estimation can be classically dequantized via MPS Chebyshev filtering. For the 2D transverse-field Ising model, up to \(L=10\), the required entanglement quickly defeats the MPS representation, and the paper interprets this breakdown as evidence of a crossover into a genuinely quantum-advantaged regime [2512.13548]. ## 6. Configuration-space particle dequantization for kinetic equations and earlier swarm formulations In kinetic plasma theory, Qin, May, and Molina introduce the **“Dequantized particle algorithm”** as a specific method for the nonlinear Vlasov–Poisson system. They begin from the \(N\)-body bosonic Hamiltonian \[ H = \sum_{i=1}^{N}\frac{\mathbf{p}_i^{2}}{2m} + \frac{1}{2}\sum_{i,j=1}^{N}\frac{q^{2}}{|\mathbf{x}_i - \mathbf{x}_j|}, \] pass to a second-quantized plane-wave representation, truncate to a finite mode set \(J\), and then dequantize by replacing \(\hat a_l,\hat a_l^\dagger\) with complex c-numbers \(a_l,a_l^*\) and commutators with Poisson brackets [2507.05151]. The resulting finite-dimensional Hamiltonian is \[ H_d=H_0+H_1, \] with \[ H_0=\sum_{l\in J}\frac{k_l^2\hbar^2}{2m}\,a_l^*a_l,\qquad H_1=\sum_{l,n,l-g,n+g\in J}^{g\neq 0}\frac{4\pi q^2}{L^3k_g^2}\,a_{l-g}^*a_{n+g}^*a_la_n, \] and equations of motion \[ \dot a_j = -\frac{i\hbar k_j^2}{2m} a_j + \frac{2\pi q^2 i\hbar}{L^3} \sum_{l,l-g,j+g\in J}^{g\neq 0}\frac{1}{k_g^2}\,a_l^*a_{l-g}a_{j+g}. \] This system preserves total energy, the particle number \(N_d=\sum_{l\in J}|a_l|^2\), and the total momentum \(P_d=\sum_{l\in J}k_l|a_l|^2\). It is shown to be a structure-preserving discretization of the Schrödinger–Poisson system, and through the Wigner or Husimi transforms it provides an approximation of the Vlasov–Poisson system when quantum effects are negligible. Unlike conventional structure-preserving algorithms formulated in 6D phase space, it operates in 3D configuration space [2507.05151]. The paper’s numerical example is the nonlinear two-stream instability. In normalized units with \[ \delta=\frac{\hbar}{L^2\omega_pm}, \] the simulation uses parameters \[ (V_0,\delta,k,\epsilon)=(0.04854,\,1.9\times 10^{-4},\,4\pi,\,5\times 10^{-4}), \] a mode set \(J=\{n\in\mathbb Z\,|\,-48\le n\le 48\}\), and therefore \(M=97\) dequantized particles. The measured linear growth rate is \(\gamma_{\rm sim}=0.3493\), compared with the theoretical value \(\gamma_{\rm theory}=0.3536\), while energy, momentum, and particle number are conserved to high precision [2507.05151]. A more speculative but historically relevant precursor is the **dynamic diffusion** model of quantum behavior. There, the quantum state is represented by a swarm of classical point samples; many-particle states are represented by **corteges**, and samples aggregate into **symplexes** connected by rigid bonds. The swarm density approximates \(|\psi|^2\), while bond creation and annihilation generate a two-fraction dynamics of slow clustered “liquid” samples and fast “gas” samples. The paper presents this as an approximation to unitary quantum dynamics that avoids differentiating the density, but it also stresses fixed spatial grain \(dx\), strong \(dx\)-dependence of effective coefficients, and an intrinsic decoherence mechanism caused by limited sample number [1011.1819]. This suggests a broader historical meaning of “dequantized particle algorithm”: a class of schemes in which quantum evolution is approximated by classical-like populations endowed with interaction rules, at the cost of structural assumptions, coarse graining, or both. Taken together, these usages identify a technically coherent research direction. In complexity theory, dequantized particle algorithms delineate when semi-classical guiding states and bounded local structure suffice for classical simulation of GLH. In tensor-network theory, they become deterministic spectral filters whose cost is governed by entanglement rather than variance. In kinetic theory, they provide a structure-preserving route from second-quantized many-body dynamics to configuration-space approximations of Vlasov–Poisson. A plausible implication is that the term will continue to function as a bridge concept between quantum-inspired classical algorithms, many-body approximation theory, and the practical verification of quantum advantage. Source: https://www.emergentmind.com/topics/dequantized-particle-algorithm