All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks

• URL: http://arxiv.org/abs/2309.07250v1
• Date: Wed, 13 Sep 2023 18:38:41 GMT
• Title: All you need is spin: SU(2) equivariant variational quantum circuits based on spin networks
• Authors: Richard D. P. East, Guillermo Alonso-Linaje, and Chae-Yeun Park
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Variational algorithms require architectures that naturally constrain the optimisation space to run efficiently. In geometric quantum machine learning, one achieves this by encoding group structure into parameterised quantum circuits to include the symmetries of a problem as an inductive bias. However, constructing such circuits is challenging as a concrete guiding principle has yet to emerge. In this paper, 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 -- circuits possessing spin rotation symmetry. 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. We prove that our construction is mathematically equivalent to other known constructions, such as those based on twirling and generalised permutations, but more direct to implement on quantum hardware. The efficacy of our constructed circuits is tested by solving the ground state problem of SU(2) symmetric Heisenberg models on the one-dimensional triangular lattice and on the Kagome lattice. Our results highlight that our equivariant circuits boost the performance of quantum variational algorithms, indicating broader applicability to other real-world problems.

Related papers

• 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)
• Enforcing exact permutation and rotational symmetries in the application of quantum neural network on point cloud datasets [0.0]
  Recent developments in the field of quantum machine learning have promoted the idea of incorporating physical symmetries in the structure of quantum circuits. We provide a novel structure of QNN that is exactly invariant to both rotations and permutations.
  arXiv  Detail & Related papers  (2024-05-18T02:40:30Z)
• Symmetric derivatives of parametrized quantum circuits [0.0]
  We introduce the concept of projected derivatives of parametrized quantum circuits. We show that the covariant derivative gives rise to the quantum Fisher information and quantum natural gradient.
  arXiv  Detail & Related papers  (2023-12-11T19:00:00Z)
• Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information [0.9208007322096533]
  We study representation theory of the partially transposed permutation matrix algebra. We show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels. We derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol.
  arXiv  Detail & Related papers  (2023-10-03T17:55:10Z)
• A Bottom-up Approach to Constructing Symmetric Variational Quantum Circuits [0.0]
  We show how to construct symmetric quantum circuits using representation theory. We show how to derive the particle-conserving exchange gates, which are commonly used in constructing hardware-efficient quantum circuits.
  arXiv  Detail & Related papers  (2023-08-17T10:57:15Z)
• Order-invariant two-photon quantum correlations in PT-symmetric interferometers [62.997667081978825]
  Multiphoton correlations in linear photonic quantum networks are governed by matrix permanents. We show that the overall multiphoton behavior of a network from its individual building blocks typically defies intuition. Our results underline new ways in which quantum correlations may be preserved in counterintuitive ways even in small-scale non-Hermitian networks.
  arXiv  Detail & Related papers  (2023-02-23T09:43:49Z)
• A Complete Equational Theory for Quantum Circuits [58.720142291102135]
  We introduce the first complete equational theory for quantum circuits. Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
  arXiv  Detail & Related papers  (2022-06-21T17:56:31Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Rectification induced by geometry in two-dimensional quantum spin lattices [58.720142291102135]
  We address the role of geometrical asymmetry in the occurrence of spin rectification in two-dimensional quantum spin chains. We show that geometrical asymmetry, along with inhomogeneous magnetic fields, can induce spin current rectification even in the XX model.
  arXiv  Detail & Related papers  (2020-12-02T18:10:02Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.