Fetching the paper…
Reading the bibliography…
This paper surveys the field of quantum computer algorithms.
International Journal of Theoretical Physics 21(6,7)
Feynman, R.: Simulating physics with computers · 1982
Earlier work this paper cites.
In: Proceedings of the Royal Society of London A, vol. 400, pp. 97–117 (1985)
Deutsch, D.: Quantum theory, the church-turing principle and the universal quantum computer · 1985
Earlier work this paper cites.
Springer-Verlag, New York (1989)
Brouwer, A.E.: Distance-Regular Graphs · 1989
Earlier work this paper cites.
In: Proceedings of the Royal Society of London, Series A, vol. 439, pp. 553–558 (1992)
Deutsch D., J.R.: Rapid solutions of problems by quantum computation · 1992
Earlier work this paper cites.
In: Proceedings of the 8th Structures in Complexity Conference, pp. 102–111 (1993)
Karchmer, M., Wigderson, A.: On span programs · 1993
Earlier work this paper cites.
Cambridge University Press (1993)
Welsh, D.: Complexity: Knots, Colourings and Countings · 1993
Earlier work this paper cites.
In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134 (1994)
Shor, P.: Algorithms for quantum computation: Discrete logarithms and factoring · 1994
Earlier work this paper cites.
In: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 116–123 (1994)
Simon, D.: On the power of quantum computation · 1994
Earlier work this paper cites.
pp. 424–437 (1995)
Boneh, D., Lipton, R.: Quantum cryptanalysis of hidden linear functions (extended abstract) · 1995
Earlier work this paper cites.
Kitaev, A., Yu: Quantum measurements and the abelian stabilizer problem (1995)
1995
Earlier work this paper cites.
In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 212–219 (1996)
Grover, L.: A fast quantum mechanical algorithm for database search · 1996
Earlier work this paper cites.
CRC Press (1996)
Menezes, A., van Oorschot, P., S., V.: Handbook of Applied Cryptography · 1996
Earlier work this paper cites.
SIAM Journal on Computing 26
Bernstein, B.K., Vazirani, U.: Quantum complexity theory · 1997
Earlier work this paper cites.
In: Proc. of Fifth Israeli Symposium on Theory of Computing and Systems (ISTCS’97), pp. 12–23 (1997)
Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for simon’s problem · 1997
Earlier work this paper cites.
ACM SIGACT News 28
Brassard, G., Hoyer, P., Tapp, A.: Cryptology column —quantum algorithm for the collision problem · 1997
Earlier work this paper cites.
Theor. Comput. Sci. 180
Grigoriev, D.: Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines · 1997
Earlier work this paper cites.
SIAM J. Computing 26
Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer · 1997
Earlier work this paper cites.
Fortschritte der Physik 56(5-5)
Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching · 1998
Earlier work this paper cites.
In: Proceedings of the Royal Society of London A, vol. 454, pp. 339–354 (1998)
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited · 1998
Earlier work this paper cites.
In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC), pp. 53–62 (1998)
Grover, L.: A framework for fast quantum mechanical algorithms · 1998
Earlier work this paper cites.
Freedman, M.H., Kitaev, A., Wang, Z.: Simulation of topological field theories by quantum computers (2000)
2000
Earlier work this paper cites.
Nayak, A., Vishwanath, A.: Quantum walk on the line (2000)
2000
Cited alongside, same era.
Cambridge University Press (2000)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information · 2000
Cited alongside, same era.
In: STOC ’01: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 50–59. ACM, New York, NY, USA (2001)
Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs · 2001
Cited alongside, same era.
In: STOC ’01: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 37–49. ACM, New York, NY, USA (2001)
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks · 2001
Cited alongside, same era.
Freedman, M.H., Kitaev, A., Larsen, M.J., Wang, Z.: Topological quantum computation (2001)
2001
Cited alongside, same era.
Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the hamiltonian nand tree (2007)
2007
Later among the works it cites.
Physical Review Letters 98
G. M. D’Ariano W. van Dam, E.E.C.M., Mosca, M.: General optimized schemes for phase estimation · 2007
Later among the works it cites.
Oxford University Press (2007)
Kaye, P., Laflamme, R., Mosca, M.: An Introduction to Quantum Computation · 2007
Later among the works it cites.
In: STOC ’07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 575–584. ACM, New York, NY, USA (2007)
Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk · 2007
Later among the works it cites.
Cambridge University Press (2007)
Mermin, N.D.: Quantum Computer Science: An Introduction · 2007
Later among the works it cites.
Algorithmica (2008)
Aharonov, D., Jones, V., Landau, Z.: A polynomial quantum algorithm for approximating the jones polynomial · 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hirvensalo, M.: Quantum computing · 2001
Cited alongside, same era.
Theoretical Computer Science 264
Mosca, M.: Counting by quantum eigenvalue estimation · 2001
Cited alongside, same era.
Quantum Computation & Information, AMS Contemporary Math Series (2002)
Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum Amplitude Amplification and Estimation · 2002
Cited alongside, same era.
American Mathematical Society (2002)
Kitaev, A., Shen, A., Vyalvi, M.: Classical and quantum computation · 2002
Cited alongside, same era.
International Journal of Quantum Information 1
Ambainis, A.: Quantum walks and their algorithmic applications · 2003
Cited alongside, same era.
In: STOC ’03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 59–68. ACM, New York, NY, USA (2003)
Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by a quantum walk · 2003
Cited alongside, same era.
Contemporary Physics 44
Kempe, J.: Quantum random walks– an introductory overview · 2003
Cited alongside, same era.
Later among the works it cites.
Arad, I., Landau, Z.: Quantum computation and the evaluation of tensor networks (2008)
2008
Later among the works it cites.
Beaudin, L., Ellis-Monaghan, J., Pangborn, G., Shrock, R.: A little statistical mechanics for the graph theorist (2008)
2008
Later among the works it cites.
Childs, A.: Lecture notes on quantum algorithms (2008)
2008
Later among the works it cites.
Cuevas, G.D.l., Dür, W., Van den Nest, M., Briegel, H.J.: Completeness of classical spin models and universal quantum computation (2008)
2008
Later among the works it cites.
Rev. Mod. Phys. 80
Das, A., Chakrabarti, B.K.: Quantum annealing and analog quantum computation · 2008
Later among the works it cites.
Geraci, J.: A bqp-complete problem related to the ising model partition function via a new connection between quantum circuits and graphs (2008)
2008
Later among the works it cites.
Communications in Mathematical Physics 279
Geraci, J., Lidar, D.A.: On the exact evaluation of certain instances of the potts partition function by quantum computers · 2008
Later among the works it cites.
Hübener, R., Van den Nest, M., Dür, W., Briegel, H.J.: Classical spin systems and the quantum stabilizer formalism: general mappings and applications (2008)
2008
Later among the works it cites.
Ph.D. thesis, MIT (2008)
Jordan, S.: Quantum computation beyond the circuit model · 2008
Later among the works it cites.
Encyclopedia of Algorithms. Springer (2008)
Mosca, M.: Abelian Hidden Subgroup Problem · 2008
Later among the works it cites.
In: STOC ’08: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 103–112. ACM, New York, NY, USA (2008)
Reichardt, B.W., Spalek, R.: Span-program-based quantum algorithm for evaluating formulas · 2008
Later among the works it cites.
In: Theory and Applications of Models of Computation, pp. 31–46 (2008)
Santha, M.: Quantum walk based search algorithms · 2008
Later among the works it cites.
Wiebe, N., Berry, D.W., Hoyer, P., Sanders, B.C.: Higher order decompositions of ordered operator exponentials (2008)
2008
Later among the works it cites.
Reviews of Modern Physics (2009)
Childs, A., van Dam, W.: Quantum algorithms for algebraic problems (to appear) · 2009
Later among the works it cites.
Encyclopedia of Complexity and Systems Science (2009)
Mosca, M.: Quantum Algorithms (to appear) · 2009
Later among the works it cites.