Generators and Relations for Un(Z[1/2,i])

  title={Generators and Relations for Un(Z[1/2,i])},
  author={Xiaoning Bian and Peter Selinger},
  journal={Electronic Proceedings in Theoretical Computer Science},
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 Z[ 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 Z[ 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 Un(Z… 

Figures from this paper

Symbolic synthesis of Clifford circuits and beyond

The unitarity problem is co-NP -hard in general, but that it is in P when restricted to Clifford path sums, and the capability of the algorithm is demonstrated by synthesizing the standard quantum Fourier transform directly from a path sum.



Generators and Relations for the Group On(Z[1/2])

A finite presentation by generators and relations is given for the group On(Z[ 1/2]) of ndimensional orthogonal matrices with entries in Z[1/2] and for thegroup of n-dimensional orthosomatic matrices of the form M/ √ 2, where k is a nonnegative integer and M is an integer matrix.

Techniques to Reduce π/4-Parity-Phase Circuits, Motivated by the ZX Calculus

To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is

Exact synthesis of multi-qubit Clifford+T circuits

We prove that a unitary matrix has an exact representation over the Clifford+$T$ gate set with local ancillas if and only if its entries are in the ring $\mathbb{Z}[\frac{1}{\sqrt{2}},i]$. Moreover,

Reducing the number of non-Clifford gates in quantum circuits

We present a method for reducing the number of non-Clifford quantum gates, in particularly T-gates, in a circuit, an important task for efficiently implementing fault-tolerant quantum computations.

Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities

Techniques to reduce the T-count are described, based on the effective application of "spider nest identities": easily recognised products of parity-phase operations which are equivalent to the identity operation.

Automated optimization of large quantum circuits with continuous parameters

An automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers are developed and implemented and a collection of fast algorithms capable of optimizing large-scale quantum circuits are reported.

An efficient quantum compiler that reduces T count

This work implemented and compared several efficient quantum compilers for multi-qubit Clifford + T circuits in C++ and benchmarked them on random circuits, determining that the TODD compiler yields the lowest T counts on average.

A classical introduction to modern number theory

This second edition has been corrected and contains two new chapters which provide a complete proof of the Mordell-Weil theorem for elliptic curves over the rational numbers, and an overview of recent progress on the arithmetic of elliptic curve.

T-Count Optimization and Reed–Muller Codes

  • M. AmyM. Mosca
  • Computer Science
    IEEE Transactions on Information Theory
  • 2019
An algorithm for the optimization of inline-formula-count in quantum circuits based on Reed–Muller decoders is derived, along with a new upper bound on the number of gates required to implement an implementation of single-qubit phase gates.

Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits

The present paper provides number-theoretic characterizations for certain restricted Clifford+$T$ circuits by considering unitary matrices over subrings of $\mathbb{Z}[1/\sqrt{2},i]$.