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

• URL: http://arxiv.org/abs/2011.08763v3
• Date: Thu, 1 Sep 2022 15:46:31 GMT
• Title: Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Authors: Enrico Fontana, M. Cerezo, Andrew Arrasmith, Ivan Rungger, Patrick J. Coles
• Abstract summary: Parametrized Quantum Circuits (PQCs) are employed in Quantum Neural Networks and Variational Quantum Algorithms. We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. We introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Comparing resource requirements of noisy quantum simulation algorithms for the Tavis-Cummings model [0.0]
  Fault-tolerant quantum computers could facilitate the simulation of quantum systems unfeasible for classical computation. These include quantum error mitigation (QEM) for alleviating device noise, and variational quantum algorithms (VQAs) which combine classical optimization with short-depth, parameterized quantum circuits. We compare two such methods: zero-noise extrapolation (ZNE) with noise amplification by circuit folding, and incremental structural learning (ISL) We find that while ISL achieves lower error than ZNE for smaller system sizes, it fails to produce correct dynamics for 4 qubits, where ZNE is superior.
  arXiv  Detail & Related papers  (2024-02-26T16:06:24Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Pre-optimizing variational quantum eigensolvers with tensor networks [1.4512477254432858]
  We present and benchmark an approach where we find good starting parameters for parameterized quantum circuits by simulating VQE. We apply this approach to the 1D and 2D Fermi-Hubbard model with system sizes that use up to 32 qubits. In 2D, the parameters that VTNE finds have significantly lower energy than their starting configurations, and we show that starting VQE from these parameters requires non-trivially fewer operations to come down to a given energy.
  arXiv  Detail & Related papers  (2023-10-19T17:57:58Z)
• Molecular Symmetry in VQE: A Dual Approach for Trapped-Ion Simulations of Benzene [0.2624902795082451]
  Near-term strategies hinge on the use of variational quantum eigensolver (VQE) algorithms combined with a suitable ansatz. We employ several circuit optimization methods tailored for trapped-ion quantum devices to enhance the feasibility of intricate chemical simulations. These methods, when applied to a benzene molecule simulation, enabled the construction of an 8-qubit circuit with 69 two-qubit entangling operations.
  arXiv  Detail & Related papers  (2023-08-01T17:03:10Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry [10.967081346848687]
  We study the performance of the quantum approximate optimization algorithm (QAOA) for preparing ground states of target Hamiltonians. We propose a generalized QAOA assisted by the parameterized resource Hamiltonian to achieve a better performance. Our work paves the way for performing QAOA on programmable quantum processors without translational symmetry.
  arXiv  Detail & Related papers  (2022-06-06T14:17:58Z)
• Nonadiabatic Holonomic Quantum Computation via Path Optimization [3.0726135239588164]
  We present a path-optimized NHQC scheme based on the non-Abelian geometric phase. We show that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding.
  arXiv  Detail & Related papers  (2022-05-19T02:39:42Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.