Search arXivSearch

arXiv subjects

Garnet Kin-Lic Chan

Publications and source records attributed to Garnet Kin-Lic Chan.

At least 19 recordsLinked to original sources

Stochastic Tensor Contraction for Efficient MP2 Exchange

Second-order Moller--Plesset perturbation theory (MP2) is one of the simplest correlated wave-function methods, but its conventional $O(N^5)$ cost limits its application to large systems. Stochastic tensor contraction (STC) has recently appeared as a general technique to evaluate high-order tensor contractions in quantum chemistry. Here, we apply STC to the exchange contribution of Laplace-transformed MP2, which is the source of $O(N^5)$ scaling in the formulation. The resulting STC exchange algorithm has an $O(N^3)$ deterministic setup cost and an $O(N^2)$ stochastic cost at fixed absolute error. The estimator is unbiased and provides a way to specify the target stochastic error by estimating the number of required samples before the full calculation. We implement the algorithm using a hybrid deterministic--stochastic evaluation strategy, with grouped index sampling, to reduce the computational prefactor. Over a range of benchmark molecules containing up to $\sim 7000$ basis functions, the stochastic exchange evaluation takes as little as $1/270$ of the time of a complete DF-MP2 calculation on the same system. Within the Laplace-transformed formulation, the $O(N^4)$ scaling direct contribution is thus the only significant cost. Our results further substantiate the power of STC to serve as a general tensor-contraction engine for quantum chemistry.

physics.chem-ph

Vectorized Symmetric and Fermionic Tensor Network Implementations for GPU-Accelerated Variational Monte Carlo

Variational Monte Carlo (VMC) calculations based on tensor networks (TN) have recently achieved competitive accuracy in ground-state calculations of strongly correlated spin and fermionic systems. However, existing tensor network VMC (TN-VMC) algorithms have not been formulated in a manner that can fully utilize GPU acceleration. We tackle the key missing ingredient, namely, the vectorized evaluation of tensor network amplitudes and tensor network operations. This ensures high GPU utilization by batching over computations with identical structure. In particular, we show how to achieve vectorization for the practically relevant case of abelian symmetric tensor networks (which includes fermionic tensor networks) by developing a ``flat'' tensor network formalism for block-sparse tensor representation and contraction. Using this, we construct a GPU-adapted symmetric TN-VMC workflow with batched tensor network computation. In the two-dimensional Fermi--Hubbard model, we demonstrate a GPU speedup of up to $300 \times$ over single core CPU implementations, for fermionic TN variational wavefunctions.

physics.comp-ph

Intrinsic Wannier Functions for Hamiltonian downfolding

Downfolding ab initio material band structure into a low-energy subspace spanned by orbitals of specified atomic character, a procedure known as Wannier downfolding, is a common task in the simulation of complex materials. We introduce the Intrinsic Wannier Function (IWF) method to Wannierize bands with given atomic character. The method is non-iterative and requires only a single dimensionless parameter to disentangle bands. In benchmarks on silicon, graphene, and the three-band model of a mercury cuprate, we show that Intrinsic Wannier Functions provide high quality downfolded band structures compared to those from standard approaches such as Maximally Localized Wannier Functions and the Selected Columns of the Density Matrix method. Further, their straightforward implementation and robustness positions Intrinsic Wannier Functions as a general and useful tool for Wannier downfolding in materials electronic structure and in high-throughput applications.

cond-mat.mtrl-sci

