Related papers: On Groups in the Qubit Clifford Hierarchy

On Groups in the Qubit Clifford Hierarchy

URL: http://arxiv.org/abs/2212.05398v2
Date: Fri, 7 Jun 2024 17:03:58 GMT
Title: On Groups in the Qubit Clifford Hierarchy
Authors: Jonas T. Anderson,
Abstract summary: 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.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Here we study the unitary groups that can be constructed using elements from the qubit Clifford Hierarchy. We first provide a necessary and sufficient canonical form that semi-Clifford and generalized semi-Clifford elements must satisfy to be in the Clifford Hierarchy. Then we classify the groups that can be formed from such elements. Up to Clifford conjugation, we classify all such groups that can be constructed using generalized semi-Clifford elements in the Clifford Hierarchy. We discuss a possible minor exception to this classification in the appendix. This may not be a full classification of all groups in the qubit Clifford Hierarchy as it is not currently known if all elements in the Clifford Hierarchy must be generalized semi-Clifford. In addition to the diagonal gate groups found by Cui et al., we show that many non-isomorphic (to the diagonal gate groups) generalized symmetric groups are also contained in the Clifford Hierarchy. Finally, as an application of this classification, we examine restrictions on transversal gates given by the structure of the groups enumerated herein which may be of independent interest.

Related papers

Permutation gates in the third level of the Clifford hierarchy [2.3010366779218483]
We study permutations in the hierarchy: gates which permute the $2n$ basis states. We prove that any permutation gate in the third level, not necessarily semi-Clifford, must be a product of Toffoli gates.
arXiv Detail & Related papers (2024-10-15T17:46:49Z)
Classification of the Subgroups of the Two-Qubit Clifford Group [0.0]
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.
arXiv Detail & Related papers (2024-09-22T23:21:55Z)
Clifford circuits over non-cyclic abelian groups [0.0]
We show that every Clifford circuit can be efficiently classically simulated. We additionally provide circuits for a universal quantum computing scheme based on local two-qudit Clifford gates and magic states.
arXiv Detail & Related papers (2024-02-21T18:26:25Z)
Low-depth Clifford circuits approximately solve MaxCut [44.99833362998488]
We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. Our algorithm finds an approximate solution of MaxCut on an $N$-vertex graph by building a depth $O(N)$ Clifford circuit.
arXiv Detail & Related papers (2023-10-23T15:20:03Z)
Characterising semi-Clifford gates using algebraic sets [0.0]
We study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of nearly diagonal' semi-Clifford gates. Semi-Clifford gates are important because they can be implemented with far more efficient use of these resource states.
arXiv Detail & Related papers (2023-09-26T18:41:57Z)
Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model [79.46465138631592]
We devise an efficient algorithm that recovers clusters using the observed labels. We present Instance-Adaptive Clustering (IAC), the first algorithm whose performance matches these lower bounds both in expectation and with high probability.
arXiv Detail & Related papers (2023-06-18T08:46:06Z)
Generators and Relations for 3-Qubit Clifford+CS Operators [0.0]
We give a presentation by generators and relations of the group of 3-qubit Clifford+CS operators. We show that the 3-qubit Clifford+CS group, which is of course infinite, is the amalgamated product of three finite subgroups.
arXiv Detail & Related papers (2023-06-14T14:23:46Z)
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)
Generalized Clustering and Multi-Manifold Learning with Geometric Structure Preservation [47.65743823937763]
We propose a novel Generalized Clustering and Multi-manifold Learning (GCML) framework with geometric structure preservation for generalized data. In the proposed framework, manifold clustering is done in the latent space guided by a clustering loss. To overcome the problem that the clustering-oriented loss may deteriorate the geometric structure of the latent space, an isometric loss is proposed for preserving intra-manifold structure locally and a ranking loss for inter-manifold structure globally.
arXiv Detail & Related papers (2020-09-21T03:04:57Z)
Cautious Active Clustering [79.23797234241471]
We consider the problem of classification of points sampled from an unknown probability measure on a Euclidean space. Our approach is to consider the unknown probability measure as a convex combination of the conditional probabilities for each class.
arXiv Detail & Related papers (2020-08-03T23:47:31Z)
Scalable Hierarchical Clustering with Tree Grafting [66.68869706310208]
Grinch is a new algorithm for large-scale, non-greedy hierarchical clustering with general linkage functions. Grinch is motivated by a new notion of separability for clustering with linkage functions.
arXiv Detail & Related papers (2019-12-31T20:56:15Z)

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