Quantum Circuits for Functionally Controlled NOT Gates

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes . Amsterdam: North-Holland, 1977

1977

Earlier work this paper cites.

C. H. Bennett, “Time/space trade-offs for reversible computation,” SIAM Journal on Computing , vol. 18, no. 4, pp. 766–776, 1989

1989

Earlier work this paper cites.

L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Symposium on Theory and Computing , 1996, pp. 212–219

1996

Earlier work this paper cites.

P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing , vol. 26, no. 5, pp. 1484–1509, 1997

1997

Earlier work this paper cites.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge University Press, 2000

2000

Earlier work this paper cites.

R. Královic, “Time and space complexity of reversible pebbling,” in Conf. on Current Trends in Theory and Practice of Informatics , 2001, pp. 292–303

2001

Earlier work this paper cites.

N. Schuch and J. Siewert, “Programmable networks for quantum algorithms,” Physical Review Letters , vol. 91, no. 027902, 2003

2003

Earlier work this paper cites.

J. Kempe, “Quantum random walks - an introductory overview,” Contemporary Physics , vol. 44, no. 4, pp. 307–327, 2003

2003

Earlier work this paper cites.

C. M. Dawson, H. L. Haselgrove, A. P. Hines, D. Mortimer, M. A. Nielsen, and T. J. Osborne, “Quantum computing and polynomial equations over the finite field ℤ 2 \mathbb{Z}_{2} ,” Quantum Information and Computation , vol. 5, no. 2, pp. 102–112, 2005, arXiv preprint arXiv:quant-ph/0408129

2005

Cited alongside, same era.

A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters , vol. 103, no. 15, p. 150502, 2009

2009

Cited alongside, same era.

P. Selinger, “Quantum circuits of T T -depth one,” Physical Review A , vol. 87, p. 042302, 2013

2013

Cited alongside, same era.

N. C. Jones, “Low-overhead constructions for the fault-tolerant Toffoli gate,” Physical Review A , vol. 87, no. 2, p. 022328, 2013

2013

Cited alongside, same era.

B. D. Clader, B. C. Jacobs, and C. R. Sprouse, “Preconditioned quantum linear system algorithm,” Physical Review Letters , vol. 110, no. 25, p. 250504, 2013

M. Amy, D. Maslov, and M. Mosca, “Polynomial-time T T -depth optimization of Clifford+ T T circuits via matroid partitioning,” IEEE Trans. on CAD of Integrated Circuits and Systems , vol. 33, no. 10, pp. 1476–1489, 2014

2014

Later among the works it cites.

D. W. Berry, A. M. Childs, and R. Kothari, “Hamiltonian simulation with nearly optimal dependence on all parameters,” in Foundations of Computer Science , 2015, pp. 792–809

2015

Later among the works it cites.

C. Gidney, “Halving the cost of quantum addition,” Quantum , vol. 2, p. 74, 2018

2018

Later among the works it cites.

K. Svore, A. Geller, M. Troyer, J. Azariah, C. Granade, B. Heim, V. Kliuchnikov, M. Mykhailova, A. Paz, and M. Roetteler, “Q#: Enabling scalable quantum computing and development with a high-level DSL,” in Real World Domain Specific Languages Workshop , 2018, pp. 7:1–7:10

2018

Later among the works it cites.