arXiv subjects

Garnet Kin-Lic Chan

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

At least 73 records · Page 4Linked to original sources

arXiv2023

Hyper-optimized approximate contraction of tensor networks with arbitrary geometry

Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a hyper-optimization over the compression and contraction strategy itself to minimize error and cost. We demonstrate that our protocol outperforms both hand-crafted contraction strategies in the literature as well as recently proposed general contraction algorithms on a variety of synthetic and physical problems on regular lattices and random regular graphs. We further showcase the power of the approach by demonstrating approximate contraction of tensor networks for frustrated three-dimensional lattice partition functions, dimer counting on random regular graphs, and to access the hardness transition of random tensor network models, in graphs with many thousands of tensors.

quant-ph↗

arXiv2023

Simulating quantum circuit expectation values by Clifford perturbation theory

The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range of methods that scale exponentially only in the number of non-Clifford gates. Here, we consider the expectation value problem for circuits composed of Clifford gates and non-Clifford Pauli rotations, and introduce a heuristic perturbative approach based on the truncation of the exponentially growing sum of Pauli terms in the Heisenberg picture. Numerical results are shown on a Quantum Approximate Optimization Algorithm (QAOA) benchmark for the E3LIN2 problem and we also demonstrate how this method can be used to quantify coherent and incoherent errors of local observables in Clifford circuits. Our results indicate that this systematically improvable perturbative method offers a viable alternative to exact methods for approximating expectation values of large near-Clifford circuits.

quant-ph↗

arXiv2023

Fast classical simulation of evidence for the utility of quantum computing before fault tolerance

We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, as well as faster than the estimated quantum hardware runtime without classical processing, and are in good agreement with the zero-noise extrapolated experimental results.

quant-ph↗

arXiv2023

Fermionic reduced density low-rank matrix completion, noise filtering, and measurement reduction in quantum simulations

Fermionic reduced density matrices summarize the key observables in fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements, as well as statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that the 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM to chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.

quant-ph↗

arXiv2023

An ab initio correction vector restricted active space approach to the L-edge XAS and 2p3d RIXS spectra of transition metal clusters

We describe an ab initio approach to simulate L-edge X-ray absorption (XAS) and 2p3d resonant inelastic X-ray scattering (RIXS) spectroscopies. We model the strongly correlated electronic structure within a restricted active space and employ a correction vector formulation instead of sum-over-states expressions for the spectra, thus eliminating the need to calculate a large number of intermediate and final electronic states. We present benchmark simulations of the XAS and RIXS spectra of the iron complexes [FeCl4]^{-1/-2} and [Fe(SCH3)4]^{-1/-2} and interpret the spectra by deconvolving the correction vectors. Our approach represents a step towards simulating the X-ray spectroscopies of larger metal cluster systems that play a pivotal role in biology.

physics.chem-ph↗

arXiv2023

Quantum harmonic free energies for biomolecules and nanomaterials

Obtaining the free energy of large molecules from quantum mechanical energy functions is a longstanding challenge. We describe a method that allows us to estimate, at the quantum mechanical level, the harmonic contributions to the thermodynamics of molecular systems of large size, with modest cost. Using this approach, we compute the vibrational thermodynamics of a series of diamond nanocrystals, and show that the error per atom decreases with system size in the limit of large systems. We further show that we can obtain the vibrational contributions to the binding free energies of prototypical protein-ligand complexes where the exact computation is too expensive to be practical. Our work raises the possibility of routine quantum mechanical estimates of thermodynamic quantities in complex systems.

physics.chem-ph↗

arXiv2023

Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions

The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress in the field. So far, tools from theoretical quantum information have been not thoroughly explored for this task. Here we take a step in this direction by presenting efficiently computable Clifford similarity transformations for quantum chemistry Hamiltonians, which expose bases with reduced entanglement in the corresponding molecular ground states. These transformations are constructed via block diagonalization of a hierarchy of truncated molecular Hamiltonians, preserving the full spectrum of the original problem. We show that the bases introduced here allow for more efficient classical and quantum computation of ground state properties. First, we find a systematic reduction of bipartite entanglement in molecular ground states as compared to standard problem representations. This entanglement reduction has implications in classical numerical methods such as ones based on the density matrix renormalization group. Then, we develop variational quantum algorithms that exploit the structure in the new bases, showing again improved results when the hierarchical Clifford transformations are used.

quant-ph↗

arXiv2022

Towards Neural Variational Monte Carlo That Scales Linearly with System Size

