相关论文: Characterization of permutation gates in the third…
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…
The Clifford Hierarchy has been a central topic in quantum computation due to its strong connections with fault-tolerant quantum computation, magic state distillation, and more. Nevertheless, only sections of the hierarchy are fully…
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The groups of Pauli and Clifford gates constitute the…
The Clifford hierarchy is a set of gates that appears in the theory of fault-tolerant quantum computation, but its precise structure remains elusive. We give a complete characterization of the diagonal gates in the Clifford hierarchy for…
In this paper we prove a collection of results on the structure of permutations in the Clifford Hierarchy. First, we leverage results from the cryptography literature on affine equivalence classes of 4-bit permutations which we use to find…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
Motivated by their central role in fault-tolerant quantum computation, we study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of `nearly diagonal' semi-Clifford gates. The Clifford hierarchy…
The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing sequence of sets of quantum gates crucial to the gate teleportation model for fault-tolerant quantum computation. Gates in the hierarchy can be…
Efficient decomposition of permutation unitaries is vital as they frequently appear in quantum computing. In this paper, we identify the key properties that impact the decomposition process of permutation unitaries. Then, we classify these…
Clifford gates and transformations, which map products of elementary Pauli or Majorana operators to other such products, are foundational in quantum computing, underpinning the stabilizer formalism, error-correcting codes, magic state…
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,…
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and 'nearly diagonal' semi-Clifford gates are particularly important:…
It is known that the matrices that can be exactly represented by a multiqubit circuit over the Toffoli+Hadamard, Clifford+$T$, or, more generally, Clifford-cyclotomic gate set are precisely the unitary matrices with entries in the ring…
We introduce the magic hierarchy, a quantum circuit model that alternates between arbitrary-sized Clifford circuits and constant-depth circuits with two-qubit gates ($\textsf{QNC}^0$). This model unifies existing circuit models, such as…
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…
Non-Clifford gates, used to generate quantum magic, are essential for universal quantum computation. We show that non-Clifford gates arise naturally from path integrals in topological quantum field theories, where their magic-generating…
The role of permutation gates for universal quantum computing is investigated. The \lq magic' of computation is clarified in the permutation gates, their eigenstates, the Wootters discrete Wigner function and state-dependent contextuality…
Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and…
We examine the following problem: given a collection of Clifford gates, describe the set of unitaries generated by circuits composed of those gates. Specifically, we allow the standard circuit operations of composition and tensor product,…
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar measure over the unitary group -a property that is essential…