Generators and relations for U_n(ℤ [1/2, i])

05/28/2021
by   Xiaoning Bian, et al.
0

Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, ω†H and S. All of these gates have matrix entries in the ring ℤ [1/2, i], the smallest subring of the complex numbers containing 1/2 and i. Amy, Glaudell, and Ross proved the converse, i.e., any unitary matrix with entries in ℤ [1/2, i] can be realized by a quantum circuit over the above gate set using at most one ancilla. In this paper, we give a finite presentation by generators and relations of U_n(ℤ [1/2, i]), the group of unitary n× n-matrices with entries in ℤ [1/2, i].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2021

Generators and Relations for the Group O_n(ℤ[1/2])

We give a finite presentation by generators and relations for the group ...
research
02/05/2021

Decomposition of Clifford Gates

In fault-tolerant quantum computation and quantum error-correction one i...
research
11/30/2012

Genetic braid optimization: A heuristic approach to compute quasiparticle braids

In topologically-protected quantum computation, quantum gates can be car...
research
03/01/2023

On the universality of S_n-equivariant k-body gates

The importance of symmetries has recently been recognized in quantum mac...
research
09/30/2022

Design and analysis of digital communication within an SoC-based control system for trapped-ion quantum computing

Electronic control systems used for quantum computing have become increa...
research
09/13/2021

Generators and Relations for Real Stabilizer Operators

Real stabilizer operators, which are also known as real Clifford operato...
research
12/03/2021

Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm

The Solovay-Kitaev algorithm is a fundamental result in quantum computat...

Please sign up or login with your details

Forgot password? Click here to reset