Quantum many-body problems are some of the most challenging problems in science and are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, coupled with the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. However, the run-time of this approach scales quadratically with the number of simulated particles, constraining the practically usable NN to - in machine learning terms - minuscule sizes (<10M parameters). Considering the many breakthroughs brought by extreme NN in the +1B parameters scale to other domains, lifting this constraint could significantly expand the set of quantum systems we can accurately simulate on classical computers, both in size and complexity. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm - the source of the quadratic scaling. In our preliminary experiments, we demonstrate VQ-NQS ability to reproduce the ground state of the 2D Heisenberg model across various system sizes, while reporting a significant reduction of about ${\times}10$ in the number of FLOPs in the local-energy calculation.

quant-ph↗

arXiv2022

Exact relationships between the GW approximation and equation-of-motion coupled-cluster theories through the quasi-boson formalism

We describe the relationship between the GW approximation and various equation-of-motion (EOM) coupled-cluster (CC) theories. We demonstrate the exact equivalence of the G$_0$W$_0$ approximation and the propagator theory for an electron-boson problem in a particular excitation basis. From there, we establish equivalence within the quasi-boson picture to the IP+EA-EOM unitary coupled-cluster propagator. We analyze the incomplete description of screening provided by the standard similarity-transformed IP+EA-EOM-CC and the recently introduced G$_0$W$_0$ Tamm-Dancoff approximation. We further consider the approximate decoupling of IP and EA sectors in EOM-CC treatments and devise the analogous particle-hole decoupling approach for the G$_0$W$_0$ approximation. Finally, we numerically demonstrate the exact relationships and magnitude of the approximations in calculations of a set of molecular ionization potentials and electron affinities.

physics.chem-ph↗

arXiv2022

Real time evolution of Anderson impurity models via tensor network influence functionals

In this work we present and analyze two tensor network-based influence functional approaches for simulating the real-time dynamics of quantum impurity models such as the Anderson model. Via comparison with recent numerically exact simulations, we show that such methods accurately capture the long-time non-equilibrium quench dynamics. The two parameters that must be controlled in these tensor network influence functional approaches are a time discretization (Trotter) error and a bond dimension (tensor network truncation) error. We show that the actual numerical uncertainties are controlled by an intricate interplay of these two approximations which we demonstrate in different regimes. Our work opens the door to using these tensor network influence functional methods as general impurity solvers.

cond-mat.str-el↗

arXiv2022

Interacting models for twisted bilayer graphene: a quantum chemistry approach

The nature of correlated states in twisted bilayer graphene (TBG) at the magic angle has received intense attention in recent years. We present a numerical study of an interacting Bistritzer-MacDonald (IBM) model of TBG using a suite of methods in quantum chemistry, including Hartree-Fock, coupled cluster singles, doubles (CCSD), and perturbative triples (CCSD(T)), as well as a quantum chemistry formulation of the density matrix renormalization group method (DMRG). Our treatment of TBG is agnostic to gauge choices, and hence we present a new gauge-invariant formulation to detect the spontaneous symmetry breaking in interacting models. To benchmark our approach, we focus on a simplified spinless, valleyless IBM model. At integer filling ($ν=0$), all numerical methods agree in terms of energy and $C_{2z} \mathcal{T}$ symmetry breaking. Additionally, as part of our benchmarking, we explore the impact of different schemes for removing ``double-counting'' in the IBM model. Our results at integer filling suggest that cross-validation of different IBM models may be needed for future studies of the TBG system. After benchmarking our approach at integer filling, we perform the first systematic study of the IBM model near integer filling (for $|ν|< 0.2$). In this regime, we find that the ground state can be in a metallic and $C_{2z} \mathcal{T}$ symmetry breaking phase. The ground state appears to have low entropy, and therefore can be relatively well approximated by a single Slater determinant. Furthermore, we observe many low entropy states with energies very close to the ground state energy in the near integer filling regime.

cond-mat.str-el↗

arXiv2022

Is there evidence for exponential quantum advantage in quantum chemistry?

The idea to use quantum mechanical devices to simulate other quantum systems is commonly ascribed to Feynman. Since the original suggestion, concrete proposals have appeared for simulating molecular and materials chemistry through quantum computation, as a potential ``killer application''. Indications of potential exponential quantum advantage in artificial tasks have increased interest in this application, thus, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation. We conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for quantum chemistry, it may be prudent to assume exponential speedups are not generically available for this problem.

physics.chem-ph↗

arXiv2022

Multi-site Reaction Dynamics Through Multi-fragment Density Matrix Embedding

The practical description of disordered chemical reactions, where reactions involve multiple species at multiple sites, is presently challenge using correlated electronic structure methods. Here we describe the gradient theory of multi-fragment density matrix embedding theory, which potentially provides a minimal computational framework to model such processes at the correlated electron level. We present the derivation and implementation of the gradient theory, its validation on model systems and chemical reactions using density matrix embedding, and its application to a molecular dynamics simulation of proton transport in a small water cluster, a simple example of multi-site reaction dynamics.

physics.chem-ph↗

arXiv2022

