# Optimal ancilla-free Clifford+T approximation of z-rotations

@article{Ross2014OptimalAC,
title={Optimal ancilla-free Clifford+T approximation of z-rotations},
author={Neil J. Ross and Peter Selinger},
journal={Quantum Inf. Comput.},
year={2014},
volume={16},
pages={901-953}
}
• Published 12 March 2014
• Computer Science
• Quantum Inf. Comput.
We consider the problem of approximating arbitrary single-qubit z-rotations by ancilla-free Clifford+T circuits, up to given epsilon. We present a fast new probabilistic algorithm for solving this problem optimally, i.e., for finding the shortest possible circuit whatsoever for the given problem instance. The algorithm requires a factoring oracle (such as a quantum computer). Even in the absence of a factoring oracle, the algorithm is still near-optimal under a mild number-theoretic hypothesis…
172 Citations

## Figures and Tables from this paper

A new efficient algorithm to approximate z-rotations by ancilla-free Pauli+V circuits, up to a given precision ε, which is optimal in the presence of an oracle for integer factoring and still near-optimal in the absence of such an oracles.
• Mathematics, Computer Science
ArXiv
• 2014
This work introduces a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+T gate set.
• Computer Science
TQC
• 2017
A reversible circuit for integer multiplication that is inspired by Karatsuba's recursive method is presented, with the main improvement over circuits that have been previously reported in the literature is an asymptotic reduction of the amount of space required.
• Computer Science, Mathematics
ArXiv
• 2015
This work presents an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras that works for a wide range of gate sets and provides insight into what should constitute a "good" gate set for a fault-tolerant quantum computer.
• Mathematics
ArXiv
• 2015
This paper presents a common mathematical structure underlying all results related to the exact synthesis of qubit unitaries known to date, including Clifford+T, Clifford-cyclotomic and V-basis gate sets, as well as gates sets induced by the braiding of Fibonacci anyons in topological quantum computing.
• Computer Science
npj Quantum Information
• 2021
This paper introduces an efficient and optimal synthesis algorithm for two-qubit Clifford+CS operators and gives an explicit description of these normal forms and derives a worst-case lower bound of 5 log 2 ( 1 ϵ ) + O ( 1 ) on the number of CS gates required to ϵ -approximate elements of SU(4).
• Computer Science
npj Quantum Information
• 2021
This paper introduces an efficient and optimal synthesis algorithm for two-qubit Clifford+CS operators and gives an explicit description of these normal forms and derives a worst-case lower bound of 5log2(1ϵ)+O(1) on the number of CS gates required to ϵ-approximate elements of SU(4).
• Computer Science
Quantum Science and Technology
• 2020
It is shown that catalysis is necessary for many conversions and introduced new catalytic conversions, some of which are optimal, which optimally lower bound the number of T or CCZ states needed to implement the ubiquitous modular adder and multiply-controlled-Z operations.
• Computer Science
Quantum Science and Technology
• 2021
This work focuses on reducing the physical cost of implementing quantum algorithms when using the state-of-the-art fault-tolerant quantum error correcting codes, in particular, those for which implementing the T gate consumes vastly more resources than the other gates in the gate set.
• Computer Science
ArXiv
• 2021
The first inversefree Solovay-Kitaev algorithm is provided, which makes no assumption on the structure within a gate set beyond universality, answering this problem in the affirmative, and providing an efficient compilation algorithm in the absence of inverses for both SU(d) and SL(d,C).

## References

SHOWING 1-10 OF 40 REFERENCES

• P. Selinger
• Computer Science, Mathematics
Quantum Inf. Comput.
• 2015
An efficient randomized algorithm for approximating an arbitrary element of SU(2) by a product of Clifford+T operators, up to any given error threshold e > 0.05, which is within an additive constant of optimal for certain z-rotations.
• Computer Science
Physical review letters
• 2013
An algorithm is presented for building a circuit that approximates single qubit unitaries with precision ε using O(log(1/ε)) Clifford and T gates and employing up to two ancillary qubits that saturates the lower bound of Lagrange's four-square theorem.
• Mathematics, Computer Science
ArXiv
• 2014
This work introduces a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+T gate set.
• Computer Science
Quantum Inf. Comput.
• 2006
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d).
• Computer Science
• 2013
A non-deterministic quantum protocol that approximates the single qubit rotations Rx(2ϕ21ϕ22) using Rx( 2ϕ1) and Rx(3ϕ2) and a constant number of Clifford and T operations and it is shown that the vast majority of the cost of the resultant circuits can be shifted to parallel computation paths.
• Mathematics
ArXiv
• 2012
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,
• Physics
• 2014
We address the problem of optimal representation of single-qubit rotations in a certain unitary basis consisting of the so-called V gates and Pauli matrices. The V matrices were proposed by Lubotsky,
• Computer Science
Physical review letters
• 2015
This work presents a probabilistically polynomial-time algorithm to synthesize a RUS circuit to approximate any given single-qubit unitary to precision ϵ over the Clifford+T basis, and surprisingly, the T count of the synthesized R US circuit surpasses the theoretical lower bound.
• Computer Science
• 2013
The first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis are developed, an alternative universal basis to the more commonly studied $\{H,T\}$ basis.
• Mathematics
Quantum Inf. Comput.
• 2013
An efficient synthesis algorithm, with an exact optimality guarantee on the number of Hadamard and T gates used, and conjecture that the equivalence of the sets of unitaries implementable by circuits over the Clifford and T library and unitaries over the ring Z[1/√2, i] holds in the n-qubit case.