Abstract
Here, we focus on more traditional approaches to quantum machine learning which try to speed up classical routines by making use of fault-tolerant quantum computers. We discuss quantum machine learning algorithms based on linear algebra subroutines such as matrix inversion, and those based on amplitude amplification or Grover search. We will then have a look at how classical probabilistic models like Bayesian nets and Boltzmann machines can be implemented on a quantum computer, and finish with an idea of how to use superposition to represent ensembles of classifiers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
An assumption that allows us to omit that the bounds also depend on the norm.
References
Rebentrost P., Bromley, T.R., Weedbrook, C., Lloyd, S.: Quantum hopfield neural network. Phys. Rev. A 98(4), 042308 (2018)
Aaronson, S.: Read the fine print. Nat. Phys. 11(4), 291–293 (2015)
Tang, E.: A quantum-inspired classical algorithm for recommendation systems. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 217–228 (2019)
Wiebe, N., Braun, D., Lloyd, S.: Quantum algorithm for data fitting. Phys. Rev. Lett. 109(5) (2012)
Schuld, M., Sinayskiy, I., Petruccione, F.: Prediction by linear regression on a quantum computer. Phys. Rev. A 94(2) (2016)
Rebentrost, P., Mohseni, M., Lloyd, S.: Quantum support vector machine for big data classification. Phys. Rev. Lett. 113 (2014)
Zhao, Z., Fitzsimons, J.K., Fitzsimons, J.F.: Quantum assisted Gaussian process regression (2015). arXiv:1512.03929
Berry, D.W., Childs, A.M., Kothari, R.: Hamiltonian simulation with nearly optimal dependence on all parameters. In: IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 792–809. IEEE (2015)
Wang, G.: Quantum algorithm for linear regression. Phys. Rev. A 96 (2017)
Hebb, D.O.: The Organization of Behavior: A Neuropsychological Theory. Wiley, New York (1949)
Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum principal component analysis. Nat. Phys. 10, 631–633 (2014)
Cong, I., Duan, L.: Quantum discriminant analysis for dimensionality reduction and classification. New J. Phys. 18 (2016)
Kerenedis, I., Prakash, A.: Quantum recommendation systems. In: Kerenidis, I., Prakash, A. (eds.) Quantum Recommendation Systems. LIPIcs-Leibniz International Proceedings in Informatics, vol. 67 (2017)
Wiebe, N., Kapoor, A., Svore, K.: Quantum nearest-neighbor algorithms for machine learning. Quantum Inf. Comput. 15, 0318–0358 (2015)
Aïmeur, E., Brassard, G., Gambs, S.: Quantum speed-up for unsupervised learning. Mach. Learn. 90(2), 261–287 (2013)
Ventura, D., Martinez, T.: Quantum associative memory. Inf. Sci. 124(1), 273–296 (2000)
Dürr, C., Hoyer, P.: A quantum algorithm for finding the minimum (1996). arXiv:quant-ph/9607014v2
Kapoor, A., Wiebe, N., Svore, K.: Quantum perceptron models. In: Advances in Neural Information Processing Systems, pp. 3999–4007 (2016)
Moore, C., Russell, A.: Quantum walks on the hypercube. In: Randomization and Approximation Techniques in Computer Science, pp. 164–178. Springer (2002)
Kendon, V.: Decoherence in quantum walks: a review. Math. Struct. Comput. Sci. 17, 1169–1220 (2007)
Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307–327 (2003)
Venegas-Andraca, S.E.: Quantum walks: a comprehensive review. Quantum Inf. Process. 11(5), 1015–1106 (2012)
Wang, J., Manouchehri, K.: Physical Implementation of Quantum Walks. Springer (2013)
Travaglione, B.C., Milburn, G.J.: Implementing the quantum random walk. Phys. Rev. A 65, 032310 (2002)
Wong, T.G.: Equivalence of Szegedy’s and coined quantum walks. Quantum Inf. Process. 16(9), 215 (2017)
Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–41. IEEE (2004)
Loke, T., Wang, J.B.: Efficient quantum circuits for Szegedy quantum walks. Ann. Phys. 382, 64–84 (2017)
Paparo, G.D., Martin-Delgado, M.A.: Google in a quantum network. Sci. Rep. 2 (2012)
Paparo, G.D., Dunjko, V., Makmal, A., Martin-Delgado, M.A., Briegel, H.J.: Quantum speedup for active learning agents. Phys. Rev. X 4(3), 031002 (2014)
Loke, T., Tang, J.W., Rodriguez, J., Small, M., Wang, J.B.: Comparing classical and quantum pageranks. Quantum Inf. Process. 16(1), 25 (2017)
Briegel, H.J., De las Cuevas, G.: Projective simulation for artificial intelligence. Sci. Rep. 2, 1–16 (2012)
Kempe, J.: Quantum random walks hit exponentially faster. Probab. Theory Relat. Fields 133, 215–235 (2005)
Yoder, T.J., Low, G.H., Chuang, I.L.: Quantum inference on Bayesian networks. Phys. Rev. A 89, 062315 (2014)
Ozols, M., Roetteler, M., Roland, J.: Quantum rejection sampling. ACM Trans. Comput. Theory (TOCT) 5(3), 11 (2013)
Wiebe, N., Kapoor, A., Svore, K.M.: Quantum deep learning (2014). arXiv:1412.3489v1
Wittek, P., Gogolin, C.: Quantum enhanced inference in Markov logic networks. Sci. Rep. 7 (2017)
Brandão, F.G.S.L., Svore, K.M.: Quantum speed-ups for solving semidefinite programs. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 415–426. IEEE (2017)
Poulin, D., Wocjan, P.: Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer. Phys. Rev. Lett. 103(22) (2009)
Breuer, H.-P., Petruccione, F.: The Theory of Open Quantum Systems. Oxford University Press (2002)
Monras, A., Beige, A., Wiesner, K.: Hidden quantum Markov models and non-adaptive read-out of many-body states. Appl. Math. Comput. Sci. 3 (2011)
Barry, J., Barry, D.T., Aaronson, S.: Quantum partially observable Markov decision processes. Phys. Rev. A 90 (2014)
Pearl, J.: Causality. Cambridge University Press (2009)
Ried, K., Agnew, M., Vermeyden, L., Janzing, D., Spekkens, R.W., Resch, K.J.: A quantum advantage for inferring causal structure. Nat. Phys. 11(5), 414–420 (2015)
Brukner, Č.: Quantum causality. Nat. Phys. 10(4) (2014)
Costa, F., Shrapnel, S.: Quantum causal modelling. New J. Phys. 18 (2016)
Schuld, M., Petruccione, F.: Quantum ensembles of quantum classifiers. Sci. Rep. 8(1), 2772 (2018)
Jacobs, R.A., Jordan, M.I., Nowlan, S.J., Hinton, G.E.: Adaptive mixtures of local experts. Neural Comput. 3(1), 79–87 (1991)
Breiman, L.: Random forests. Mach. Learn. 45(1), 5–32 (2001)
Schapire, R.E.: The strength of weak learnability. Mach. Learn. 5(2), 197–227 (1990)
Minka, T.P.: Bayesian model averaging is not model combination (2000). Comment available electronically at http://www.stat.cmu.edu/minka/papers/bma.html
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Schuld, M., Petruccione, F. (2021). Fault-Tolerant Quantum Machine Learning. In: Machine Learning with Quantum Computers. Quantum Science and Technology. Springer, Cham. https://doi.org/10.1007/978-3-030-83098-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-83098-4_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-83097-7
Online ISBN: 978-3-030-83098-4
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)