Constructive quantum mechanics based on finite groups

• URL: http://arxiv.org/abs/2409.18159v2
• Date: Mon, 30 Sep 2024 15:27:50 GMT
• Title: Constructive quantum mechanics based on finite groups
• Authors: V. V. Kornyak,
• Abstract summary: A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A formulation of quantum mechanics based on replacing the general unitary group by finite groups is considered. To solve problems arising in the context of this formulation, we use computer algebra and computational group theory methods.

Related papers

• On the quantum time complexity of divide and conquer [42.7410400783548]
  We study the time complexity of quantum divide and conquer algorithms for classical problems. We apply these theorems to an array of problems involving strings, integers, and geometric objects.
  arXiv  Detail & Related papers  (2023-11-28T01:06:03Z)
• Equivariant simplicial distributions and quantum contextuality [0.0]
  We introduce an equivariant version of contextuality with respect to a symmetry group, which comes with natural applications to quantum theory. In the equivariant setting, we construct cohomology classes that can detect contextuality.
  arXiv  Detail & Related papers  (2023-10-27T13:25:46Z)
• Quantum representation of finite groups [0.0]
  The concept of quantum representation of finite groups (QRFG) has been a fundamental aspect of quantum computing for quite some time. We provide a formal definition of this concept using both group theory and differential geometry. Our work proves the existence of a quantum representation for any finite group and outlines two methods for translating each generator of the group into a quantum circuit.
  arXiv  Detail & Related papers  (2022-09-29T18:01:03Z)
• Krylov complexity and orthogonal polynomials [30.445201832698192]
  Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos method of recursion.
  arXiv  Detail & Related papers  (2022-05-25T14:40:54Z)
• On the Universality and Membership problems for quantum gates [0.0]
  We study the Universality and Membership Problems for gate sets consisting of a finite number of quantum gates. Our approach relies on the techniques from compact Lie groups theory.
  arXiv  Detail & Related papers  (2021-10-08T15:53:09Z)
• Quantum algorithms for group convolution, cross-correlation, and equivariant transformations [9.134244356393665]
  Group convolutions and cross-correlations are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient quantum algorithms for performing linear group convolutions and cross-correlations on data stored as quantum states.
  arXiv  Detail & Related papers  (2021-09-23T12:21:31Z)
• The dihedral hidden subgroup problem [0.0]
  We give an exposition of the hidden problem for dihedral groups from the point of view of the standard subgroup quantum algorithm for finite groups. We explain a new connection between the dihedral coset problem and cloning of quantum states.
  arXiv  Detail & Related papers  (2021-06-18T04:19:10Z)
• A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups [115.58550697886987]
  We provide a completely general algorithm for solving for the equivariant layers of matrix groups. In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before. Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
  arXiv  Detail & Related papers  (2021-04-19T17:21:54Z)
• Constraints on Maximal Entanglement Under Groups of Permutations [73.21730086814223]
  Sets of entanglements are inherently equal, lying in the same orbit under the group action. We introduce new, generalized relationships for the maxima of those entanglement by exploiting the normalizer and normal subgroups of the physical symmetry group.
  arXiv  Detail & Related papers  (2020-11-30T02:21:22Z)
• A Unified Approach to Synchronization Problems over Subgroups of the Orthogonal Group [29.714239628405515]
  We consider the class of synchronization problems which the group is a closed subgroup. We propose a unified approach for solving this class of problems. We show that our approach outperforms existing approaches.
  arXiv  Detail & Related papers  (2020-09-16T07:25:50Z)
• Quantum computation of thermal averages in the presence of a sign problem [45.82374977939355]
  We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system. We show how quantum algorithms completely solve the problem, and discuss how this can apply to more complex systems of physical interest.
  arXiv  Detail & Related papers  (2020-01-15T14:01:11Z)

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.