Quantifying the efficiency of state preparation via quantum variational eigensolvers

Abstract

Recently, there has been much interest in the efficient preparation of complex quantum states using low-depth quantum circuits, such as Quantum Approximate Optimization Algorithm (QAOA). While it has been numerically shown that such algorithms prepare certain correlated states of quantum spins with surprising accuracy, a systematic way of quantifying the efficiency of QAOA in general classes of models has been lacking. Here, we propose that the success of QAOA in preparing ordered states is related to the interaction distance of the target state, which measures how close that state is to the manifold of all Gaussian states in an arbitrary basis of single-particle modes. We numerically verify this for several examples of non-integrable quantum models, including Ising models with two- and three-spin interactions and the cluster model in an external field. Our results suggest that the structure of the entanglement spectrum, as witnessed by the interaction distance, correlates with the success of QAOA state preparation, and that this correlation also contains information about different phases present in the model. We conclude that QAOA typically finds a solution that perturbs around the closest free-fermion state.

arXiv comment13 pages, 9 figures

References in corpus (37)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Entanglement Entropy and Quantum Field Theory
• Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
• The theory of variational hybrid quantum-classical algorithms
• Persistent entanglement in arrays of interacting particles
• Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
• Entanglement spectrum of a topological phase in one dimension
• Topological phases of fermions in one dimension
• Classifying quantum phases using Matrix Product States and PEPS
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum criticality in an Ising chain: experimental evidence for emergent E8 symmetry
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Complete classification of 1D gapped quantum phases in interacting spin systems
• Cluster-state quantum computation
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Three-spin interactions in optical lattices and criticality in cluster Hamiltonians
• One-Dimensional Symmetry Protected Topological Phases and their Transitions
• $XY$-mixers: analytical and numerical results for QAOA
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Variational Thermal Quantum Simulation via Thermofield Double States
• Statistical mechanics of the Cluster-Ising model
• Efficient variational simulation of non-trivial quantum states
• The antiferromagnetic Ising chain in a mixed transverse and longitudinal magnetic field
• Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
• A hierarchy of bound states in the 1D ferromagnetic Ising chain CoNb${}_2$O${}_6$ investigated by high resolution time-domain terahertz spectroscopy
• Glassy Phase of Optimal Quantum Control
• Scaling of variational quantum circuit depth for condensed matter systems
• Parafermionic conformal field theory on the lattice
• Quantum state discrimination: a geometric approach
• Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
• Ultrafast Variational Simulation of Non-trivial Quantum States with Long Range Interactions
• Broken symmetry in a two-qubit quantum control landscape
• Optimal free descriptions of many-body theories
• Free-fermion descriptions of parafermion chains and string-net models
• Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols
• Quantifying the effect of interactions in quantum many-body systems

Cited by in corpus (16)

• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Adaptive variational quantum eigensolvers for highly excited states
• Self-Correcting Quantum Many-Body Control using Reinforcement Learning with Tensor Networks
• Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations
• Two-dimensional ${\mathbb{Z}}_2$ lattice gauge theory on a near-term quantum simulator: variational quantum optimization, confinement, and topological order
• Quantum Dropout: On and Over the Hardness of Quantum Approximate Optimization Algorithm
• Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
• Characterization of variational quantum algorithms using free fermions
• Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry
• Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy Networks
• Toward a Theory of Phase Transitions in Quantum Control Landscapes
• Bang-bang algorithms for quantum many-body ground states: a tensor network exploration
• Quantum approximate optimization of finite-state bosonic systems
• Quantum Alternating Operator Ansatz for the Preparation and Detection of Long-Lived Singlet States in NMR
• Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes