Optimal ancilla-free Clifford+T approximation of z-rotations
Quantum Information and Computation · 2016-09 · 16 (11&12) · 901-953
DOI: 10.26421/qic16.11-12-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Information and Computation, 2016-09. Verfasst von Neil J. Ross und 1 weiteren Autor:innen. Die Arbeit wurde bisher 107-mal zitiert (Crossref).
Abstract (Originalsprache)
We consider the problem of approximating arbitrary single-qubit z-rotations by ancillafree 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. In this case, the algorithm finds a solution of T-count m + O(log(log(1/ε))), where m is the T-count of the second-to-optimal solution. In the typical case, this yields circuit approximations of Tcount 3 log2 (1/ε) + O(log(log(1/ε))). Our algorithm is efficient in practice, and provably efficient under the above-mentioned number-theoretic hypothesis, in the sense that its expected runtime is O(polylog(1/ε)).
Zitieren
APA
Ross, N. J., & Selinger, P. (2016). Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Information and Computation, 16(11&12), 901-953. https://doi.org/10.26421/qic16.11-12-1
Vancouver
Ross NJ, Selinger P. Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Information and Computation. 2016;16(11&12):901-953. doi:10.26421/qic16.11-12-1
BibTeX
@article{Ross2016,
author = {Ross, Neil J. and Selinger, Peter},
title = {Optimal ancilla-free Clifford+T approximation of z-rotations},
journal = {Quantum Information and Computation},
year = {2016},
volume = {16},
number = {11&12},
pages = {901--953},
doi = {10.26421/qic16.11-12-1}
}
EUVIMED