Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes
Variational Quantum Algorithms (VQAs) are a promising tool in the NISQ era, leveraging quantum computing across diverse fields. However, their performance is hindered by optimization challenges like local minima, barren …
NavigateQuantum Machine LearningTheoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
Despite the great promise of quantum machine learning models, there are several challenges one must overcome before unlocking their full potential. For instance, models based on quantum neural networks (QNNs) can suffer …
Quantum Machine LearningClassical symmetries and the Quantum Approximate Optimization Algorithm
We study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be optimized. Our approach formalizes the connection between quantum symm…
Learning to Learn with Quantum Optimization via Quantum Neural Networks
Quantum Approximate Optimization Algorithms (QAOA) promise efficient solutions to classically intractable combinatorial optimization problems by harnessing shallow-depth quantum circuits. Yet, their performance and scala…
Combinatorial OptimizationMeta-LearningThe rules of long DNA-sequences and tetra-groups of oligonucleotides
The article represents a new class of hidden symmetries in long sequences of oligonucleotides of single stranded DNA from their representative set. These symmetries are an addition to symmetries described by the second p…