Automatic transformation of irreducible representations for efficient contraction of tensors with cyclic group symmetry

Tensor contractions are ubiquitous in computational chemistry and physics, where tensors generally represent states or operators and contractions express the algebra of these quantities. In this context, the states and operators often preserve physical conservation laws, which are manifested as group symmetries in the tensors. These group symmetries imply that each tensor has block sparsity and can be stored in a reduced form. For nontrivial contractions, the memory footprint and cost are lowered, respectively, by a linear and a quadratic factor in the number of symmetry sectors. State-of-the-art tensor contraction software libraries exploit this opportunity by iterating over blocks or using general block-sparse tensor representations. Both approaches entail overhead in performance and code complexity. With intuition aided by tensor diagrams, we present a technique, irreducible representation alignment, which enables efficient handling of Abelian group symmetries via only dense tensors, by using contraction-specific reduced forms. This technique yields a general algorithm for arbitrary group symmetric contractions, which we implement in Python and apply to a variety of representative contractions from quantum chemistry and tensor network methods. As a consequence of relying on only dense tensor contractions, we can easily make use of efficient batched matrix multiplication via Intel's MKL and distributed tensor contraction via the Cyclops library, achieving good efficiency and parallel scalability on up to 4096 Knights Landing cores of a supercomputer.

physics.comp-ph↗

arXiv2022

A comparison between the one- and two-step spin-orbit coupling approaches based on the ab initio Density Matrix Renormalization Group

The efficient and reliable treatment of both spin-orbit coupling (SOC) and electron correlation is essential for understanding f-element chemistry. We analyze two approaches to the problem, the one-step approach where both effects are treated simultaneously, and the two-step state interaction approach. We report an implementation of the ab initio density matrix renormalization group (DMRG) with a one-step treatment of the SOC effect which can be compared to prior two-step treatments on an equal footing. Using a dysprosium octahedral complex and bridged dimer as benchmark systems, we identify characteristics of problems where the one-step approach is beneficial for obtaining the low-energy spectrum.

physics.chem-ph↗

arXiv2022

Holographic simulation of correlated electrons on a trapped ion quantum processor

We develop holographic quantum simulation techniques to prepare correlated electronic ground states in quantum matrix product state (qMPS) form, using far fewer qubits than the number of orbitals represented. Our approach starts with a holographic technique to prepare a compressed approximation to electronic mean-field ground-states, known as fermionic Gaussian matrix product states (GMPS), with a polynomial reduction in qubit- and (in select cases gate-) resources compared to existing techniques. Correlations are then introduced by augmenting the GMPS circuits in a variational technique which we denote GMPS+X. We demonstrate this approach on Quantinuum's System Model H1 trapped-ion quantum processor for 1$d$ models of correlated metal and Mott insulating states. Focusing on the $1d$ Fermi-Hubbard chain as a benchmark, we show that GMPS+X methods faithfully capture the physics of correlated electron states, including Mott insulators and correlated Luttinger liquid metals, using considerably fewer parameters than problem-agnostic variational circuits.

cond-mat.str-el↗

arXiv2022

The chromium dimer: closing a chapter of quantum chemistry

The complex electronic structure and unusual potential energy curve of the chromium dimer have fascinated scientists for decades, with agreement between theory and experiment so far elusive. Here, we present a new ab initio simulation of the potential energy curve and vibrational spectrum that significantly improves on all earlier estimates. Our data support a shift in earlier experimental assignments of a cluster of vibrational frequencies by one quantum number. The new vibrational assignment yields an experimentally derived potential energy curve in quantitative agreement with theory across all bond lengths and across all measured frequencies. By solving this long-standing problem, our results raise the possibility of quantitative quantum chemical modeling of transition metal clusters with spectroscopic accuracy.

physics.chem-ph↗

arXiv2022

Arithmetic circuit tensor networks, multivariable function representation, and high-dimensional integration

Many computational problems can be formulated in terms of high-dimensional functions. Simple representations of such functions and resulting computations with them typically suffer from the "curse of dimensionality", an exponential cost dependence on dimension. Tensor networks provide a way to represent certain classes of high-dimensional functions with polynomial memory. This results in computations where the exponential cost is ameliorated or in some cases, removed, if the tensor network representation can be obtained. Here, we introduce a direct mapping from the arithmetic circuit of a function to arithmetic circuit tensor networks, avoiding the need to perform any optimization or functional fit. We demonstrate the power of the circuit construction in examples of multivariable integration on the unit hypercube in up to 50 dimensions, where the complexity of integration can be understood from the circuit structure. We find very favorable cost scaling compared to quasi-Monte-Carlo integration for these cases, and further give an example where efficient quasi-Monte-Carlo cannot be theoretically performed without knowledge of the underlying tensor network circuit structure.

math.NA↗