The Clifford theory of the $n$-qubit Clifford group

• URL: http://arxiv.org/abs/2307.05810v1
• Date: Tue, 11 Jul 2023 21:21:31 GMT
• Title: The Clifford theory of the $n$-qubit Clifford group
• Authors: Kieran Mastel
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The $n$-qubit Pauli group and its normalizer the $n$-qubit Clifford group have applications in quantum error correction and device characterization. Recent applications have made use of the representation theory of the Clifford group. We apply the tools of (the coincidentally named) Clifford theory to examine the representation theory of the Clifford group using the much simpler representation theory of the Pauli group. We find an unexpected correspondence between irreducible characters of the $n$-qubit Clifford group and those of the $(n+1)$-qubit Clifford group.

Related papers

• Clifford Dressed Time-Dependent Variational Principle [39.58317527488534]
  We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) By leveraging the Clifford group, we introduce a Clifford dressed single-site 1-TDVP scheme. We validate the new algorithm numerically using various quantum many-body models, including both integrable and non-integrable systems.
  arXiv  Detail & Related papers  (2024-07-01T18:04:25Z)
• 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)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Geometric Clifford Algebra Networks [53.456211342585824]
  We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems. GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
  arXiv  Detail & Related papers  (2023-02-13T18:48:33Z)
• Clifford groups are not always 2-designs [0.0]
  We prove that when $d$ is not prime the Clifford group is not a group unitary $2$-design. We also clarify the structure of projective group unitary $2$-designs.
  arXiv  Detail & Related papers  (2021-08-09T17:37:59Z)
• Unitary Subgroup Testing [8.282602586225831]
  We study problems with the group $mathcalG$ as the trivial subgroup (i.e. identity testing) or the Pauli or Clifford group and their $q$-ary extension. Our main result is an equivalence between Pauli testing, Clifford testing and Identity testing.
  arXiv  Detail & Related papers  (2021-04-08T08:12:25Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)
• 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)
• Towards Clarifying the Theory of the Deconfounder [47.442102892407405]
  This paper studies multiple causal inference and proposes the deconfounder algorithm. Several refinements have been suggested around the theory of the deconfounder.
  arXiv  Detail & Related papers  (2020-03-10T19:59:03Z)
• Efficient unitary designs with a system-size independent number of non-Clifford gates [2.387952453171487]
  It takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group. Unitary $t-designs mimic the Haar-$-th moments. We derive novel bounds on the convergence time of random Clifford circuits to the $t$-th moment of the uniform distribution on the Clifford group.
  arXiv  Detail & Related papers  (2020-02-21T19:41:07Z)

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.