Related papers: Clifford circuits over non-cyclic abelian groups
These are lecture notes for a course on the theory of Clifford algebras, with special emphasis on their wide range of applications in mathematics and physics. Clifford algebra is introduced both through a conventional tensor algebra…
Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics, while remaining analytically tractable through probabilistic methods. Motivated by an interest in…
The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such…
We study Hamilton circuits of the Cayley graphs of the Weyl groupoids of the generalized quantum groups, or the quantum double of the Nichols algebras of diagonal-type, with finite root systems. We prove the existence of a Hamilton circuit…
Some quantum algebras build from deformed oscillator algebras may be described in terms of a particular case of extended umbral calculus. We give here an example of a specific relation between such certain quantum algebras and generalized…
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and random compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into…
We propose and simulate the performance of a set of fault-tolerant and constant-depth logical gates on 2D toric codes. This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full…
Acyclic anyon models are non-abelian anyon models for which thermal anyon errors can be corrected. In this note, we characterize acyclic anyon models and raise the question if the restriction to acyclic anyon models is a deficiency of the…
A generalized Clifford manifold is proposed in which there are coordinates not only for the basis vector generators, but for each element of the Clifford group, including the identity scalar. These new quantities are physically interpreted…
It is known that every (single-qudit) Clifford operator maps the full set of generalized Pauli matrices (GPMs) to itself under unitary conjugation, which is an important quantum operation and plays a crucial role in quantum computation and…
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…
We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable…
Clifford algebras are used for constructing spin groups, and are therefore of particular importance in the theory of quantum mechanics. But the spin group is not the only subgroup of the Clifford algebra. An algebraist's perspective on…
We perform a complete classification of all 56 subgroups of the two-qubit Clifford group containing the two-qubit Pauli group. We provide generators for these groups using gates familiar to the quantum information community and we reference…
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 make the case that Clifford algebra is the natural framework for root systems and reflection groups, as well as related groups such as the conformal and modular groups: The metric that exists on these spaces can always be…
We propose an efficient classical algorithm to estimate the Neural Tangent Kernel (NTK) associated with a broad class of quantum neural networks. These networks consist of arbitrary unitary operators belonging to the Clifford group…
Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states -- the secret sauce to…
We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each…
Using condition of relativistic invariance, group theory and Clifford algebra the component Lorentz invariance generalized Dirac equation for a particle with arbitrary mass and spin is suggested, where In the case of half-integral spin…