On the practical usefulness of the Hardware Efficient Ansatz

Abstract

Variational Quantum Algorithms (VQAs) and Quantum Machine Learning (QML) models train a parametrized quantum circuit to solve a given learning task. The success of these algorithms greatly hinges on appropriately choosing an ansatz for the quantum circuit. Perhaps one of the most famous ansatzes is the one-dimensional layered Hardware Efficient Ansatz (HEA), which seeks to minimize the effect of hardware noise by using native gates and connectives. The use of this HEA has generated a certain ambivalence arising from the fact that while it suffers from barren plateaus at long depths, it can also avoid them at shallow ones. In this work, we attempt to determine whether one should, or should not, use a HEA. We rigorously identify scenarios where shallow HEAs should likely be avoided (e.g., VQA or QML tasks with data satisfying a volume law of entanglement). More importantly, we identify a Goldilocks scenario where shallow HEAs could achieve a quantum speedup: QML tasks with data satisfying an area law of entanglement. We provide examples for such scenario (such as Gaussian diagonal ensemble random Hamiltonian discrimination), and we show that in these cases a shallow HEA is always trainable and that there exists an anti-concentration of loss function values. Our work highlights the crucial role that input states play in the trainability of a parametrized quantum circuit, a phenomenon that is verified in our numerics.

References in corpus (68)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Distributed Entanglement
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Circuit Learning
• Quantum Convolutional Neural Networks
• Strong quantum computational advantage using a superconducting quantum processor
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Evaluating analytic gradients on quantum hardware
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Hartree-Fock on a superconducting qubit quantum computer
• Chaos in quantum channels
• Challenges and Opportunities in Quantum Machine Learning
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Data re-uploading for a universal quantum classifier
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Generalization in quantum machine learning from few training data
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Entropy scaling and simulability by Matrix Product States
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum-assisted quantum compiling
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Local random quantum circuits are approximate polynomial-designs
• Stabilizer Rényi entropy
• Chaos, Complexity, and Random Matrices
• Measuring entanglement entropy of a generic many-body system with a quantum switch
• Provably efficient machine learning for quantum many-body problems
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Variational Quantum Linear Solver
• Exploiting symmetry in variational quantum machine learning
• Variational algorithms for linear algebra
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• Group-Invariant Quantum Machine Learning
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Entanglement Devised Barren Plateau Mitigation
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• On barren plateaus and cost function locality in variational quantum algorithms
• Scalable measures of magic resource for quantum computers
• Measuring magic on a quantum processor
• Theory for Equivariant Quantum Neural Networks
• Quantum Chaos is Quantum
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Symbolic integration with respect to the Haar measure on the unitary group
• Computable and operationally meaningful multipartite entanglement measures
• Subtleties in the trainability of quantum machine learning models
• The controlled SWAP test for determining quantum entanglement
• Mutual information-assisted Adaptive Variational Quantum Eigensolver
• Entanglement, quantum randomness, and complexity beyond scrambling
• Building spatial symmetries into parameterized quantum circuits for faster training
• Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
• Progress toward favorable landscapes in quantum combinatorial optimization
• Transitions in entanglement complexity in random quantum circuits by measurements
• Conditional Mutual Information of Bipartite Unitaries and Scrambling
• Isospectral twirling and quantum chaos
• Random Matrix Theory of the Isospectral twirling
• A semi-agnostic ansatz with variable structure for quantum machine learning

Cited by in corpus (33)

• Barren Plateaus in Variational Quantum Computing
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Does provable absence of barren plateaus imply classical simulability?
• Trainability barriers and opportunities in quantum generative modeling
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• A hybrid quantum-classical framework for computational fluid dynamics
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Protocols for Trainable and Differentiable Quantum Generative Modelling
• Variational quantum computing for quantum simulation: principles, implementations, and challenges
• Anderson impurity solver integrating tensor network methods with quantum computing
• A near-term quantum simulation of the transverse field Ising model hints at Glassy Dynamics
• Demonstration of Hardware Efficient Photonic Variational Quantum Algorithm
• Contextual Quantum Neural Networks for Stock Price Prediction
• Hierarchical Multigrid Ansatz for Variational Quantum Algorithms
• Survey on Computational Applications of Tensor Network Simulations
• Photonic variational quantum eigensolver for NISQ-compatible quantum technology
• Accurately Simulating the Time Evolution of an Ising Model with Echo Verified Clifford Data Regression on a Superconducting Quantum Computer
• A Universal Quantum Computer From Relativistic Motion
• Compressed sensing enhanced by quantum approximate optimization algorithm
• OnionVQE Optimization Strategy for Ground State Preparation on NISQ Devices
• Consensus-based qubit configuration optimization for variational algorithms on neutral atom quantum systems
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions
• Equivalence between exponential concentration in quantum machine learning kernels and barren plateaus in variational algorithms
• Quantum generative classification with mixed states
• Direct Gradient Computation for Barren Plateaus in Parameterized Quantum Circuits
• Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
• Adaptive Interpolating Quantum Transform: A Quantum-Native Framework for Efficient Transform Learning
• Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
• Slice-Wise Initial State Optimization to Improve Cost and Accuracy of the VQE on Lattice Models
• Zero-Noise Extrapolation via Cyclic Permutations of Quantum Circuit Layouts
• Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut