相关论文: Quantum Gates and Clifford Algebras

The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…

An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…

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…

This paper investigates centralizers and twisted centralizers in degenerate and non-degenerate Clifford (geometric) algebras. We provide an explicit form of the centralizers and twisted centralizers of the subspaces of fixed grades,…

This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…

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…

Spinor structure is understood as a totality of tensor products of biquaternion algebras, and the each tensor product is associated with an irreducible representation of the Lorentz group. A so-defined algebraic structure allows one to…

This example of Clifford algebras calculations uses GiNaC (http://www.ginac.de/) library, which includes a support for generic Clifford algebra starting from version~1.3.0. Both symbolic and numeric calculation are possible and can be…

Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…

A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…

We revisit the Pauli-Clifford connection to introduce a real, grade-preserving algebraic framework for $n$-qubit quantum computation based on the tensor product $C\ell_{2,0}(\mathbb{R})^{\otimes n}$. In this setting, the bivector $J =…

Classification of quantum spinor fields according to quantum bilinear covariants is introduced in a context of quantum Clifford algebras on Minkowski spacetime. Once the bilinear covariants are expressed in terms of algebraic spinor fields,…

Clifford geometric algebras of multivectors are treated in detail. These algebras are build over a graded space and exhibit a grading or multivector structure. The careful study of the endomorphisms of this space makes it clear, that…

This is a simple way rigorously to construct Grassmann, Clifford and Geometric Algebras, allowing degenerate bilinear forms, infinite dimension, using fields or certain modules (characteristic 2 with limitation) - and characterize the…

A general theory of quantum spinor structures on quantum spaces is presented, within the conceptual framework of the formalism of quantum principal bundles. Quantum analogs of all basic objects of the classical theory are constructed and…

A classification of idempotents in Clifford algebras C(p,q) is presented. It is shown that using isomorphisms between Clifford algebras C(p,q) and appropriate matrix rings, it is possible to classify idempotents in any Clifford algebra into…

We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. In particular, we derive formulas for evaluation, composition, and inversion. Our results…

We show that any $n$-qubit Clifford unitary can be implemented using at most $2n$ multi-qubit joint measurements. All the multi-qubit joint measurements used for implementing the Clifford unitary can be chosen to form at most two sets of…

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 present new formulas, which represent commutators and anticommutators of Clifford algebra elements as sums of elements of different ranks. Using these formulas we consider subalgebras of Lie algebras of pseudounitary…