Non-trivial symmetries in quantum landscapes and their resilience to quantum noise

Abstract

Very little is known about the cost landscape for parametrized Quantum Circuits (PQCs). Nevertheless, PQCs are employed in Quantum Neural Networks and Variational Quantum Algorithms, which may allow for near-term quantum advantage. Such applications require good optimizers to train PQCs. Recent works have focused on quantum-aware optimizers specifically tailored for PQCs. However, ignorance of the cost landscape could hinder progress towards such optimizers. In this work, we analytically prove two results for PQCs: (1) We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. Alternatively, this can be cast as an exponential reduction in the volume of relevant hyperparameter space. (2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima. Based on these results, we introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs. Our numerical simulations show that SYMH improves the overall optimizer performance in the presence of non-unital noise at a level comparable to current hardware. Overall, this work derives large-scale circuit symmetries from local gate transformations, and uses them to construct a noise-aware optimization method.

arXiv comment13 + 7 pages, 10 figures, updated title and article to published version

References in corpus (61)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• 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
• A Quantum Approximate Optimization Algorithm
• Quantum Circuit Learning
• Quantum Chemistry in the Age of Quantum Computing
• Quantum Convolutional Neural Networks
• Error mitigation for short-depth quantum circuits
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Measurement-based quantum computation
• Evaluating analytic gradients on quantum hardware
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Towards Practical Quantum Variational Algorithms
• Efficient Learning for Deep Quantum Neural Networks
• The quest for a Quantum Neural Network
• Efficient variational quantum simulator incorporating active error minimisation
• Noise tailoring for scalable quantum computation via randomized compiling
• Practical Quantum Error Mitigation for Near-Future Applications
• Quantum autoencoders for efficient compression of quantum data
• Quantum Natural Gradient
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Quantum-assisted quantum compiling
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Stochastic gradient descent for hybrid quantum-classical optimization
• Variational Quantum State Diagonalization
• Noise Resilience of Variational Quantum Compiling
• Sequential minimal optimization for quantum-classical hybrid algorithms
• Trainability of Dissipative Perceptron-Based Quantum Neural Networks
• A Software Methodology for Compiling Quantum Programs
• Mitigating depolarizing noise on quantum computers with noise-estimation circuits
• Estimating the gradient and higher-order derivatives on quantum hardware
• Determinism in the one-way model
• Barren plateaus preclude learning scramblers
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Methodology for replacing indirect measurements with direct measurements
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Efficient estimation of Pauli channels
• Variational Quantum Fidelity Estimation
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices
• Evaluating the noise resilience of variational quantum algorithms
• A Universal Training Algorithm for Quantum Deep Learning
• Using models to improve optimizers for variational quantum algorithms
• Variational Consistent Histories as a Hybrid Algorithm for Quantum Foundations
• Quantum error correction of coherent errors by randomization
• Characterizing the loss landscape of variational quantum circuits
• Robust quantum compilation and circuit optimisation via energy minimisation
• Practical experimental certification of computational quantum gates via twirling
• Dynamical mean field theory algorithm and experiment on quantum computers
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Quantum State Discrimination Using Noisy Quantum Neural Networks
• Exponentially Many Local Minima in Quantum Neural Networks

Cited by in corpus (21)

• Barren Plateaus in Variational Quantum Computing
• Theory for Equivariant Quantum Neural Networks
• Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
• Does provable absence of barren plateaus imply classical simulability?
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze
• Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
• Quantum Architecture Search: A Survey
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Quantum Energy Landscape and VQA Optimization
• Trainability Barriers in Low-Depth QAOA Landscapes
• Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
• Quantum DeepONet: Neural operators accelerated by quantum computing
• Variational quantum computing for quantum simulation: principles, implementations, and challenges
• Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
• Simulating quantum circuits with arbitrary local noise using Pauli Propagation
• Universal noise-precision relations in variational quantum algorithms
• Scalability Challenges in Variational Quantum Optimization under Stochastic Noise
• Characterization of overparametrization in the simulation of realistic quantum systems
• Efficient Estimation and Sequential Optimization of Cost Functions in Variational Quantum Algorithms
• Zero-Noise Extrapolation via Cyclic Permutations of Quantum Circuit Layouts
• Simplifying errors by symmetry and randomisation