A diagrammatic approach to variational quantum ansatz construction
arXiv:1907.08157 · doi:10.22331/q-2021-12-02-596
Abstract
Variational quantum eigensolvers (VQEs) are a promising class of quantum algorithms for preparing approximate ground states in near-term quantum devices. Minimizing the error in such an approximation requires designing ansatzes using physical considerations that target the studied system. One such consideration is size-extensivity, meaning that the ground state quantum correlations are to be compactly represented in the ansatz. On digital quantum computers, however, the size-extensive ansatzes usually require expansion via Trotter-Suzuki methods. These introduce additional costs and errors to the approximation. In this work, we present a diagrammatic scheme for the digital VQE ansatzes, which is size-extensive but does not rely on Trotterization. We start by designing a family of digital ansatzes that explore the entire Hilbert space with the minimum number of free parameters. We then demonstrate how one may compress an arbitrary digital ansatz, by enforcing symmetry constraints of the target system, or by using them as parent ansatzes for a hierarchy of increasingly long but increasingly accurate sub-ansatzes. We apply a perturbative analysis and develop a diagrammatic formalism that ensures the size-extensivity of generated hierarchies. We test our methods on a short spin chain, finding good convergence to the ground state in the paramagnetic and the ferromagnetic phase of the transverse-field Ising model.
arXiv comment21 pages, 11 figures. v3 - expanded the discussion of the size-extensivity principle, clarified the diagrammatic formalism, open-sourced the numerics
References in corpus (14)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- 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
- Towards Practical Quantum Variational Algorithms
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Variational Quantum Computation of Excited States
- Variational quantum algorithms for discovering Hamiltonian spectra
- Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
- Magic State Distillation: Not as Costly as You Think
- Sequential minimal optimization for quantum-classical hybrid algorithms
- Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
- Polynomial-time algorithm for simulation of weakly interacting quantum spin systems
Cited by in corpus (8)
- Solving nonlinear differential equations with differentiable quantum circuits
- Exploiting symmetry in variational quantum machine learning
- Calculating energy derivatives for quantum chemistry on a quantum computer
- MoG-VQE: Multiobjective genetic variational quantum eigensolver
- Accelerated variational algorithms for digital quantum simulation of many-body ground states
- Certificates of quantum many-body properties assisted by machine learning
- Diagrammatic Analysis for Parameterized Quantum Circuits
- Hybrid Quantum-Classical Eigensolver Without Variation or Parametric Gates