publication . Preprint . 2014

Efficient synthesis of universal Repeat-Until-Success circuits

Bocharov, Alex; Roetteler, Martin; Svore, Krysta M.;
Open Access English
  • Published: 21 Apr 2014
Abstract
Comment: 15 pages, 10 figures; reformatted and minor edits; added Fig. 2 to visualize the density of z-rotations implementable via RUS protocols
Subjects
arXiv: Computer Science::Emerging Technologies
free text keywords: Quantum Physics, Computer Science - Emerging Technologies
Download from
29 references, page 1 of 2

[1] N. Ross and P. Selinger, \Optimal ancilla-free Cli ord+T approximation of z-rotations," (2014), 1403.2975.

[2] V. Kliuchnikov, \Synthesis of unitaries with Cli ord+T circuits," (2013), 1306.3200. [OpenAIRE]

[3] A. Paetznick and K. Svore, \Repeat-until-success: Nondeterministic decomposition of single-qubit unitaries," (2013), 1311.1074.

[4] N. Wiebe and V. Kliuchnikov, New Journal of Physics 15, 093041 (2013).

[5] V. Kliuchnikov, D. Maslov, and M. Mosca, Quantum Information and Computation 13(7,8), 607 (2013), 1206.5236.

[6] B. Giles and P. Selinger, Phys. Rev. A 87, 032332 (2013), 1212.0506.

[7] S. Bravyi and A. Y. Kitaev, Physical Review A 71, 022316 (2005), arXiv:0403025 [quant-ph].

[8] A. Meier, B. Eastin, and E. Knill, \Magic-state distillation with the four-qubit code," (2012), 1204.4221.

[9] S. Bravyi and J. Haah, \Magic state distillation with low overhead," (2013), 1209.2426.

[10] A. Bocharov and K. M. Svore, Phys. Rev. Lett. 109, 190501 (2012).

[11] K. Matsumoto and K. Amano, \Representation of quantum circuits with Cli ord and =8 gates," (2008).

[12] B. Giles and P. Selinger, \Remarks on matsumoto and amano's normal form for single-qubit Cli ord+T operators," (2013), 1312.6584.

[13] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2000).

[14] J. Anders and et al., Phys. Rev. A 82, 020301 (2010).

[15] K. Shah and D. Oi, \Ancilla driven quantum computation with arbitrary entangling strength," (2013), 1303.2066.

29 references, page 1 of 2
Any information missing or wrong?Report an Issue