Permutation gates in the third level of the Clifford hierarchy

• URL: http://arxiv.org/abs/2410.11818v1
• Date: Tue, 15 Oct 2024 17:46:49 GMT
• Title: Permutation gates in the third level of the Clifford hierarchy
• Authors: Zhiyang He, Luke Robitaille, Xinyu Tan,
• Abstract summary: 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.
• Score: 2.3010366779218483
• License:
• Abstract: The Clifford hierarchy is a fundamental structure in quantum computation, classifying unitary operators based on their commutation relations with the Pauli group. Despite its significance, the mathematical structure of the hierarchy is not well understood at the third level and higher. In this work, we study permutations in the hierarchy: gates which permute the $2^n$ basis states. We fully characterize all the semi-Clifford permutation gates. Moreover, we prove that any permutation gate in the third level, not necessarily semi-Clifford, must be a product of Toffoli gates in what we define as staircase form, up to left and right multiplications of Clifford permutations. Finally, we show that the smallest number of qubits for which there exists a non-semi-Clifford permutation in the third level is $7$.

Related papers

• Matchgate hierarchy: A Clifford-like hierarchy for deterministic gate teleportation in matchgate circuits [0.0]
  The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing universality of sets of quantum gates. We propose a gate teleportation protocol and the matchgate hierarchy in the context of matchgate circuits.
  arXiv  Detail & Related papers  (2024-10-02T18:00:01Z)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• Multi-qutrit exact synthesis [0.0]
  We present an exact synthesis algorithm for qutrit unitaries in $mathcalU_3n(mathbbZ[/3,e2pi i/3])$ over the Clifford$+T$ gate set with at most one ancilla. This, in particular, gives an exact synthesis algorithm of single-qutrit Clifford$+mathcalD$ over the multi-qutrit Clifford$+T$ gate set with at most two ancillas.
  arXiv  Detail & Related papers  (2024-05-13T19:48:10Z)
• Mutual transformations of arbitrary ternary qubit trees by Clifford gates [55.2480439325792]
  It is shown that ternary qubit trees with the same number of nodes can be transformed by the naturally defined sequence of Clifford gates into each other or into standard representation as 1D chain corresponding to Jordan-Wigner transform.
  arXiv  Detail & Related papers  (2024-04-25T15:54:32Z)
• 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)
• Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
  An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
  arXiv  Detail & Related papers  (2023-09-05T09:05:27Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• 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)
• Efficient quantum gate teleportation in higher dimensions [0.0]
  The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. We leverage the Stone-von Neumann theorem and symplectic formalism of qudit stabiliser mechanics towards extending results of Zeng-Cheng-Chuang (2008) and Beigi-Shor (2010) to higher dimensions in a uniform manner. We prove that every third level gate of one qudit (of any prime dimension) and of two qutrits can be implemented efficiently.
  arXiv  Detail & Related papers  (2020-10-30T22:25:22Z)
• 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)
• Un-Weyl-ing the Clifford Hierarchy [5.28387934064129]
  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.
  arXiv  Detail & Related papers  (2020-06-24T20:48:44Z)

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.