Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
Quantum Information and Computation · 2014-11 · 14 (15&16) · 1277-1301
DOI: 10.26421/qic14.15-16-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Quantum Information and Computation, 2014-11. Verfasst von Adam Paetznick und 1 weiteren Autor:innen. Die Arbeit wurde bisher 41-mal zitiert (Crossref).
Abstract (Originalsprache)
We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance $\epsilon$ and requires significantly fewer non-Clifford gates than existing techniques. We develop ``Repeat-Until-Success" (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioning on a given measurement outcome and using only a small number of non-Clifford gates and ancilla qubits. We construct an algorithm based on RUS circuits that approximates an arbitrary single-qubit $Z$-axis rotation to within distance $\epsilon$, where the number of $T$ gates scales as $1.26\log_2(1/\epsilon) - 3.53$, an improvement of roughly three-fold over state-of-the-art techniques. We then extend our algorithm and show that a scaling of $2.4\log_2(1/\epsilon) - 3.28$ can be achieved for arbitrary unitaries and a small range of $\epsilon$, which is roughly twice as good as optimal deterministic decomposition methods.
Zitieren
APA
Paetznick, A., & Svore, K. M. (2014). Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries. Quantum Information and Computation, 14(15&16), 1277-1301. https://doi.org/10.26421/qic14.15-16-2
Vancouver
Paetznick A, Svore KM. Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries. Quantum Information and Computation. 2014;14(15&16):1277-1301. doi:10.26421/qic14.15-16-2
BibTeX
@article{Paetznick2014,
author = {Paetznick, Adam and Svore, Krysta M.},
title = {Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries},
journal = {Quantum Information and Computation},
year = {2014},
volume = {14},
number = {15&16},
pages = {1277--1301},
doi = {10.26421/qic14.15-16-2}
}
EUVIMED