Related papers: Climbing the Clifford Hierarchy
We generalize quaternion and Clifford Fourier transforms to general two-sided Clifford Fourier transforms (CFT), and study their properties (from linearity to convolution). Two general \textit{multivector square roots} $\in \cl{p,q}$…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
We recall the notions of Clifford and Clifford-like parallelisms in a $3$-dimensional projective double space. In a previous paper the authors proved that the linear part of the full automorphism group of a Clifford parallelism is the same…
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 complexity of a quantum gate, defined as the minimal number of elementary gates to build it, is an important concept in quantum information and computation. It is shown recently that the complexity of quantum gates built from random…
We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-qubit measurements in any basis. Our results apply to…
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum…
By the Gottesman-Knill Theorem, the outcome probabilities of Clifford circuits can be computed efficiently. We present an alternative proof of this result for quopit Clifford circuits (i.e., Clifford circuits on collections of $p$-level…
In this review, an overview is given of several recent generalizations of the Fourier transform, related to either the Lie algebra sl_2 or the Lie superalgebra osp(1|2). In the former case, one obtains scalar generalizations of the Fourier…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum…
Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider…
It is the prevailing belief that quantum error correcting techniques will be required to build a utility-scale quantum computer able to perform computations that are out of reach of classical computers. The QECCs that have been most…
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…
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…
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum circuits that can be simulated in polynomial time but still…
We suggest Clifford algebra as a useful simplifying language for present quantum dynamics. Clifford algebras arise from representations of the permutation groups as they arise from representations of the rotation groups. Aggregates using…
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…
Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…