Speed-up via Quantum Sampling

M. Jerrum and A. Sinclair, SIAM Journal on Computing 18

1989

Earlier work this paper cites.

M. Dyer, A. Frieze, and R. Kannan, Journal of the ACM 38

1991

Earlier work this paper cites.

A. Sinclair, Algorithms for Generation and Counting – A Markov Chain Approach (Birkhauser, 1992)

1992

Earlier work this paper cites.

M. Jerrum and A. Sinclair, SIAM Journal on Computing 22

1993

Earlier work this paper cites.

M. Boyer, G. Brassard, P. Hoyer, and A. Tapp, Fortschritte der Physik 46

1998

Earlier work this paper cites.

M. Jerrum, Counting, Sampling and Integrating: Algorithms and Complexity , Lectures in Mathematics (Birkhauser, 2003)

2003

Cited alongside, same era.

D. Aharonov and A. Ta-Shma (2003), Proc. of the 35th annual ACM symposium on Theory, pp. 20–29

2003

Cited alongside, same era.

M. Jerrum, A. Sinclair, and E. Vigoda, Journal of the ACM 51

2004

Cited alongside, same era.

M. Szegedy (2004), Proc. of 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–41

2004

Cited alongside, same era.

L. Grover, A different kind of quantum search , arXiv:quant-ph/0503205 (2005)

2005

Cited alongside, same era.

R. Somma, S. Boixo, and H. Barnum, Quantum simulated annealing , arXiv:0712.1008 (2008a)

Original

Cited in the paper.

R. Somma, S. Boixo, H. Barnum, and E. Knill, Quantum simulations of classical annealing processes , arXiv:0804.1571 (2008b)

Original

Cited in the paper.

P. Hoyer, Lecture Notes on Computer Science 3827

2005

Later among the works it cites.

M. Mitzenmacher and E. Upfal, Probability and Computing – Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, 2005)

2005

Later among the works it cites.

F. Magniez, A. Nayak, J. Roland, and M. Santha (2007), Proc. of the 39th Annual ACM Symposium on Theory of Computing, pp. 575–584

2007

Later among the works it cites.

P. Richter, Physical Review A 76

2007

Later among the works it cites.