Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems

Abstract

We explore the effectiveness of variational quantum circuits in simulating the ground states of quantum many-body Hamiltonians. We show that generic high-depth circuits, performing a sequence of layer unitaries of the same form, can accurately approximate the desired states. We demonstrate their universal success by using two Hamiltonian systems with very different properties: the transverse field Ising model and the Sachdev-Ye-Kitaev model. The energy landscape of the high-depth circuits has a proper structure for the gradient-based optimization, i.e. the presence of local extrema -- near any random initial points -- reaching the ground level energy. We further test the circuit's capability of replicating random quantum states by minimizing the Euclidean distance.

v1: revtex4-1, 14 pages, 11 figures; v2: 13 pages, revised for journal submission

References in corpus (31)

• Adam: A Method for Stochastic Optimization
• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Gapless Spin-Fluid Ground State in a Random Quantum Heisenberg Magnet
• Comments on the Sachdev-Ye-Kitaev model
• Quantum Chemistry in the Age of Quantum Computing
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Black Holes and Random Matrices
• Quantum Natural Gradient
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Layerwise learning for quantum neural networks
• Spectral and thermodynamic properties of the Sachdev-Ye-Kitaev model
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Analytical Spectral Density of the Sachdev-Ye-Kitaev Model at finite N
• Variational Quantum Eigensolver with Fewer Qubits
• Large gradients via correlation in random parameterized quantum circuits
• No bad local minima: Data independent training error guarantees for multilayer neural networks
• Towards Understanding Generalization of Deep Learning: Perspective of Loss Landscapes
• Expressibility of the alternating layered ansatz for quantum computation
• Eigenvalues of the Hessian in Deep Learning: Singularity and Beyond
• Symmetry-adapted variational quantum eigensolver
• Quantum Analytic Descent
• Learning Unitaries by Gradient Descent
• Loss landscapes and optimization in over-parameterized non-linear systems and neural networks

Cited by in corpus (30)

• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Theory of overparametrization in quantum neural networks
• Understanding quantum machine learning also requires rethinking generalization
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
• Quantum approximate optimization via learning-based adaptive optimization
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement
• Variational Quantum Classifiers Through the Lens of the Hessian
• Optimizing quantum circuits with Riemannian gradient flow
• Nonlinear dynamics as a ground-state solution on quantum computers
• Fourier expansion in variational quantum algorithms
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Training variational quantum algorithms with random gate activation
• Efficient estimation of trainability for variational quantum circuits
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Resource Saving via Ensemble Techniques for Quantum Neural Networks
• Can neural quantum states learn volume-law ground states?
• Quantum Energy Landscape and VQA Optimization
• Entanglement Diagnostics for Efficient Quantum Computation
• EHA: Entanglement-variational Hardware-efficient Ansatz for Eigensolvers
• Fermionic Simulators for Enhanced Scalability of Variational Quantum Simulation
• Characterization of variational quantum algorithms using free fermions
• Quantum Chaos and Circuit Parameter Optimization
• Variational Optimization for Quantum Problems using Deep Generative Networks
• Precise Low-Temperature Expansions for the Sachdev-Ye-Kitaev model
• Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers
• Double descent in quantum kernel methods
• The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
• Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
• Role of overparametrization in quantum approximate optimization
• Degeneracy Engineering for Classical and Quantum Annealing: A Case Study of Sparse Linear Regression in Collider Physics