Building spatial symmetries into parameterized quantum circuits for faster training

• URL: http://arxiv.org/abs/2207.14413v2
• Date: Tue, 3 Oct 2023 21:30:12 GMT
• Title: Building spatial symmetries into parameterized quantum circuits for faster training
• Authors: Frederic Sauvage, Martin Larocca, Patrick J. Coles, M. Cerezo
• Abstract summary: We show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries. Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuit structure, called ORB, are numerically probed in several ground-state problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e., the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuit structure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.

Related papers

• Topological nature of edge states for one-dimensional systems without symmetry protection [46.87902365052209]
  We numerically verify and analytically prove a winding number invariant that correctly predicts the number of edge states in one-dimensional, nearest-neighbour (between unit cells) Our invariant is invariant under unitary and similarity transforms.
  arXiv  Detail & Related papers  (2024-12-13T19:44:54Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Symmetry-restricted quantum circuits are still well-behaved [45.89137831674385]
  We show that quantum circuits restricted by a symmetry inherit the properties of the whole special unitary group $SU(2n)$. It extends prior work on symmetric states to the operators and shows that the operator space follows the same structure as the state space.
  arXiv  Detail & Related papers  (2024-02-26T06:23:39Z)
• Hamiltonian-based graph-state ansatz for variational quantum algorithms [2.1438108757511958]
  We introduce a new circuit design that combines graph-based diagonalization circuits with arbitrary single-qubit rotation gates. We test the accuracy of the proposed ansatz in estimating ground state energies of various molecules of size up to 12-qubits.
  arXiv  Detail & Related papers  (2023-12-28T17:28:23Z)
• All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks [0.0]
  Variational algorithms require architectures that naturally constrain the optimisation space to run efficiently. We propose the use of spin networks, a form of directed tensor network invariant under a group transformation, to devise SU(2) equivariant quantum circuit ans"atze. By changing to the basis that block diagonalises SU(2) group action, these networks provide a natural building block for constructing parameterised equivariant quantum circuits.
  arXiv  Detail & Related papers  (2023-09-13T18:38:41Z)
• Symmetry enhanced variational quantum imaginary time evolution [1.6872254218310017]
  We provide guidance for constructing parameterized quantum circuits according to the locality and symmetries of the Hamiltonian. Our approach can be used to implement the unitary and anti-unitary symmetries of a quantum system. Numerical results confirm that the symmetry-enhanced circuits outperform the frequently-used parametrized circuits in the literature.
  arXiv  Detail & Related papers  (2023-07-25T16:00:34Z)
• 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)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Best-approximation error for parametric quantum circuits [0.13980986259786224]
  In Variational Quantum Simulations, the construction of a suitable parametric quantum circuit is subject to two counteracting effects. The number of parameters should be small for the device noise to be manageable, but also large enough for the circuit to be able to represent the solution. To characterize such circuits, we estimate the best-approximation error using Voronoi diagrams.
  arXiv  Detail & Related papers  (2021-07-15T15:09:16Z)
• 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.