Quantum Inference on Bayesian Networks

N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, E. Teller, Equation of state calculations by fast computing machines, The Journal of Chemical Physics 21 (6) (1953) 1087–1092

1953

Earlier work this paper cites.

G. Cooper, E. Herskovits, A bayesian method for the induction of probabilistic networks from data 9 (4) (1992) 309–347

1992

Earlier work this paper cites.

P. Dagum, M. Luby, Approximating probabilistic inference in bayesian belief networks is np-hard, Artificial Intelligence 60 (1) (1993) 141 – 153

1993

Earlier work this paper cites.

E. Bernstein, U. Vazirani, Quantum complexity theory, in: in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM, 1993, pp. 11–20

1993

Earlier work this paper cites.

M. Druzdzel, H. Simon, Causality in bayesian belief networks, in: In Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence (UAI–93, Morgan Kaufmann Publishers, Inc, 1993, pp. 3–11

1993

Earlier work this paper cites.

S. Chib, E. Greenberg, Understanding the Metropolis-Hastings Algorithm, The American Statistician 49 (4) (1995) 327–335

1995

Earlier work this paper cites.

L. K. Grover, A fast quantum mechanical algorithm for database search, in: ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, ACM, 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 J. on Computing (1997) 1484–1509

1997

Earlier work this paper cites.

C. H. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strengths and weaknesses of quantum computing, SIAM JOURNAL OF COMPUTATION (1997) 1510–1523

1997

Earlier work this paper cites.

N. Friedman, M. Goldszmidt, A. Wyner, Data analysis with bayesian networks: A bootstrap approach (1999)

1999

Cited alongside, same era.

F. V. Jensen, Bayesian Networks and Decision Graphs (Information Science and Statistics), Springer, 2001

2001

Cited alongside, same era.

A. Galindo, M. A. Martin-Delgado, Information and computation: Classical and quantum aspects, Rev. Mod. Phys. 74 (2002) 347–423

2002

Cited alongside, same era.

G. Brassard, P. Høyer, M. Mosca, Quantum amplitude amplification and estimation, 2002, pp. 53–74

2002

Cited alongside, same era.

S. J. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, 2nd Edition, Pearson Education, 2003

2003

Cited alongside, same era.

D. M. Chickering, D. Heckerman, C. Meek, Large-sample learning of bayesian networks is np-hard, J. Mach. Learn. Res. 5 (2004) 1287–1330

2004

Later among the works it cites.

V. Bergholm, J. J. Vartiainen, M. Möttönen, M. M. Salomaa, Quantum circuits with uniformly controlled one-qubit gates, Phys. Rev. A 71 (2005) 052330

2005

Later among the works it cites.

D. Dong, C. Chen, H. Li, T. Tarn, Quantum reinforcement learning, Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on 38 (5) (2008) 1207–1220

2008

Later among the works it cites.

V. K. Mansinghka, Natively Probabilistic Computation, Ph.D. thesis, MIT (2009)

2009

Later among the works it cites.

S. Aaronson, Bqp and the polynomial hierarchy, in: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC ’10, ACM, New York, NY, USA, 2010, pp. 141–150

2010