Lie groups for quantum complexity and barren plateau theory

Abstract

Advances in quantum computing over the last two decades have required sophisticated mathematical frameworks to deepen the understanding of quantum algorithms. In this review, we introduce the theory of Lie groups and their algebras to analyze two fundamental problems in quantum computing as done in some recent works. Firstly, we describe the geometric formulation of quantum computational complexity, given by the length of the shortest path on the $SU(2^n)$ manifold with respect to a right-invariant Finsler metric. Secondly, we deal with the barren plateau phenomenon in Variational Quantum Algorithms (VQAs), where we use the Dynamical Lie Algebra (DLA) to identify algebraic sources of untrainability

14 pages, 2 figures

References in corpus (12)

• Spintronics: Fundamentals and applications
• Variational Quantum Algorithms
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Hartree-Fock on a superconducting qubit quantum computer
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Contextuality supplies the magic for quantum computation
• Quantum Computation as Geometry
• The Second Law of Quantum Complexity
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• Decoherence of quantum registers
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits