Fetching the paper…
Reading the bibliography…
We study the quantum complexity class QNC^0_f of quantum operations implementable exactly by constant-depth polynomial-size quantum circuits with unbounded fan-out gates (called QNC^0_f circuits).
Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF ( p ) (p) and its cryptographic significance, IEEE Transactions on Information Theory 24 (1), 106–110 (1978)
1978
Earlier work this paper cites.
Chandra, A.K., Fortune, S., Lipton, R.: Unbounded fan-in circuits and associative functions, ACM Symposium on Theory of Computing, 52–60 (1983)
1983
Earlier work this paper cites.
Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial hierarchy, Mathematical Systems Theory 17, 13–27 (1984)
1984
Earlier work this paper cites.
Siu, K.-Y., Bruck, J., Kailath, T., Hofmeister, T.: Depth efficient neural networks for division and related problems, IEEE Transactions on Information Theory 39 (3), 946–956 (1993)
1993
Earlier work this paper cites.
Brassard, G., Høyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem, Israeli Symposium on Theory of Computing and Systems, 12–23 (1997)
1997
Earlier work this paper cites.
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26 (5), 1484–1509 (1997)
1997
Earlier work this paper cites.
Vollmer, H.: Introduction to Circuit Complexity, Springer (1999)
1999
Earlier work this paper cites.
Cleve, R., Watrous, J.: Fast parallel circuits for the quantum Fourier transform, IEEE Symposium on Foundations of Computer Science, 526–536 (2000)
2000
Earlier work this paper cites.
Hales, L., Hallgren, S.: An improved quantum Fourier transform algorithm and applications, IEEE Symposium on Foundations of Computer Science, 515–525 (2000)
2000
Cited alongside, same era.
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, Cambridge University Press (2000)
2000
Cited alongside, same era.
Moore, C., Nilsson, M.: Parallel quantum computation and quantum codes, SIAM Journal on Computing 31 (3), 799–815 (2001)
2001
Cited alongside, same era.
Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation, Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series 305, 53–74 (2002)
2002
Cited alongside, same era.
Green, F., Homer, S., Moore, C., Pollett, C.: Counting, fanout, and the complexity of quantum ACC, Quantum Information and Computation 2 (1), 35–65 (2002)
Fang, M., Fenner, S., Green, F., Homer, S., Zhang, Y.: Quantum lower bounds for fanout, Quantum Information and Computation 6 (1), 46–57 (2006)
2006
Later among the works it cites.
Bera, D., Green, F., Homer, S.: Small depth quantum circuits, ACM SIGACT NEWS 38 (2), 35–50 (2007)
2007
Later among the works it cites.
O’Donnell, R.: Some topics in analysis of Boolean functions, ACM Symposium on Theory of Computing, 569–578 (2008)
2008
Later among the works it cites.
Aaronson, S.: BQP and the polynomial hierarchy, ACM Symposium on Theory of Computing, 141–150 (2010)
2010
Later among the works it cites.
Bera, D.: A lower bound method for quantum circuits, Information Processing Letters 111 (15), 723–726 (2011)
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
Mosca, M., Zalka, Ch.: Exact quantum Fourier transforms and discrete logarithm algorithms, International Journal of Quantum Information 2 (1), 91–100 (2004)
2004
Cited alongside, same era.
Fenner, S., Green, F., Homer, S., Zhang, Y.: Bounds on the power of constant-depth quantum circuits, Fundamentals of Computation Theory, LNCS 3623, 44–55 (2005)
2005
Cited alongside, same era.
Høyer, P., Špalek, R.: Quantum fan-out is powerful, Theory of Computing 1 (5), 81–103 (2005)
2005
Cited alongside, same era.
van Dam, W.: Quantum computing discrete logarithms with the help of a preprocessed state, arXiv:quant-ph/0311134
Cited in the paper.
Browne, D.E., Kashefi, E., Perdrix, S.: Computational depth complexity of measurement-based quantum computation, Conference on Theory of Quantum Computation, Communication, and Cryptography 2010, LNCS 6519, 35–46 (2011)
2011
Closest in time.
Hoban, M.J., Campbell, E.T., Loukopoulos, K., Browne, D.E.: Non-adaptive measurement-based quantum computation and multi-party Bell inequalities, New Journal of Physics 13, 023014 (2011)
2011
Closest in time.