Synthesis of unitaries with Clifford+T circuits
arXiv:1306.3200
Abstract
We describe a new method for approximating an arbitrary qubit unitary with precision using a Clifford and T circuit with gates. The method is based on rounding off a unitary to a unitary over the ring and employing exact synthesis. We also show that any qubit unitary over the ring with entries of the form can be exactly synthesized using 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 elementary gates.
arXiv comment4 pages
References in corpus (4)
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