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
- The Structure of the Majorana Clifford Group [0.0]
In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits)
A crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system in which the fundamental degrees of freedom are fermionic.
We prove that the subgroup of parity-preserving fermionic Cliffords can be represented by the group over the binary field $mathbbF$, and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code.
arXiv Detail & Related papers (2024-07-16T02:20:14Z) - 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) - 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) - Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM)
We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
arXiv Detail & Related papers (2021-05-11T03:39:08Z) - 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) - 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) - Hadamard-free circuits expose the structure of the Clifford group [9.480212602202517]
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols.
We show that any Clifford operator can be uniquely written in the canonical form $F_HSF$.
A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group.
arXiv Detail & Related papers (2020-03-20T17:51:36Z) - Coresets for the Nearest-Neighbor Rule [78.15296214629433]
Nearest-neighbor condensation deals with finding a subset $R subseteq P$.
This paper introduces the concept of coresets for nearest-neighbor classification.
We propose quadratic-time approximation algorithms with provable upper-bounds on the size of their selected subsets.
arXiv Detail & Related papers (2020-02-16T19:00:48Z) - 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.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.