Fast classical simulation of `Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor'

We study the N\'{e}el quench dynamics of a 1D Fermi-Hubbard model which has recently been simulated on quantum hardware. We demonstrate that the set of 7260 observable trajectories measured in the quantum experiment can be obtained more quickly and accurately through classical tensor network simulation using modest computation. Our result relies on transverse tensor network contraction, where a bond dimension of 32 is already sufficient to reproduce the quantum experiment. We further extend the converged observable trajectories to longer times than in the hardware simulation and in other recent classical simulations.

quant-ph

Shadow tomography for classical tensor network simulations

Shadow tomography has appeared as a powerful tool for estimating observables on quantum computers from a small number of samples. We show that shadow-tomography-inspired ideas can offer similarly improved sample scaling for estimating observables on tensor network states on classical computers after proper adaptation. We develop strategies for both spin (bosonic) and fermionic systems, tailored to the contraction requirements of tensor networks, and generate scaling improvements of factors of $O(N)$ to $O(N^{3})$ (where $N$ is system size), depending on the specific task and system type. For the important and difficult task of evaluating the expectation value of long-range interacting Hamiltonians, we achieve the optimal $O(1)$ overall scaling (up to logarithmic factors) for an arbitrarily fixed relative Monte Carlo error in both spin and fermionic systems. Additionally, we show that shadow estimators offer more stable gradients of observables in variational optimization tasks than standard Monte Carlo estimators. We demonstrate practical advantage by simulating systems with long-range interactions, including the 2D long-range Heisenberg model and an ab-initio quantum chemistry Hamiltonian.

quant-ph

Can phaseless auxiliary-field quantum Monte Carlo with broken symmetry trials describe iron-sulfur clusters?

Phaseless auxiliary-field quantum Monte Carlo (AFQMC) has in several cases been found to perform well on strongly correlated systems. Here, we benchmark the method for three iron-sulfur clusters ([2Fe-2S], [4Fe-4S], and the FeMo cofactor) using a hierarchy of trial states derived from coupled cluster (CC) theory, including up to quadruple excitations, as well as multi-Slater trial states derived from the density matrix renormalization group. Our results reveal for these systems that, as the symmetry-broken trial is improved, the phaseless AFQMC energy can become less accurate, and in some cases even less accurate than the underlying trial projected energy, displaying an inverted energy pattern that is only corrected once the trial fidelity is sufficiently high. For [2Fe-2S], we show that this can coincide with a simultaneous improvement in the trial state and the walker ensemble. We further find that this is not solely due to the use of spin-unrestricted trial states, as the inversion persists in [2Fe-2S] when we explicitly break the symmetry of the Hamiltonian by applying a fictitious spin-Zeeman field. Instead, we find that the energy inversion is related to the choice of measurement trial, where using a high-order CC trial state for measurements may introduce errors that are suppressed when the measurement wave function is restricted to lower excitation subspaces. In particular, measuring the energy with the mean-field reference while guiding the walkers with a CC trial improves the overall accuracy across the iron-sulfur clusters, with a possible exception for [4Fe-4S]. Taken together, our findings suggest that the relatively accurate energies obtained with an HF trial state in these systems arise from favorable error cancellation, warranting significant caution about the reliability of phaseless AFQMC with such trials for strongly correlated transition-metal systems of this kind.

physics.chem-ph

Statistical mechanics in continuous space with tensor network methods

Tensor network (TN) methods are well established for computing partition functions in statistical mechanics, though this use has traditionally been limited to lattice models. We extend the scope of TN methodology to interacting particle systems in continuous space. Through a real-space discretization combined with a cell-based coarse-graining scheme, we formulate an effective lattice model that explicitly preserves spatial locality. The partition function of this model is represented as a TN, and the thermodynamic quantities are computed via boundary contraction. We apply this framework to the two-dimensional hard-disk problem and demonstrate the strengths of the TN formulation compared to existing Monte Carlo simulations.

cond-mat.stat-mech

Coupled-Cluster Imaginary-Time Evolution and the Coupled-Cluster Energy Variance

We discuss a coupled-cluster formalism for carrying out imaginary-time evolution from an arbitrary reference, and study the properties of the resulting evolution trajectories. The evolution converges to a solution of the standard coupled-cluster amplitude equations in the long-time limit if a finite valued limit exists, but when such a limit does not exist, the trajectories still contain additional information beyond the standard solutions. We introduce the coupled-cluster energy variance which through its minima identifies physically regularized coupled-cluster amplitudes when the solutions of the amplitude equations are unreasonable. We demonstrate the value of this formalism in several exploratory examples within single- and multi-reference coupled-cluster formulations.

physics.chem-ph

Implementation of the multigrid Gaussian-Plane-Wave algorithm with GPU acceleration in PySCF

We introduce a GPU-accelerated multigrid Gaussian-Plane-Wave density fitting (FFTDF) approach for efficient Fock builds and nuclear gradient evaluations within Kohn-Sham density functional theory, as implemented in the GPU4PySCF module of PySCF. Our CUDA kernels employ a grid-based parallelization strategy for contracting Gaussian basis function pairs and achieve up to 80% of the FP64 peak performance on NVIDIA GPUs, with no loss of efficiency for high angular momentum (up to f-shell) functions. Benchmark calculations on molecules and solids with up to 1536 atoms and 20480 basis functions show up to 25x speedup on an H100 GPU relative to the CPU implementation on a 28-core shared memory node. For a 256-water cluster, the ground-state energy and nuclear gradients can be computed in ~30 seconds on a single H100 GPU. This implementation serves as an open-source foundation for many applications, such as ab initio molecular dynamics and high-throughput calculations.

physics.chem-ph

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

physics.chem-ph

Phase-sensitive representation of Majorana stabilizer states

Stabilizer states hold a special place in quantum information science due to their connection with quantum error correction and quantum circuit simulation. In the context of classical simulations of many-body physics, they are an example of states that can be both highly entangled and efficiently represented and transformed under Clifford operators. Recently, Clifford operators have been discussed in the context of fermionic quantum computation through their extension, the Majorana Clifford group. Here, we document the phase-sensitive form of the corresponding Majorana stabilizer states, as well as the algorithms for computing their amplitudes, their inner products, and update rules for transforming Majorana stabilizer states under Majorana Clifford gates.

quant-ph

Classical computational simulation of the FeMo-cofactor model to chemical accuracy and its implications

We use classical computational methods to estimate the ground-state energy to chemical accuracy in a model of the FeMo-cofactor of nitrogenase which is widely studied as a target of quantum computing. Our result relies on the insight that the ground-state problem can be characterized as one of ranking many competing, but largely simple, states. This allows a combination of systematic high-order coupled cluster and density matrix renormalization group calculations together with an extrapolation protocol to obtain an accurate energy. Within the model we identify several spin isomer candidates for the ground-state that are degenerate to chemical accuracy. Beyond this model, we characterize the impact of additional electronic excitations and the cluster and protein geometric fluctuations on the low-lying electronic landscape. We find that many features of the landscape are retained in more detailed representations of nitrogenase, which points to the complexity of spectroscopic interpretations of the electronic structure of the FeMo-cofactor.

physics.chem-ph

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

Partitioned Expansions for Approximate Tensor Network Contractions

We propose a method for approximating the contraction of a tensor network by partitioning the network into a sum of computationally cheaper networks. This method, which we call a partitioned network expansion (PNE), builds upon recent work that systematically improves belief propagation (BP) approximations using loop corrections. However, in contrast to previous approaches, our expansion does not require a known BP fixed point to be implemented and can still yield accurate results even in cases where BP fails entirely. The flexibility of our approach is demonstrated through applications to a variety of example networks, including finite 2D and 3D networks, infinite networks, networks with open indices, and networks with degenerate BP fixed points. Benchmark numerical results for networks composed of Ising, AKLT, and random tensors typically show an improvement in accuracy over BP by several orders of magnitude (when BP solutions are obtainable) and also demonstrate improved performance over traditional network approximations based on singular value decomposition (SVD) for certain tasks.

quant-ph

Systematic improvement of trial states in phaseless auxiliary-field quantum Monte Carlo

We extend the use of coupled cluster (CC) trial states in the phaseless auxiliary-field quantum Monte Carlo (AFQMC) method beyond single and double excitations to include both triple and quadruple excitations. With this AFQMC/CC hierarchy, we are able to systematically benchmark the method's performance on molecular systems as the quality of the trial is improved. Our results show that the phaseless AFQMC energy improves systematically and is typically significantly more accurate than the energy of the underlying trial state. However, the relative improvement compared to the trial CC energy decreases as we ascend the CC hierarchy. As the CC wavefunction is usually further approximated when used as an AFQMC trial, we also explore the relationship between the components of the CC wavefunction and the resulting AFQMC/CC error. Our results suggest that improving the representation of the CC wave function in the AFQMC trial does not always lower the bias even when it increases the fidelity of the trial with the exact ground state.

physics.chem-ph

Tensor Network Loop Cluster Expansions for Quantum Many-Body Problems

We analyze the tensor network loop cluster expansion, introduced in [G. Park, J. Gray, and G. K.-L. Chan, Phys. Rev. B 112, 174310 (2025)] as a systematic correction to belief propagation, in the context of general quantum many-body problems. We provide numerical examples of the accuracy and practical applicability of the approach for the computation of ground-state observables for high bond dimension tensor networks, in two- and three-dimensions, with open and periodic boundary conditions, and for spin and fermion problems. We find that the contraction error converges approximately exponentially with cluster size, enabling accurate local observable and energy estimates for many systems where standard contraction methods are otherwise impractical.

quant-ph

Reactive Chemistry at Unrestricted Coupled Cluster Level: High-throughput Calculations for Training Machine Learning Potentials

Accurately modeling chemical reactions at the atomistic level requires high-level electronic structure theory due to the presence of unpaired electrons and the need to properly describe bond breaking and making energetics. Commonly used approaches such as Density Functional Theory (DFT) frequently fail for this task due to deficiencies that are well recognized. However, for high-fidelity approaches, creating large datasets of energies and forces for reactive processes to train machine learning interatomic potentials or force fields is daunting. For example, the use of the unrestricted coupled cluster level of theory has previously been seen as unfeasible due to high computational costs, the lack of analytical gradients in many computational codes, and additional challenges such as constructing suitable basis set corrections for forces. In this work, we develop new methods and workflows to overcome the challenges inherent to automating unrestricted coupled cluster calculations. Using these advancements, we create a dataset of gas-phase reactions containing energies and forces for 3119 different organic molecules configurations calculated at the gold-standard level of unrestricted CCSD(T) (coupled cluster singles doubles and perturbative triples). With this dataset, we provide an analysis of the differences between the density functional and unrestricted CCSD(T) descriptions. We develop a transferable machine learning interatomic potential for gas-phase reactions, trained on unrestricted CCSD(T) data, and demonstrate the advantages of transitioning away from DFT data. Transitioning from training to DFT to training to UCCSD(T) datasets yields an improvement of more than 0.1 eV/{\AA} in force accuracy and over 0.1 eV in activation energy reproduction.

physics.chem-ph

Predictive Free Energy Simulations Through Hierarchical Distillation of Quantum Hamiltonians

Obtaining the free energies of condensed phase chemical reactions remains computationally prohibitive for high-level quantum mechanical methods. We introduce a hierarchical machine learning framework that bridges this gap by distilling knowledge from a small number of high-fidelity quantum calculations into increasingly coarse-grained, machine-learned quantum Hamiltonians. By retaining explicit electronic degrees of freedom, our approach further enables a faithful embedding of quantum and classical degrees of freedom that captures long-range electrostatics and the quantum response to a classical environment to infinite order. As validation, we compute the proton dissociation constants of weak acids and the kinetic rate of an enzymatic reaction entirely from first principles, reproducing experimental measurements within chemical accuracy or their uncertainties. Our work demonstrates a path to condensed phase simulations of reaction free energies at the highest levels of accuracy with converged statistics.

physics.chem-ph