Exploring new variational quantum circuit ansatzes for solving $SU(2)$ matrix models

Abstract

In this work, we explored and experimented with new forms of parameterized quantum circuits to be used as variational ansatzes for solving the bosonic and supersymmetric $SU(2)$ matrix models at different couplings using the Variational Quantum Eigensolver (VQE) algorithm. Working with IBM Qiskit quantum computing platform, we show that two types of quantum circuits named TwoLocal and EvolvedOperatorAnsatz can outperform the popular EfficientSU2 circuits which have been routinely used in the recent quantum physics literature to run VQE. With their more customizable constructions that allow for more flexibility beyond choosing the types of parameterized rotation gates, both types of new circuit ansatzes used in this work have led to performances that are either better than or at least comparable to EfficientSU2 in the setting of $SU(2)$ matrix models. In particular, in the strong coupling regime of the bosonic model, both TwoLocal and EvolvedOperatorAnsatz circuits provided a better approximation to the exact ground state, while in the supersymmetric model, shallow EvolvedOperatorAnsatz circuits, with a small number of parameters, attained a comparable or even better performance compared to the much deeper EfficientSU2 circuits with around 8 to 9 times more parameters. The results of this work demonstrate conclusively the potential of TwoLocal and EvolvedOperatorAnsatz quantum circuits as efficient new types of variational ansatzes that should be considered more frequently in future VQE studies of quantum physics systems.

v2: new discussions added, results improved and updated, references added. v3: typos corrected, matches the published version on EPJC

References in corpus (21)

• Variational Quantum Algorithms
• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Towards Practical Quantum Variational Algorithms
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum Algorithms for Quantum Field Theories
• An initialization strategy for addressing barren plateaus in parametrized quantum circuits
• Effect of barren plateaus on gradient-free optimization
• Monte Carlo studies of supersymmetric matrix quantum mechanics with sixteen supercharges at finite temperature
• Model-free readout-error mitigation for quantum expectation values
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Holographic description of quantum black hole on a computer
• A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
• Quantum Simulation of the Sachdev-Ye-Kitaev Model by Asymmetric Qubitization
• Matrix Model simulations using Quantum Computing, Deep Learning, and Lattice Monte Carlo
• Thermodynamics of the BMN matrix model at strong coupling
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
• Massive super Yang-Mills quantum mechanics: classification and the relation to supermembrane
• An Empirical Comparison of Optimizers for Quantum Machine Learning with SPSA-based Gradients
• Benchmarking the Variational Quantum Eigensolver using different quantum hardware