Quantum Walks on Necklaces and Mixing

N. Metropolis, A.W. Rosenbluth, N.N. Rosenbluth, A.H. Teller, E. Teller: Equation of State Calculations for Fast Computing Machines,

1953

Earlier work this paper cites.

W.K. Hastings: Monte Carlo Sampling Methods Using Markov Chains and Their Applications,

1970

Earlier work this paper cites.

S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi: Optimization by Simulated Annealing,

1983

Earlier work this paper cites.

J. Černý: Thermodynamical Approach to the Travelling Salesman Problem,

1985

Earlier work this paper cites.

R. Feynman, Quantum mechanical computers, Opt. News, vol. 11, pp. 11–46 (1985),

1985

Earlier work this paper cites.

M. Jerrum and A. Sinclair, Polynomial-Time Approximation Algorithms for the Ising Model

1993

Earlier work this paper cites.

E. Farhi, S. Gutmann, Quantum Computation and Decision Trees

1998

Earlier work this paper cites.

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

2000

Earlier work this paper cites.

D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani: Quantum walks on graphs,

2001

Earlier work this paper cites.

A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous: One-dimensional quantum walks,

2001

Earlier work this paper cites.

C. Moore, A. Russell, Proc. of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM 2002), Cambridge, MA, LNCS Vol. 2483, Springer-Verlag, Berlin, 2002, pp. 164-178

2002

Cited alongside, same era.

A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, D. A. Spielman, Exponential algorithmic speedup by quantum walk

2003

Cited alongside, same era.

A. Ahmadi, R. Belk, C. Tamon, C. Wendler, On mixing in continuous-time quantum walks on some circulant graphs, Quantum Information & Computation, Vol.3, No.6 (2003), 611-618

2003

Cited alongside, same era.

M. Jerrum, A. Sinclair, and E. Vigoda, A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix Non-Negative Entries

2004

Cited alongside, same era.

D. de Falco, D. Tamascelli, Grover’s algorithm on a Feynman computer

2004

Cited alongside, same era.

M. Santha, Quantum Walk Based Search Algorithms

2008

Later among the works it cites.

A. Mizel, D. A. Lidar and M. Mitchell, Simple Proof of Equivalence Between Adiabatic Quantum Computation and the Circuit Model, Phys. Rev. Lett. 99, 070502 (2008)

2008

Later among the works it cites.

L. Eldar, O. Regev, Quantum SAT for a Qutrit-Cinquit Pair is QMA 1 -Complete, ICALP 2008, L. Aceto et al. (Eds), Part I, LNCS 5125, pp. 881-892, Springer-Verlag Berlin, Heidelberg (2008), L. Eldar, P. Love, D. Nagaj, O. Regev, in preparation

2008

Later among the works it cites.

D. Nagaj and P. Wocjan, Hamiltonian Quantum Cellular Automata in 1D, Phys. Rev. A 78, 032311 (2008)

2008

Later among the works it cites.

A. M. Childs, Universal computation by quantum walk

2009

Later among the works it cites.