Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms

Abstract

In the context of Variational Quantum Algorithms (VQAs), selecting an appropriate ansatz is crucial for efficient problem-solving. Hamiltonian expressibility has been introduced as a metric to quantify a circuit's ability to uniformly explore the energy landscape associated with a Hamiltonian ground state search problem. However, its influence on solution quality remains largely unexplored. In this work, we estimate the Hamiltonian expressibility of a well-defined set of circuits applied to various Hamiltonians using a Monte Carlo-based approach. We analyze how ansatz depth influences expressibility and identify the most and least expressive circuits across different problem types. We then train each ansatz using the Variational Quantum Eigensolver (VQE) and analyze the correlation between solution quality and expressibility.Our results indicate that, under ideal or low-noise conditions and particularly for small-scale problems, ansätze with high Hamiltonian expressibility yield better performance for problems with non-diagonal Hamiltonians and superposition-state solutions. Conversely, circuits with low expressibility are more effective for problems whose solutions are basis states, including those defined by diagonal Hamiltonians. Under noisy conditions, low-expressibility circuits remain preferable for basis-state problems, while intermediate expressibility yields better results for some problems involving superposition-state solutions.

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Circuit-centric quantum classifiers
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Quantum autoencoders for efficient compression of quantum data
• Quantum Natural Gradient
• Chaos and complexity by design
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• The Expressive Power of Parameterized Quantum Circuits
• Learning the quantum algorithm for state overlap
• Kinetic theory of spin diffusion and superdiffusion in XXZ spin chains
• Effect of barren plateaus on gradient-free optimization
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Structure optimization for parameterized quantum circuits
• Quantum circuit architecture search for variational quantum algorithms
• Exploiting symmetry in variational quantum machine learning
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• IBM Quantum Computers: Evolution, Performance, and Future Directions
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Qubit-excitation-based adaptive variational quantum eigensolver
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Evaluating the noise resilience of variational quantum algorithms
• Quantum logic and entanglement by neutral Rydberg atoms: methods and fidelity
• Genetic Algorithms for Digital Quantum Simulations
• Dimensional Expressivity Analysis of Parametric Quantum Circuits
• Overlap-ADAPT-VQE: Practical Quantum Chemistry on Quantum Computers via Overlap-Guided Compact Ansätze
• Benchmarking adaptive variational quantum eigensolvers
• A semi-agnostic ansatz with variable structure for quantum machine learning
• Scalable, high-fidelity all-electronic control of trapped-ion qubits
• Sampling and scrambling on a chain of superconducting qubits
• Reinforcement Learning Generation of 4-Qubits Entangled States