Optimal ancilla-free Clifford+V approximation of z-rotations
Quantum Information and Computation · 2015-09 · 15 (11&12) · 932-950
DOI: 10.26421/qic15.11-12-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Information and Computation, 2015-09. Verfasst von Neil J. Ross. Die Arbeit wurde bisher 16-mal zitiert (Crossref).
Abstract (Originalsprache)
We describe a new efficient algorithm to approximate $z$-rotations by ancilla-free Clifford+$V$ circuits, up to a given precision $\epsilon$. Our algorithm is optimal in the presence of an oracle for integer factoring: it outputs the shortest Clifford+$V$ circuit solving the given problem instance. In the absence of such an oracle, our algorithm is still near-optimal, producing circuits of $V$\!-count $m + O(\log(\log(1/\epsilon)))$, where $m$ is the $V$\!-count of the third-to-optimal solution. A restricted version of the algorithm approximates $z$-rotations in the Pauli+$V$ gate set. Our method is based on previous work by the author and Selinger on the optimal ancilla-free approximation of $z$-rotations using Clifford+$T$ gates and on previous work by Bocharov, Gurevich, and Svore on the asymptotically optimal ancilla-free approximation of $z$-rotations using Clifford+$V$ gates.
Zitieren
APA
Ross, N. J. (2015). Optimal ancilla-free Clifford+V approximation of z-rotations. Quantum Information and Computation, 15(11&12), 932-950. https://doi.org/10.26421/qic15.11-12-4
Vancouver
Ross NJ. Optimal ancilla-free Clifford+V approximation of z-rotations. Quantum Information and Computation. 2015;15(11&12):932-950. doi:10.26421/qic15.11-12-4
BibTeX
@article{Ross2015,
author = {Ross, Neil J.},
title = {Optimal ancilla-free Clifford+V approximation of z-rotations},
journal = {Quantum Information and Computation},
year = {2015},
volume = {15},
number = {11&12},
pages = {932--950},
doi = {10.26421/qic15.11-12-4}
}
EUVIMED