Efficient Approximation of Diagonal Unitaries over the Clifford+T Basis

Barenco. A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P. Sleator, T., Smolin, J., Weinfurter, H.: Elementary Gates for Quantum Computation. Phys. Rev. A. 52, 3457, (1995)

1995

Earlier work this paper cites.

Wiesner, S.: Simulations of many-body quantum systems by a quantum computer. quant- ph/9603028, 1996

1996

Earlier work this paper cites.

Grover, Lov K.: A fast quantum mechanical algorithm for database search. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM, 1996

1996

Earlier work this paper cites.

Zalka, C: Simulating quantum systems on a quantum computer. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 454(1969):313?322, January 1998

1998

Earlier work this paper cites.

Hogg,T., Mochon,C., Polak, W.,Rieffel, E.: Tools for Quantum Algorithms. International Journal of Modern Physics C, (10), 1347–1361, (1999)

1999

Earlier work this paper cites.

Gottesman, D., Chuang, I.L.: Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Nature 402, 390–393 (1999)

1999

Earlier work this paper cites.

Zhou, X.,Leung, D. W., Chuang, I. L.: Methodology for quantum logic gate constructions. Phys.Rev. A. 62, 052316 (2000)

2000

Earlier work this paper cites.

Bullock, S.S., Markov, I.L.: Asymptotically Optimal Circuits for Arbitrary N-qubit Diagonal Computations. Quantum Info. Comput. 4, 27–47 (2004)

2004

Cited alongside, same era.

Dawson,C. Nielsen, M.: The Solovay-Kitaev algorithm. Quantum Information and Computation 6(1), 81–95 (2006)

2006

Cited alongside, same era.

Kassal, I., Jordan, S., Love, P., Mohseni M., and Aspuru-Guzik, A.: Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Natl. Acad. Sci., 105(48):18681–18686, 2008

2008

Cited alongside, same era.

Jones, N.C., Whitfield, J.D., McMahon, P.L., Yung, M-H., Van Meter, R., Aspuru-Guzik, A., Yamamoto, Y.: Simulating chemistry efficiently on fault-tolerant quantum computers. New Journal of Physics 14, 115023 (2012)

2012

Cited alongside, same era.

Selinger, P.: Efficient Clifford+T approximation of single-qubit operators. arXiv:1212.6253, (2012)

Amy, M., Maslov, D., Mosca, M., Rötteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 32(6), 818–830, (2013)

2013

Later among the works it cites.

Shende, V. V., Prasad, A. K., Markov, I.L., Hayes, J.P.: Synthesis of Reversible Logic Circuits. IEEE Trans. on CAD,22(6), 710–722 (2013)

Original

2013

Later among the works it cites.

Welch, J. , Greenbaum, D., Mostame, S., Aspuru-Guzik, A.: Efficient quantum circuits for diagonal unitaries without ancillas. New Journal of Physics 16, 033040 (2014)

2014

Closest in time.

Bocharov, A., Roetteler, M., Svore, K. M.: Efficient synthesis of probabilistic quantum circuits with fallback. arXiv:1409.3552 (2014)

Original

2014

Closest in time.