Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates

Reading the bibliography…

Fetching the paper…

Built on

A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation . Physical Review A 52, 3457–3467, 1995, quant-ph/9503016
1995
Earlier work this paper cites.
A. Kitaev. Quantum measurements and the Abelian Stabilizer Problem . 1995, quantph/9511026
1995
Earlier work this paper cites.
M. Nielsen and I. Chuang. Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation . American Mathematical Society, Providence, RI, 2002
2002
Earlier work this paper cites.
H. K. Cummins, G. Llewellyn, and J. A. Jones. Tackling Systematic Errors in Quantum Logic Gates with Composite Rotations . Physical Review A 67, 042308, 2003, quant-ph/0208092
2003
Earlier work this paper cites.

A. G. Fowler. Towards Large-Scale Quantum Computation
2005
Cited alongside, same era.
C. Dawson, and M. Nielsen. The Solovay-Kitaev algorithm . Quantum Information and Computation 6
2006
Cited alongside, same era.
K. Matsumoto and K. Amano. Representation of Quantum Circuits with Clifford and π / 8 \pi/8 Gates . 2008, arXiv:0806.3834
Original
2008
Cited alongside, same era.
J. Watrous. Semidefinite programs for completely bounded norms . 2009, arXiv:0901.4709
Original
2009
Cited alongside, same era.

M. Nakata. A numerical evaluation of highly accurate multiple-precision arithmetic version of semidefinite programming solver:SDPA-GMP, -QD and -DD . the proceedings of 2010 IEEE Multi-Conference on Systems and Control, 29-34, 2010
2010
Later among the works it cites.
A. G. Fowler. Constructing Arbitrary Steane Code Single Logical Qubit Fault-tolerant Gates . Quantum Information and Computation 11
2011
Later among the works it cites.
A. Bocharov and K. M. Svore. A depth-optimal canonical form for single-qubit quantum circuits . Physical Review Letters 109, 190501, 2012, arXiv:1206.3223
Original
2012
Closest in time.
M. Amy, D. Maslov, M. Mosca, and M. Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits . IEEE Trans. CAD, 2013, arXiv:1206.0758
Original
2013
Closest in time.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…

Reading the bibliography…

Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates · Around

A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation . Physical Review A 52, 3457–3467, 1995, quant-ph/9503016
1995
Earlier work this paper cites.
A. Kitaev. Quantum measurements and the Abelian Stabilizer Problem . 1995, quantph/9511026
1995
Earlier work this paper cites.
M. Nielsen and I. Chuang. Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation . American Mathematical Society, Providence, RI, 2002
2002
Earlier work this paper cites.
H. K. Cummins, G. Llewellyn, and J. A. Jones. Tackling Systematic Errors in Quantum Logic Gates with Composite Rotations . Physical Review A 67, 042308, 2003, quant-ph/0208092
2003
Earlier work this paper cites.

A. G. Fowler. Towards Large-Scale Quantum Computation
2005
Cited alongside, same era.
C. Dawson, and M. Nielsen. The Solovay-Kitaev algorithm . Quantum Information and Computation 6
2006
Cited alongside, same era.
K. Matsumoto and K. Amano. Representation of Quantum Circuits with Clifford and π / 8 \pi/8 Gates . 2008, arXiv:0806.3834
Original
2008
Cited alongside, same era.
J. Watrous. Semidefinite programs for completely bounded norms . 2009, arXiv:0901.4709
Original
2009
Cited alongside, same era.

M. Nakata. A numerical evaluation of highly accurate multiple-precision arithmetic version of semidefinite programming solver:SDPA-GMP, -QD and -DD . the proceedings of 2010 IEEE Multi-Conference on Systems and Control, 29-34, 2010
2010
Later among the works it cites.
A. G. Fowler. Constructing Arbitrary Steane Code Single Logical Qubit Fault-tolerant Gates . Quantum Information and Computation 11
2011
Later among the works it cites.
A. Bocharov and K. M. Svore. A depth-optimal canonical form for single-qubit quantum circuits . Physical Review Letters 109, 190501, 2012, arXiv:1206.3223
Original
2012
Closest in time.
M. Amy, D. Maslov, M. Mosca, and M. Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits . IEEE Trans. CAD, 2013, arXiv:1206.0758
Original
2013
Closest in time.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…