Optimal Ancilla-free Pauli+V Circuits for Axial Rotations
arXiv:1412.1033 · doi:10.1063/1.4936990
Abstract
Recently Neil Ross and Peter Selinger analyzed the problem of approximating z- rotations by means of single-qubit Clifford+T circuits. Their main contribution is a deterministic-search technique which allowed them to make approximating circuits shallower. We adapt the deterministic-search technique to the case of Pauli+V circuits and prove similar results. Because of the relative simplicity of the Pauli+V framework, we use much simpler geometric methods.
arXiv comment27 pages, 3 figures
References in corpus (6)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Elementary gates for quantum computation
- Efficient Discrete Approximations of Quantum Gates
- Asymptotically Optimal Topological Quantum Compiling
- Efficient Decomposition of Single-Qubit Gates into Basis Circuits
- Efficient synthesis of probabilistic quantum circuits with fallback