Related papers: Un-Weyl-ing the Clifford Hierarchy
The Pauli measurements (the measurements that can be performed with Clifford operators followed by measurement in the computational basis) are a fundamental object in quantum information. It is well-known that there is no assignment of…
We introduce the Clifford entropy, a measure of how close an arbitrary unitary is to a Clifford unitary, which generalizes the stabilizer entropy for states. We show that this quantity vanishes if and only if a unitary is Clifford, is…
The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress…
We provide a recursively defined sequence of flag circuits which will detect logical errors induced by non-fault-tolerant $R_{\overline{Z}}(\frac{\pi}{2^l})$ gates on CSS codes with a fault distance of two. As applications, we give a family…
Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the…
For the complex Clifford algebra Cl(p,q) of dimension n=p+q we define a Hermitian scalar product. This scalar product depends on the signature (p,q) of Clifford algebra. So, we arrive at unitary spaces on Clifford algebras. With the aid of…
Unitary t-designs are some of the most versatile tools in quantum information theory. Their applications range from randomized benchmarking and shadow tomography, to more fundamental ones such as emulating quantum chaos and establishing…
Is there more to Dirac's gamma matrices than meets the eye? It turns out that gamma zero can be factorized into a product of three operators. This revelation facilitates the expansion of Dirac's space-time algebra to Clifford algebra…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
We introduce a hierarchical algorithm for identifying the largest Pauli coefficients of an unknown $n$-qubit quantum state. The algorithm traverses a prefix-based tree whose nodes represent partial sums of squared Pauli coefficients, always…
{\sc CLIFFORD} is a Maple package for computations in Clifford algebras $\cl (B)$ of an arbitrary symbolic or numeric bilinear form B. In particular, B may have a non-trivial antisymmetric part. It is well known that the symmetric part g of…
At higher energies the present complex quantum theory with its unitary group might expand into a real quantum theory with an orthogonal group, broken by an approximate $i$ operator at lower energies. Implementing this possibility requires a…
Variational Quantum Algorithms are promising candidates for near-term quantum computing, yet they face scalability challenges due to barren plateaus, where gradients vanish exponentially relative to system size. Recent conjectures suggest…
Verification of quantum computations is crucial as experiments advance toward fault-tolerant quantum computing. Yet, no efficient protocol exists for certifying states generated in the Magic-State Injection model -- the foundation of…
The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, we present an introduction to the main…
In commuting parametric quantum circuits, the Fourier series of the pairwise fidelity can be expressed as the characteristic function of random variables. Furthermore, expressiveness can be cast as the recurrence probability of a random…
We construct an explicit algebraic realisation of three fermion generations within a single Clifford algebra, transforming under the full Standard Model $SU(3)_C\times SU(2)_L\times U(1)_Y$ gauge group, in which an intrinsic $S_3$ family…
In this work we explore the structure of Clifford algebras and the representations of the algebraic spinors in quantum information theory. Initially we present an general formulation through elements of left minimal ideals in tensor…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
We develop a Clifford algebra approach for 3D Ising model. By utilizing some mathematical facts of the direct product of matrices and their trace, we expand the dimension of the transfer matrices V of the 3D Ising system by adding unit…