Synthesis of unitaries with Clifford+T circuits

Abstract

We describe a new method for approximating an arbitrary $n$ qubit unitary with precision $\epsilon$ using a Clifford and T circuit with $O(4^{n}n(\log (1/\epsilon )+n))$ gates. The method is based on rounding off a unitary to a unitary over the ring $\mathbb{Z}[i,1/\sqrt{2}]$ and employing exact synthesis. We also show that any $n$ qubit unitary over the ring $\mathbb{Z}[i,1/\sqrt{2}]$ with entries of the form $(a+b\sqrt{2}+ic+id\sqrt{2})/2^k$ can be exactly synthesized using $O(4^{n}nk)$ Clifford and T gates using two ancillary qubits. This new exact synthesis algorithm is an improvement over the best known exact synthesis method by B. Giles and P. Selinger requiring $O(3^{2^n}nk)$ elementary gates.

4 pages

References in corpus (2)

• Exact synthesis of multiqubit Clifford+T circuits
• Compiling Quantum Circuits using the Palindrome Transform

Cited by in corpus (9)

• Efficient synthesis of universal Repeat-Until-Success circuits
• Efficient synthesis of probabilistic quantum circuits with fallback
• Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels
• A polynomial time and space heuristic algorithm for T-count
• Quantum circuit design for accurate simulation of qudit channels
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• Efficient Topological Compilation for Weakly-Integral Anyon Model
• Experimental pairwise entanglement estimation for an N-qubit system :A machine learning approach for programming quantum hardware
• Resource optimization for fault-tolerant quantum computing