Generating Generalised Ground-State Ansatzes from Few-Body Examples

Abstract

We introduce a method that generates ground-state ansatzes for quantum many-body systems which are both analytically tractable and accurate over wide parameter regimes. Our approach leverages a custom symbolic language to construct tensor network states (TNS) via an evolutionary algorithm. This language provides operations that allow the generated TNS to automatically scale with system size. Consequently, we can evaluate ansatz fitness for small systems, which is computationally efficient, while favouring structures that continue to perform well with increasing system size. This ensures that the ansatz captures robust features of the ground state structure. Remarkably, we find analytically tractable ansatzes with a degree of universality, which encode correlations, capture finite-size effects, accurately predict ground-state energies, and offer a good description of critical phenomena. We demonstrate this method on the Lipkin-Meshkov-Glick model (LMG) and the quantum transverse-field Ising model (TFIM), where the same ansatz was independently generated for both. The simple structure of the ansatz allows us to obtain exact expressions for the expectation values of local observables as well as for correlation functions. In addition, it permits symmetries that are broken in the ansatz to be restored, which provides a systematic means of improving the accuracy of the ansatz.

References in corpus (21)

• The density-matrix renormalization group in the age of matrix product states
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• An Area Law for One Dimensional Quantum Systems
• A class of quantum many-body states that can be efficiently simulated
• Matrix product states represent ground states faithfully
• Classical simulation of quantum many-body systems with a tree tensor network
• Density matrix embedding: A simple alternative to dynamical mean-field theory
• Finite-Size Scaling Exponents of the Lipkin-Meshkov-Glick Model
• Variational study of hard-core bosons in a 2-D optical lattice using Projected Entangled Pair States (PEPS)
• Quantum circuit architecture search for variational quantum algorithms
• Equivalence of critical scaling laws for many-body entanglement in the Lipkin-Meshkov-Glick model
• Exploring frustrated spin-systems using Projected Entangled Pair States (PEPS)
• Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
• Entanglement Entropy beyond the Free Case
• Unconstrained Tree Tensor Network: An adaptive gauge picture for enhanced performance
• Fractional quantum Hall effect in the interacting Hofstadter model via tensor networks
• Correlated cluster mean-field theory for spin systems
• Tequila: A platform for rapid development of quantum algorithms
• Critical properties of homogeneous binary trees
• A semi-agnostic ansatz with variable structure for quantum machine learning
• Hierarchical quantum circuit representations for neural architecture search