An official website of the United States government
In a recent paper (JCTC, 16, 6098 (2020)), we introduced a new approach for accurately approximating full CI ground states in large electronic active-spaces, called Tensor Product Selected CI (TPSCI). In TPSCI, a large orbital active space is first partitioned into disjoint sets (clusters) for which the exact local many-body eigenstates are obtained. Tensor products of these locally correlated many-body states are taken as the basis for the full, global Hilbert space. By folding correlation into the basis states themselves, the low-energy eigenstates become increasingly sparse, creating a more compact selected CI expansion. While we demonstrated that this approach can improve accuracy for a variety of systems, there is even greater potential for applications to excited states, particularly those which have some excitonic character. In this paper, we report on the accuracy of TPSCI for excited states, including a far more efficient implementation in the Julia programming language. In traditional SCI methods that use a Slater determinant basis, accurate excitation energies are obtained only after a linear extrapolation and at a large computational cost. We find that TPSCI with perturbative corrections provides accurate excitation energies for several excited states of various polycyclic aromatic hydrocarbons (PAH) with respect to the extrapolated result (i.e. near exact result). Further, we use TPSCI to report highly accurate estimates of the lowest 31 eigenstates for a tetracene tetramer system with an active space of 40 electrons in 40 orbitals, giving direct access to the initial bright states and the resulting 18 biexcitonic states.
more »
« less
This content will become publicly available on October 28, 2026
Computing excited eigenstates using inexact Lanczos methods and tree tensor network states
To understand the dynamics of quantum many-body systems, it is essential to study excited eigenstates. While tensor network states have become a standard tool for computing ground states in computational many-body physics, obtaining accurate excited eigenstates remains a significant challenge. In this work, we develop an approach that combines the inexact Lanczos method, which is designed for efficient computations of excited states, with tree tensor network states (TTNSs). We demonstrate our approach by computing excited vibrational states for three challenging problems: (1) 122 states in two different energy intervals of acetonitrile (12-dimensional), (2) Fermi resonance states of the fluxional Zundel ion (15-dimensional), and (3) selected excited states of the fluxional and very correlated Eigen ion (33-dimensional). The proposed TTNS inexact Lanczos method is directly applicable to other quantum many-body systems.
more »
« less
- Award ID(s):
- 2312005
- PAR ID:
- 10643870
- Publisher / Repository:
- The Journal of Chemical Physics
- Date Published:
- Journal Name:
- The Journal of Chemical Physics
- Volume:
- 163
- Issue:
- 16
- ISSN:
- 0021-9606
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Quantum many-body scar states are highly excited eigenstates of many-body systems that exhibit atypical entanglement and correlation properties relative to typical eigenstates at the same energy density. Scar states also give rise to infinitely long-lived coherent dynamics when the system is prepared in a special initial state having finite overlap with them. Many models with exact scar states have been constructed, but the fate of scarred eigenstates and dynamics when these models are perturbed is difficult to study with classical computational techniques. In this work, we propose state preparation protocols that enable the use of quantum computers to study this question. We present protocols both for individual scar states in a particular model, as well as superpositions of them that give rise to coherent dynamics. For superpositions of scar states, we present both a system-size-linear depth unitary and a finite-depth nonunitary state preparation protocol, the latter of which uses measurement and postselection to reduce the circuit depth. For individual scarred eigenstates, we formulate an exact state preparation approach based on matrix product states that yields quasipolynomial-depth circuits, as well as a variational approach with a polynomial-depth ansatz circuit. We also provide proof of principle state-preparation demonstrations on superconducting quantum hardware.more » « less
-
We provide the first tensor-network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor-network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We also introduce novel weight enumerators and their applications. In particular, we show that these enumerators can be used to compute logical error rates exactly and thus construct (optimal) decoders for any independent and identically distributed single qubit or qudit error channels. The enumerators also provide a more efficient method for computing nonstabilizerness in quantum many-body states. As the power for these speedups rely on a quantum Lego decomposition of quantum codes, we further provide systematic methods for decomposing quantum codes and graph states into a modular construction for which our technique applies. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the two-dimensional Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force. Published by the American Physical Society2024more » « less
-
Abstract Variational Monte Carlo methods have recently been applied to the calculation of excited states; however, it is still an open question what objective function is most effective. A promising approach is to optimize excited states using a penalty to minimize overlap with lower eigenstates, which has the drawback that states must be computed one at a time. We derive a general framework for constructing objective functions with minima at the the lowestNeigenstates of a many-body Hamiltonian. The objective function uses a weighted average of the energies and an overlap penalty, which must satisfy several conditions. We show this objective function has a minimum at the exact eigenstates for a finite penalty, and provide a few strategies to minimize the objective function. The method is demonstrated usingab initiovariational Monte Carlo to calculate the degenerate first excited state of a CO molecule.more » « less
-
Abstract Computing excited-state properties of molecules and solids is considered one of the most important near-term applications of quantum computers. While many of the current excited-state quantum algorithms differ in circuit architecture, specific exploitation of quantum advantage, or result quality, one common feature is their rooting in the Schrödinger equation. However, through contracting (or projecting) the eigenvalue equation, more efficient strategies can be designed for near-term quantum devices. Here we demonstrate that when combined with the Rayleigh–Ritz variational principle for mixed quantum states, the ground-state contracted quantum eigensolver (CQE) can be generalized to compute any number of quantum eigenstates simultaneously. We introduce twoexcited-state(anti-Hermitian) CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm, such as its scalability. To showcase our approach, we study several model and chemical Hamiltonians and investigate the performance of different implementations.more » « less
