Related papers: On Clifford groups in quantum computing
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…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
The non commuting matrix elements of matrices from quantum group $GL_q(2;C)$ with $q\equiv \omega $ being the $n$-th root of unity are given a representation as operators in Hilbert space with help of $C_4^{(n)}$ generalized Clifford…
The Clifford defect is a rational number associated to the Weierstrass semigroup at a given point of an algebraic curve. It describes the error-correcting capability of the so-called Modified Algorithm for decoding the corresponding…
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative…
Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be…
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…
The performance of quantum algorithms for ground-state energy estimation is directly impacted by the quality of the initial state, where quality is traditionally defined in terms of the overlap of the input state with the target state. An…
Starting with an explicit framework for designing logical Clifford circuits for CSS codes, we construct logical gates for Hypergraph Product Codes. We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which…
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…
Peres/Mermin arguments about no-hidden variables in quantum mechanics are used for displaying a pair (R, S) of entangling Clifford quantum gates, acting on two qubits. From them, a natural unitary representation of Coxeter/Weyl groups W(D5)…
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…
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…
In "A note on generalized Clifford algebras and representations" (Caenepeel, S.; Van Oystaeyen, F., Comm. Algebra 17 (1989) no. 1, 93--102.) generalized Clifford algebras were introduced via Clifford representations; these correspond to…
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…
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…
In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…
We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of…
Learning an unknown quantum process is a central task for validation of the functioning of near-term devices. The task is generally hard, requiring exponentially many measurements if no prior assumptions are made on the process. However, an…
The first example of a quantum group was introduced by P.~Kulish and N.~Reshetikhin. In their paper "Quantum linear problem for the sine-Gordon equation and higher representations" published in Zap. Nauchn. Sem. LOMI, 1981, Volume 101…