Un-Weyl-ing the Clifford Hierarchy

• URL: http://arxiv.org/abs/2006.14040v4
• Date: Wed, 9 Dec 2020 18:24:00 GMT
• Title: Un-Weyl-ing the Clifford Hierarchy
• Authors: Tefjol Pllaha, Narayanan Rengaswamy, Olav Tirkkonen, Robert Calderbank
• Abstract summary: We study the structure of the second and third levels of the Clifford hierarchy. We show that every third level unitary commutes with at least one Pauli matrix. We discuss potential applications in quantum error correction and the design of flag gadgets.
• Score: 5.28387934064129
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The teleportation model of quantum computation introduced by Gottesman and Chuang (1999) motivated the development of the Clifford hierarchy. Despite its intrinsic value for quantum computing, the widespread use of magic state distillation, which is closely related to this model, emphasizes the importance of comprehending the hierarchy. There is currently a limited understanding of the structure of this hierarchy, apart from the case of diagonal unitaries (Cui et al., 2017; Rengaswamy et al. 2019). We explore the structure of the second and third levels of the hierarchy, the first level being the ubiquitous Pauli group, via the Weyl (i.e., Pauli) expansion of unitaries at these levels. In particular, we characterize the support of the standard Clifford operations on the Pauli group. Since conjugation of a Pauli by a third level unitary produces traceless Hermitian Cliffords, we characterize their Pauli support as well. Semi-Clifford unitaries are known to have ancilla savings in the teleportation model, and we explore their Pauli support via symplectic transvections. Finally, we show that, up to multiplication by a Clifford, every third level unitary commutes with at least one Pauli matrix. This can be used inductively to show that, up to a multiplication by a Clifford, every third level unitary is supported on a maximal commutative subgroup of the Pauli group. Additionally, it can be easily seen that the latter implies the generalized semi-Clifford conjecture, proven by Beigi and Shor (2010). We discuss potential applications in quantum error correction and the design of flag gadgets.

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)
• Weyl channels for multipartite systems [42.37986459997699]
  Quantum channels describe unitary and non-unitary evolution of quantum systems. We show that these channels are completely characterized by elements drawn of finite cyclic groups.
  arXiv  Detail & Related papers  (2023-10-17T02:45:47Z)
• 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)
• 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)
• Growth of entanglement of generic states under dual-unitary dynamics [77.34726150561087]
  Dual-unitary circuits are a class of locally-interacting quantum many-body systems. In particular, they admit a class of solvable" initial states for which, in the thermodynamic limit, one can access the full non-equilibrium dynamics. We show that in this case the entanglement increment during a time step is sub-maximal for finite times, however, it approaches the maximal value in the infinite-time limit.
  arXiv  Detail & Related papers  (2022-07-29T18:20:09Z)
• Formal relation between Pegg-Barnett and Paul quantum phase frameworks [0.0]
  We show that the probability distribution of phase in the Paul formalism follows exactly from the Pegg-Barnett formalism. Our findings suggest that the Paul framework may be viewed as a semi-classical limit of the Pegg-Barnett approach.
  arXiv  Detail & Related papers  (2022-05-19T11:27:56Z)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
  We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof. We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
  arXiv  Detail & Related papers  (2022-03-30T18:00:00Z)
• Classical shadows with Pauli-invariant unitary ensembles [0.0]
  We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator. Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
  arXiv  Detail & Related papers  (2022-02-07T15:06:30Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Decomposition of Clifford Gates [3.7900158137749322]
  We provide a fast algorithm that decomposes any Clifford gate as a $textitminimal$ product of Clifford transvections. The algorithm can be directly used for finding all Pauli matrices that commute with any given Clifford gate.
  arXiv  Detail & Related papers  (2021-02-05T10:32:09Z)

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.