Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning

J. Edmonds, “Minimum partition of a matroid into independent subsets,” Journal of Research of the National Bureau of Standards

1965

Earlier work this paper cites.

P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” Foundations of Computer Science

1994

Earlier work this paper cites.

A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, “Elementary gates for quantum computation,” Phys. Rev. A

1995

Earlier work this paper cites.

S. Lloyd, “Universal quantum simulators,” Science

1996

Earlier work this paper cites.

V. Vedral, A. Barenco, and A. Ekert, “Quantum networks for elementary arithmetic operations,” Phys. Rev. A

1996

Earlier work this paper cites.

Cambridge University Press, 2000

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2000

Earlier work this paper cites.

X. Zhou, D. W. Leung, and I. L. Chuang, “Methodology for quantum logic gate construction,” Phys. Rev. A

2000

Earlier work this paper cites.

T. Beth and M. Rötteler, “Quantum algorithms: Applicable algebra and quantum physics,” in Quantum Information

2001

Earlier work this paper cites.

S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. Petrie Moulton, “A new quantum ripple-carry addition circuit,” ArXiv e-prints

2004

Earlier work this paper cites.

C. M. Dawson, A. P. Hines, D. Mortimer, H. L. Haselgrove, M. A. Nielsen, and T. J. Osborne, “Quantum computing and polynomial equations over the finite field ℤ 2 \mathbb{Z}_{2} ,” Quantum Info. Comput

2005

Earlier work this paper cites.

R. Van Meter and K. M. Itoh, “Fast quantum modular exponentiation,” Phys. Rev. A

2005

Earlier work this paper cites.

P. Aliferis, D. Gottesman, and J. Preskill, “Quantum accuracy threshold for concatenated distance-3 codes,” Quantum Info. Comput

2006

Cited alongside, same era.

T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, “A logarithmic-depth quantum carry-lookahead adder,” Quantum Info. Comput

2006

Cited alongside, same era.

D. Maslov, “Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite-neighbor quantum architectures,” Phys. Rev. A

2007

Cited alongside, same era.

D. Maslov, G. W. Dueck, D. M. Miller, and C. Negrevergne. “Quantum Circuit Simplification and Level Compaction,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

2008

Cited alongside, same era.

K. N. Patel, I. L. Markov, and J. P. Hayes, “Optimal synthesis of linear reversible circuits,” Quantum Info. Comput

2008

J. W. Britton, B. C. Sawyer, A. C. Keith, C.-C. J. Wang, J. K. Freericks, H. Uys, M. J. Biercuk, and J. J. Bollinger, “Engineered two-dimensional ising interactions in a trapped-ion quantum simulator with hundreds of spins,” Nature

2012

Later among the works it cites.

J. M. Chow, J. M. Gambetta, A. D. Córcoles, S. T. Merkel, J. A. Smolin, C. Rigetti, S. Poletto, G. A. Keefe, M. B. Rothwell, J. R. Rozen, M. B. Ketchen, and M. Steffen, “Universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits,” Phys. Rev. Lett

Original

2012

Later among the works it cites.

A. G. Fowler, “Time-optimal quantum computation,” ArXiv e-prints

Original

2012

Later among the works it cites.

A. G. Fowler, A. C. Whiteside, and L. C. L. Hollenberg, “Towards practical classical processing for the surface code,” Phys. Rev. Lett

Original

2012

Later among the works it cites.