Fast Emulation of Fermionic Circuits with Matrix Product States.

We describe a matrix product state (MPS) extension for the Fermionic Quantum Emulator (FQE) software library. We discuss the theory behind symmetry-adapted MPSs for approximating many-body wave functions of spin-1/2 Fermions, and we present an open-source, MPS-enabled implementation of the FQE interface (MPS-FQE). The software uses the open-source pyblock3 and block2 libraries for most elementary tensor operations, and it can largely be used as a drop-in replacement for FQE that allows for more efficient but approximate emulation of larger Fermionic circuits. Finally, we show several applications relevant to both near-term and fault-tolerant quantum algorithms where approximate emulation of larger systems is expected to be useful: characterization of state preparation strategies for quantum phase estimation, the testing of different variational quantum eigensolver ansätze, the numerical evaluation of Trotter errors, and the simulation of general quantum dynamics problems. In all these examples, approximate emulation with MPS-FQE allows us to treat systems that are significantly larger than those accessible with a full statevector emulator.

Matrix Product States with Large Sites.

We explore various ways to group orbitals into clusters in a matrix product state (MPS). We explain how a generic cluster MPS can often lead to an increase in computational cost and instead propose a special cluster structure, involving only the first and last orbitals/sites, with a wider scope for computational advantage. This structure is a natural formalism to describe correlated multireference (MR) theories. We demonstrate the flexibility and usefulness of this approach by implementing various uncontracted MR configuration interaction, perturbation, and linearized coupled cluster theories using an MPS with large cluster sites. Applications to the nitrogen dimer, the chromium dimer, and benzene, including up to triple excitations in the external space, demonstrate the utility of an MPS with up to two large sites. We use our results to analyze the quality of different multireference approximations.

Three-Legged Tree Tensor Networks with SU(2) and Molecular Point Group Symmetry.

We extend the three-legged tree tensor network state (T3NS) [ J. Chem. Theory Comput. 2018 , 14 , 2026 - 2033 ] by including spin and the real abelian point group symmetries. T3NS intersperses physical tensors with branching tensors. Physical tensors have one physical index and at most two virtual indices. Branching tensors have up to three virtual indices and no physical index. In this way, T3NS combines the low computational cost of matrix product states and their simplicity for implementing symmetries, with the better entanglement representation of tree tensor networks. By including spin and point group symmetries, more accurate calculations can be obtained with lower computational effort. We illustrate this by presenting calculations on the bis(µ-oxo) and µ-η2:η2 peroxo isomers of [Cu2O2]2+. The used implementation is available on github .

Method for making 2-electron response reduced density matrices approximately N-representable.

In methods like geminal-based approaches or coupled cluster that are solved using the projected Schrödinger equation, direct computation of the 2-electron reduced density matrix (2-RDM) is impractical and one falls back to a 2-RDM based on response theory. However, the 2-RDMs from response theory are not N-representable. That is, the response 2-RDM does not correspond to an actual physical N-electron wave function. We present a new algorithm for making these non-N-representable 2-RDMs approximately N-representable, i.e., it has the right symmetry and normalization and it fulfills the P-, Q-, and G-conditions. Next to an algorithm which can be applied to any 2-RDM, we have also developed a 2-RDM optimization procedure specifically for seniority-zero 2-RDMs. We aim to find the 2-RDM with the right properties which is the closest (in the sense of the Frobenius norm) to the non-N-representable 2-RDM by minimizing the square norm of the difference between this initial response 2-RDM and the targeted 2-RDM under the constraint that the trace is normalized and the 2-RDM, Q-matrix, and G-matrix are positive semidefinite, i.e., their eigenvalues are non-negative. Our method is suitable for fixing non-N-representable 2-RDMs which are close to being N-representable. Through the N-representability optimization algorithm we add a small correction to the initial 2-RDM such that it fulfills the most important N-representability conditions.

T3NS: Three-Legged Tree Tensor Network States.

We present a new variational tree tensor network state (TTNS) ansatz, the three-legged tree tensor network state (T3NS). Physical tensors are interspersed with branching tensors. Physical tensors have one physical index and at most two virtual indices, as in the matrix product state (MPS) ansatz of the density matrix renormalization group (DMRG). Branching tensors have no physical index, but up to three virtual indices. In this way, advantages of DMRG, in particular a low computational cost and a simple implementation of symmetries, are combined with advantages of TTNS, namely incorporating more entanglement. Our code is capable of simulating quantum chemical Hamiltonians, and we present several proof-of-principle calculations on LiF, N2, and the bis(µ-oxo) and µ-η2:η2 peroxo isomers of [Cu2O2]2+.