Related papers: Quantum gates and quantum algorithms with Clifford…
Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, d-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological…
Our goal in this paper is to construct optimal topological generators for compact unitary Lie groups, extending the work of a letter of Sarnak and arXiv:1704.02106 on golden and super-golden gates to higher dimensions. To do so we consider…
Quantum computing has potential to provide exponential speedups over classical computing for many important applications. However, today's quantum computers are in their early stages, and hardware quality issues hinder the scale of program…
In these notes we introduce the Clifford algebra of a quadratic space using techniques from universal algebra and algebraic theory of quadratic forms. We also define the Clifford, Pin and Spin groups associated to the algebra, and study how…
It shown that if a vector space carries commuting actions of two Clifford algebras, then the quadratic monomials using generators from either Clifford algebra determine a spinor representation of an orthogonal Lie algebra. Examples of this…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…
We show that all quantum gates which could be implemented by braiding of Ising anyons in the Ising topological quantum computer preserve the n-qubit Pauli group. Analyzing the structure of the Pauli group's centralizer, also known as the…
A positive integer is expressed as a sum of squares of positive integers in a unique way applying a special technique. The expression, thus obtained is resolved into two factors using the concept of the Clifford algebra. This technique is…
Lie algebroids provide a natural medium to discuss classical systems, however, quantum systems have not been considered. In aim of this paper is to attempt to rectify this situation. Lie algebroids are reviewed and their use in classical…
In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…
Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- permit efficient computation. They provide invaluable tools…
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…
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…
The concept of quantum representation of finite groups (QRFG) has been a fundamental aspect of quantum computing for quite some time, playing a role in every corner, from elementary quantum logic gates to the famous Shor's and Grover's…
We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form…
Characterising quantum processes is a key task in and constitutes a challenge for the development of quantum technologies, especially at the noisy intermediate scale of today's devices. One method for characterising processes is randomised…
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…
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford…
Rig groupoids provide a semantic model of \PiLang, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of…
Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…