The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Towards quantum machine learning with tensor networks
Open accessAbstract
Abstract Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. We demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 2×
“Our approach is therefore conceptually related to the quantum variational eigensolver [23, 24] and to the quantum approximate optimization algorithms [25], where quantum circuit parameters are discovered with the help of an auxiliary classical algorithm.”
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255 · cited 1×
“[3] Roman Orus, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states,” Annals of Physics 349, 117 – 158 (2014).”
BackgroundThe theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Verstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances in Physics · doi:10.1080/14789940801912366 · Cited by 1,762
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639 · cited 1×
“[30] Kosuke Mitarai, Makoto Negoro, Masahiro Kitagawa, and Keisuke Fuji, “Quantum circuit learning,” arxiv:1803.”
BackgroundFinitely correlated states on quantum spin chains
Fannes, M., Nachtergaele, B., & Werner, R. F. (1992) · Communications in Mathematical Physics · doi:10.1007/bf02099178 · Cited by 1,422
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
An area law for one-dimensional quantum systems
Hastings, M. B. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/08/p08024 · Cited by 1,131
Thermodynamic limit of density matrix renormalization.
Östlund, S., & Rommer, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.3537 · Cited by 1,077
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
No Signaling and Quantum Key Distribution
Barrett, J., Hardy, L., & Kent, A. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010503 · Cited by 918
Class of Quantum Many-Body States That Can Be Efficiently Simulated
Vidal, G. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.110501 · Cited by 847
Implementation of the simultaneous perturbation algorithm for stochastic optimization
Spall, J. C. (1998) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.705889 · Cited by 797
Classification with Quantum Neural Networks on Near Term Processors
Farhi, E., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1802.06002 · Cited by 598
Córcoles, A. D., Magesan, E., Srinivasan, S. J., Cross, A. W., Steffen, M., Gambetta, J. M., & Chow, J. M. (2015) · Nature Communications · doi:10.1038/ncomms7979 · Cited by 490
A New Scheme for the Tensor Representation
Hackbusch, W., & Kühn, S. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-009-9094-9 · Cited by 453
A generative modeling approach for benchmarking and training shallow quantum circuits
Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0157-8 · Cited by 379
Tensor Network States and Geometry
Evenbly, G., & Vidal, G. (2011) · Journal of Statistical Physics · doi:10.1007/s10955-011-0237-4 · Cited by 265
Tagliacozzo, L., Evenbly, G., & Vidal, G. (2009) · Physical Review B · doi:10.1103/physrevb.80.235127 · Cited by 261
Unsupervised Generative Modeling Using Matrix Product States
Han, Z.-Y., Wang, J., Fan, H., Wang, L., & Zhang, P. (2018) · Physical Review X · doi:10.1103/physrevx.8.031012 · Cited by 256
Learning relevant features of data with multi-scale tensor networks
Stoudenmire, E. M. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aaba1a · Cited by 200
Self-citationInformation Perspective to Probabilistic Modeling: Boltzmann Machines versus Born Machines
Cheng, S., Chen, J., & Wang, L. (2018) · Entropy · doi:10.3390/e20080583 · Cited by 104
Preparing Projected Entangled Pair States on a Quantum Computer
Schwarz, M., Temme, K., & Verstraete, F. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.110502 · Cited by 78
Density-matrix renormalization study of the Hubbard model [4]on a Bethe lattice
Lepetit, M.-B., Cousy, M., & Pastor, G. M. (2000) · The European Physical Journal B · doi:10.1007/s100510050053 · Cited by 46
Robust entanglement renormalization on a noisy quantum computer
Kim, I. H., & Swingle, B. (2017) · arXiv · doi:10.48550/arxiv.1711.07500 · Cited by 29
Preparing topological projected entangled pair states on a quantum computer
Schwarz, M., Temme, K., Verstraete, F., Pérez-García, D., & Cubitt, T. S. (2013) · Physical Review A · doi:10.1103/physreva.88.032321 · Cited by 27
Cited by
Quantum convolutional neural networks
Cong, I., Choi, S., & Lukin, M. D. (2019) · Nature Physics · doi:10.1038/s41567-019-0648-8 · Cited by 1,517
Parameterized quantum circuits as machine learning models
Benedetti, M., Lloyd, E., Sack, S., & Fiorentini, M. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab4eb5 · Cited by 1,144
A high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Matrix product states and projected entangled pair states: Concepts, symmetries, theorems
Cirac, J. I., Pérez-García, D., Schuch, N., & Verstraete, F. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.045003 · Cited by 769
Metadata
- Authors
- Huggins, W., Patil, P., Mitchell, B., Whaley, K. B., & Stoudenmire, E. M.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2019-01-09
- Volume
- 4
- Issue
- 2
- Pages
- 024001
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2794602324
- Cited by
- 366
- References
- 31
- FWCI
- 17.26
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.