Characterization of variational quantum algorithms using free fermions

Abstract

We study variational quantum algorithms from the perspective of free fermions. By deriving the explicit structure of the associated Lie algebras, we show that the Quantum Approximate Optimization Algorithm (QAOA) on a one-dimensional lattice -- with and without decoupled angles -- is able to prepare all fermionic Gaussian states respecting the symmetries of the circuit. Leveraging these results, we numerically study the interplay between these symmetries and the locality of the target state, and find that an absence of symmetries makes nonlocal states easier to prepare. An efficient classical simulation of Gaussian states, with system sizes up to $80$ and deep circuits, is employed to study the behavior of the circuit when it is overparameterized. In this regime of optimization, we find that the number of iterations to converge to the solution scales linearly with system size. Moreover, we observe that the number of iterations to converge to the solution decreases exponentially with the depth of the circuit, until it saturates at a depth which is quadratic in system size. Finally, we conclude that the improvement in the optimization can be explained in terms of better local linear approximations provided by the gradients.

arXiv comment20 pages, 11 figures

References in corpus (85)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Entanglement Entropy and Quantum Field Theory
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Quantum machine learning in feature Hilbert spaces
• Measurement-based quantum computation with cluster states
• Quantum Convolutional Neural Networks
• Parameterized quantum circuits as machine learning models
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• The power of quantum neural networks
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Hartree-Fock on a superconducting qubit quantum computer
• Quantum computing for finance: overview and prospects
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum Natural Gradient
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Quantum Computing for Finance: State of the Art and Future Prospects
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Classical simulation of noninteracting-fermion quantum circuits
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• The prospects of quantum computing in computational molecular biology
• Exploiting symmetry in variational quantum machine learning
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Variational algorithms for linear algebra
• Quantum algorithms to simulate many-body physics of correlated fermions
• Group-Invariant Quantum Machine Learning
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Large gradients via correlation in random parameterized quantum circuits
• Equivalence of quantum barren plateaus to cost concentration and narrow gorges
• Efficient variational simulation of non-trivial quantum states
• Capacity and quantum geometry of parametrized quantum circuits
• Identifying phases of quantum many-body systems that are universal for quantum computation
• Exact Ising model simulation on a quantum computer
• Efficient measure for the expressivity of variational quantum algorithms
• On barren plateaus and cost function locality in variational quantum algorithms
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Expressibility of the alternating layered ansatz for quantum computation
• Universal Variational Quantum Computation
• Fermionic Gaussian states: an introduction to numerical approaches
• ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus
• Symmetry-adapted variational quantum eigensolver
• On the Universality of the Quantum Approximate Optimization Algorithm
• Multiclass classification using quantum convolutional neural networks with hybrid quantum-classical learning
• Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in VQE
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Characterizing the loss landscape of variational quantum circuits
• Dimensional Expressivity Analysis of Parametric Quantum Circuits
• Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• Symmetry enhanced variational quantum spin eigensolver
• Exploiting Symmetry Reduces the Cost of Training QAOA
• Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemes
• Quantum approximate optimization algorithm for qudit systems
• Learning Unitaries by Gradient Descent
• Ultrafast Variational Simulation of Non-trivial Quantum States with Long Range Interactions
• Noise-Resilient Quantum Dynamics Using Symmetry-Preserving Ansatzes
• Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
• Shallow-circuit variational quantum eigensolver based on symmetry-inspired Hilbert space partitioning for quantum chemical calculations
• Variational thermal quantum simulation of the lattice Schwinger model
• Quantifying the efficiency of state preparation via quantum variational eigensolvers
• On Circuit Depth Scaling For Quantum Approximate Optimization
• Quantum computing critical exponents
• A Variational Ansatz for the Ground State of the Quantum Sherrington-Kirkpatrick Model
• Modular Parity Quantum Approximate Optimization
• Adaptive construction of shallower quantum circuits with quantum spin projection for fermionic systems
• Local optimization on pure Gaussian state manifolds
• A Convergence Theory for Over-parameterized Variational Quantum Eigensolvers
• Assessment of the variational quantum eigensolver: application to the Heisenberg model
• Mitigating barren plateaus of variational quantum eigensolvers
• Adaptive variational algorithms for quantum Gibbs state preparation
• Fermionic approach to variational quantum simulation of Kitaev spin models
• Quantum variational learning for entanglement witnessing
• Simulating Majorana zero modes on a noisy quantum processor
• Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry

Cited by in corpus (8)

• Barren Plateaus in Variational Quantum Computing
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Effects of noise on the overparametrization of quantum neural networks
• Lie-algebraic classical simulations for quantum computing
• Architectures and random properties of symplectic quantum circuits
• Quantum Algorithms for Compositional Text Processing
• Simulating methylamine using symmetry adapted qubit-excitation-based variational quantum eigensolver
• Fermionic Machine Learning