Classification of the Subgroups of the Two-Qubit Clifford Group

• URL: http://arxiv.org/abs/2409.14624v1
• Date: Sun, 22 Sep 2024 23:21:55 GMT
• Title: Classification of the Subgroups of the Two-Qubit Clifford Group
• Authors: Eric Kubischta, Ian Teixeira,
• Abstract summary: We perform a complete classification of all 56 subgroups of the two-qubit Clifford group containing the two-qubit Pauli group. We reference these groups against the group libraries provided in GAP. We also list several families of groups in higher levels of the two-qubit Clifford hierarchy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We perform a complete classification of all 56 subgroups of the two-qubit Clifford group containing the two-qubit Pauli group. We provide generators for these groups using gates familiar to the quantum information community and we reference these groups against the group libraries provided in GAP. We also list several families of groups in higher levels of the two-qubit Clifford hierarchy.

Related papers

• AlignGroup: Learning and Aligning Group Consensus with Member Preferences for Group Recommendation [7.8148534870343225]
  Group activities are important behaviors in human society, providing personalized recommendations for groups is referred to as the group recommendation task. We propose a novel group recommendation method AlignGroup, which focuses on both group consensus and individual preferences of group members to infer the group decision-making.
  arXiv  Detail & Related papers  (2024-09-04T10:03:09Z)
• Contracting Self-similar Groups in Group-Based Cryptography [0.0]
  We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP) The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be non-linear. We discuss benefits and drawbacks of using these groups in group-based cryptography and provide computational analysis of variants of the length-based attack on SCSP.
  arXiv  Detail & Related papers  (2024-08-26T15:30:11Z)
• The Clifford theory of the $n$-qubit Clifford group [0.0]
  Recent applications have made use of the representation theory of the Clifford group. We find an unexpected correspondence between irreducible characters of the $n$-qubit Clifford group and those of the $(n+1)$-qubit Clifford group.
  arXiv  Detail & Related papers  (2023-07-11T21:21:31Z)
• CLUSTSEG: Clustering for Universal Segmentation [56.58677563046506]
  CLUSTSEG is a general, transformer-based framework for image segmentation. It tackles different image segmentation tasks (i.e., superpixel, semantic, instance, and panoptic) through a unified neural clustering scheme.
  arXiv  Detail & Related papers  (2023-05-03T15:31:16Z)
• On Groups in the Qubit Clifford Hierarchy [0.0]
  unitary groups can be constructed using elements from the qubit Clifford Hierarchy. We classify all such groups that can be constructed using generalized semi-Clifford elements in the Clifford Hierarchy.
  arXiv  Detail & Related papers  (2022-12-11T03:37:19Z)
• Multiple Fairness and Cardinality constraints for Students-Topics Grouping Problem [14.051419173519308]
  Group work is a prevalent activity in educational settings, where students are often divided into topic-specific groups based on their preferences. We introduce the multi-fair capacitated (MFC) grouping problem that fairly partitions students into non-overlapping groups. We propose two approaches: a method and a knapsack-based method to obtain the grouping.
  arXiv  Detail & Related papers  (2022-06-20T17:06:10Z)
• DeepCluE: Enhanced Image Clustering via Multi-layer Ensembles in Deep Neural Networks [53.88811980967342]
  This paper presents a Deep Clustering via Ensembles (DeepCluE) approach. It bridges the gap between deep clustering and ensemble clustering by harnessing the power of multiple layers in deep neural networks. Experimental results on six image datasets confirm the advantages of DeepCluE over the state-of-the-art deep clustering approaches.
  arXiv  Detail & Related papers  (2022-06-01T09:51:38Z)
• Towards Group Robustness in the presence of Partial Group Labels [61.33713547766866]
  spurious correlations between input samples and the target labels wrongly direct the neural network predictions. We propose an algorithm that optimize for the worst-off group assignments from a constraint set. We show improvements in the minority group's performance while preserving overall aggregate accuracy across groups.
  arXiv  Detail & Related papers  (2022-01-10T22:04:48Z)
• 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)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)
• General Partial Label Learning via Dual Bipartite Graph Autoencoder [81.78871072599607]
  We formulate a practical yet challenging problem: General Partial Label Learning (GPLL) We propose a novel graph autoencoder called Dual Bipartite Graph Autoencoder (DB-GAE)
  arXiv  Detail & Related papers  (2020-01-05T19:00:41Z)

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.